Skip to main content

Encoding HTN Heuristics in PDDL Planning Instances

(Extended Abstract)

  • Conference paper
  • 1501 Accesses

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

Abstract

The paper sketches a transformation process that allows Hierarchical Task Network (HTN) based domain-dependent planning heuristics to be encoded into Planning Domain Definition Language (PDDL) [1] planning instances. SHOP2 [2] is chosen as a representative of the many different HTN planning approaches in the literature, but the paper discusses modifications of the transformation applicable to other HTN based planning approaches, too. The evaluation, based on five state-of-the art PDDL planners from the public domain, shows that incorporating HTN heuristics accelerates the planning process in terms of computation time and improves the quality of the resulting plans.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. McDermott, D.: The 1998 AI Planning Systems Competition. AI Magazine 21(2), 35–55 (2000)

    Google Scholar 

  2. Nau, D., Au, T.-C., Ilghami, O., Kuter, U., Murdock, W., Wu, D., Yaman, F.: SHOP2: An HTN Planning System. JAIR 20, 379–404 (2003)

    MATH  Google Scholar 

  3. Fritz, C., Baier, J.A., McIlraith, S.A.: ConGolog, Sin Trans: Compiling ConGolog into Basic Action Theories for Planning and Beyond. In: KR 2008, Sydney, Australia, September 16-19, pp. 600–610 (2008)

    Google Scholar 

  4. Fox, M., Long, D.: PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains. JAIR 20, 51–124 (2003)

    Google Scholar 

  5. Alford, R., Kuter, U., Nau, D.: Translating HTNs to PDDL: A Small Amount of Domain Knowledge Can Go a Long Way. In: IJCAI 2009, pp. 1629–1634. Morgan Kaufmann Publishers Inc., San Francisco (2009)

    Google Scholar 

  6. Ghallab, M., Nau, D., Traverso, P.: Automated Planning: Theory and Praxis. Morgan Kaufmann Publishers, Boston (2004)

    Google Scholar 

  7. Schattenberg, B., Weigl, A., Biundo, S.: Hybrid planning using flexible strategies. In: Furbach, U. (ed.) KI 2005. LNCS (LNAI), vol. 3698, pp. 249–263. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mies, C., Hertzberg, J. (2013). Encoding HTN Heuristics in PDDL Planning Instances. In: Timm, I.J., Thimm, M. (eds) KI 2013: Advances in Artificial Intelligence. KI 2013. Lecture Notes in Computer Science(), vol 8077. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40942-4_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40942-4_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40941-7

  • Online ISBN: 978-3-642-40942-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics