Skip to main content

On Hierarchical Task Networks

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 2016)

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

Included in the following conference series:

Abstract

In planning based on hierarchical task networks (HTN), plans are generated by refining high-level actions (‘compound tasks’) into lower-level actions, until primitive actions are obtained that can be sent to execution. While a primitive action is defined by its precondition and effects, a high-level action is defined by zero, one or several methods: sets of (high-level or primitive) actions decomposing it together with a constraint. We give a semantics of HTNs in terms of dynamic logic with program inclusion. We propose postulates guaranteeing soundness and completeness of action refinement. We also show that hybrid planning can be analysed in the same dynamic logic framework.

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

Access this chapter

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 EPUB and 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

Institutional subscriptions

Notes

  1. 1.

    Our work is supported by CSC and CIMI. Thanks are due to the JELIA 2016 reviewers for their thorough comments. A long version of the paper with formal results and proofs is at www.irit.fr/~Andreas.Herzig/P/Jelia16htn.html.

References

  1. Baral, C., Son, T.C.: Extending ConGolog to allow partial ordering. In: Jennings, N.R., Lespérance, Y. (eds.) ATAL 1999. LNCS (LNAI), vol. 1757, pp. 188–204. Springer, Heidelberg (2000). doi:10.1007/10719619_14

    Google Scholar 

  2. del Cerro, L.F., Penttonen, M.: Grammar logics. Logique Et Analyse 31(121–122), 123–134 (1988)

    MathSciNet  MATH  Google Scholar 

  3. De Silva, L., Sardina, S., Padgham, L.: First principles planning in BDI systems. In: Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), vol. 2, pp. 1105–1112. International Foundation for Autonomous Agents and Multiagent Systems (2009)

    Google Scholar 

  4. Demri, S.: The complexity of regularity in grammar logics and related modal logics. J. Log. Comput. 11(6), 933–960 (2001). http://dx.doi.org/10.1093/logcom/11.6.933

    Article  MathSciNet  MATH  Google Scholar 

  5. Erol, K., Hendler, J., Nau, D.S.: HTN planning: complexity and expressivity. In: Proceedings of the 12th National Conference on Artificial Intelligence (AAAI), vol. 94, pp. 1123–1128 (1994)

    Google Scholar 

  6. Gabaldon, A.: Programming hierarchical task networks in the situation calculus. In: Proceedings of the 5th International Conference on Artificial Intelligence Planning and Scheduling Systems Workshop on On-line Planning and Scheduling (2002)

    Google Scholar 

  7. Goldman, R.P.: A semantics for HTN methods. In: Gerevini, A., Howe, A.E., Cesta, A., Refanidis, I. (eds.) Proceedings of the 19th International Conference on Automated Planning and Scheduling, (ICAPS). AAAI (2009)

    Google Scholar 

  8. Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)

    MATH  Google Scholar 

  9. Herzig, A., Lorini, E., Perrussel, L., Xiao, Z.: BDI logics for BDI architectures: old problems, new perspectives. Künstliche Intelligenz (to appear)

    Google Scholar 

  10. Herzig, A., Perrussel, L., Xiao, Z., Zhang, D.: Refinement of intentions. In: Michael, L., Kakas, A.C. (eds.) JELIA 2016. LNCS (LNAI), vol. 10021, pp. xx–yy. Springer, Heidelberg (2016)

    Google Scholar 

  11. Kambhampati, S., Cutkosky, M.R., Tenenbaum, J.M., Lee, S.H.: Integrating general purpose planners and specialized reasoners: case study of a hybrid planning architecture. IEEE Trans. Syst. Man Cybern. 23(6), 1503–1518 (1993)

    Article  Google Scholar 

  12. Kambhampati, S., Mali, A., Srivastava, B.: Hybrid planning for partially hierarchical domains. In: Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence (AAAI/IAAI), pp. 882–888 (1998)

    Google Scholar 

  13. Nau, D., Ghallab, M., Traverso, P.: Automated Planning: Theory & Practice. Morgan Kaufmann Publishers Inc., San Francisco (2004)

    MATH  Google Scholar 

  14. Sardina, S., de Silva, L., Padgham, L.: Hierarchical planning in BDI agent programming languages: a formal approach. In: Proceedings of the 5th International Conference on Autonomous Agents and Multiagent Systems, pp. 1001–1008. ACM (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhanhao Xiao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Herzig, A., Perrussel, L., Xiao, Z. (2016). On Hierarchical Task Networks. In: Michael, L., Kakas, A. (eds) Logics in Artificial Intelligence. JELIA 2016. Lecture Notes in Computer Science(), vol 10021. Springer, Cham. https://doi.org/10.1007/978-3-319-48758-8_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48758-8_38

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48757-1

  • Online ISBN: 978-3-319-48758-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics