ERA: Extracting Planning Macro-Operators from Adjacent and Non-adjacent Sequences | SpringerLink
Skip to main content

ERA: Extracting Planning Macro-Operators from Adjacent and Non-adjacent Sequences

  • Conference paper
  • First Online:
Knowledge Management and Acquisition for Intelligent Systems (PKAW 2021)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 12280))

Included in the following conference series:

Abstract

Intuitively, Automated Planning systems capable of learning from previous experiences should be able to achieve better performance. One way to build on past experiences is to augment domains with macro-operators (i.e. frequent operator sequences). In most existing works, macros are generated from chunks of adjacent operators extracted from a set of plans. Although they provide some interesting results this type of analysis may provide incomplete results. In this paper, we propose ERA, an automatic extraction method for macro-operators from a set of solution plans. Our algorithm is domain and planner independent and can find all macro-operator occurrences even if the operators are non-adjacent. Our method has proven to successfully find macro-operators of different lengths for six different benchmark domains. Also, our experiments highlighted the capital role of considering non-adjacent occurrences in the extraction of macro-operators.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    The operators of the macro can be moved contiguously in the plan without an impact on the final state or without impeding its execution.

  2. 2.

    See description in the subsection Identifier construction.

  3. 3.

    Further details can be found at http://www.plg.inf.uc3m.es/ipc2011-learning/Domains.html.

  4. 4.

    https://bitbucket.org/planning-tools/pddl-generators.

References

  1. Botea, A., Enzenberger, M., Müller, M., Schaeffer, J.: Macro-FF: improving AI planning with automatically learned macro-operators. J. Artif. Intelli. Res. 24, 581–621 (2005)

    Article  Google Scholar 

  2. Botea, A., Müller, M., Schaeffer, J.: Learning partial-order macros from solutions. In: Proceedings of the Fifteenth International Conference on International Conference on Automated Planning and Scheduling, pp. 231–240. AAAI Press (2005)

    Google Scholar 

  3. Chrpa, L., Vallati, M., McCluskey, T.L.: MUM: a technique for maximising the utility of macro-operators by constrained generation and use. In: Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling (2014)

    Google Scholar 

  4. Coles, A., Smith, A.: Marvin: a heuristic search planner with online macro-action learning. J. Artif. Intell. Res. 28, 119–156 (2007)

    Article  Google Scholar 

  5. Dulac, A., Pellier, D., Fiorino, H., Janiszek, D.: Learning useful macro-actions for planning with n-grams. In: 2013 IEEE 25th International Conference on Tools with Artificial Intelligence, pp. 803–810 (2013). https://doi.org/10.1109/ICTAI.2013.123

  6. Fikes, R., Nilsson, N.: STRIPS: a new approach to the application of theorem proving to problem solving. Artif. Intell. 3–4(2), 189–208 (1971)

    Article  Google Scholar 

  7. Fournier-Viger, P., Lin, J.C.W., Kiran, R.U., Koh, Y.S., Thomas, R.: A survey of sequential pattern mining. Data Sci. Pattern Recogn. 1(1), 54–77 (2017)

    Google Scholar 

  8. Ghallab, M., Nau, D., Traverso, P.: Automated Planning: Theory and Practice. Elsevier, Amsterdam (2004)

    MATH  Google Scholar 

  9. Han, J., Pei, J., Kamber, M.: Data Mining: Concepts and Techniques. Elsevier, Amsterdam (2011)

    MATH  Google Scholar 

  10. Hofmann, T., Niemueller, T., Lakemeyer, G.: Initial results on generating macro actions from a plan database for planning on autonomous mobile robots. In: Twenty-Seventh International Conference on Automated Planning and Scheduling (2017)

    Google Scholar 

  11. Newton, M.A.H., Levine, J.: Implicit learning of macro-actions for planning. In: Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010) (2010)

    Google Scholar 

  12. Vukovic, M., et al.: Towards automated planning for enterprise services: opportunities and challenges. In: Yangui, S., Bouassida Rodriguez, I., Drira, K., Tari, Z. (eds.) ICSOC 2019. LNCS, vol. 11895, pp. 64–68. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-33702-5_6

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sandra Castellanos-Paez .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Castellanos-Paez, S., Rombourg, R., Lalanda, P. (2021). ERA: Extracting Planning Macro-Operators from Adjacent and Non-adjacent Sequences. In: Uehara, H., Yamaguchi, T., Bai, Q. (eds) Knowledge Management and Acquisition for Intelligent Systems. PKAW 2021. Lecture Notes in Computer Science(), vol 12280. Springer, Cham. https://doi.org/10.1007/978-3-030-69886-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-69886-7_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-69885-0

  • Online ISBN: 978-3-030-69886-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics