Skip to main content

A Comparison of BDI Based Real-Time Reasoning and HTN Based Planning

  • Conference paper
AI 2004: Advances in Artificial Intelligence (AI 2004)

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

Included in the following conference series:

Abstract

The Belief-Desire-Intention (BDI) model of agency is an architecture based on Bratman’s theory of practical reasoning. Hierarchical Task Network (HTN) decomposition on the other hand is a planning technique which has its roots in classical planning systems such as STRIPS. Despite being used for different purposes, HTN and BDI systems appear to have a lot of similarities in the problem solving approaches they adopt. This paper presents these similarities. A systematic method for mapping between the two systems is developed, and experimental results for different kinds of environments are presented.

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 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rao, A.S., Georgeff, M.P.: BDI-agents: from theory to practice. In: Proceedings of the First International Conference on Multiagent Systems, San Francisco (1995)

    Google Scholar 

  2. Busetta, P., Rönnquist, R., Hodgson, A., Lucas, A.: Jack Intelligent Agents - components for intelligent agents in java. AgentLink News Letter. Agent Oriented Software Pty. Ltd, Melbourne (1999)

    Google Scholar 

  3. Georgeff, M., Ingrand, F.: Decision making in an embedded reasoning system. In: Proceedings of the International Joint Conference on Aritificial Intelligence, pp. 972–978 (1989)

    Google Scholar 

  4. Erol, K., Hendler, J.A., Nau, D.S.: Complexity results for HTN planning. Annals of Mathematics and Artificial Intelligence 18, 69–93 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  5. Nau, D., Cao, Y., Lotem, A., Munoz-Avila, H.: SHOP: Simple Hierarchical Ordered Planner. In: Proceedings of the International Joint Conference on AI, pp. 968–973 (1999)

    Google Scholar 

  6. Paolucci, M., Shehory, O., Sycara, K.P., Kalp, D., Pannu, A.: A planning component for RETSINA agents. In: Jennings, N.R. (ed.) ATAL 1999. LNCS, vol. 1757, pp. 147–161. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  7. Wilkins, D.E., Myers, K.L., Lowrance, J.D., Wesley, L.P.: Planning and reacting in uncertain and dynamic environments. Journal of Experimental and Theoretical AI 7, 197–227 (1995)

    Article  Google Scholar 

  8. Winikoff, M., Padgham, L., Harland, J., Thangarajah, J.: Declarative & procedural goals in intelligent agent systems. In: Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR 2002), Toulouse, France (2002)

    Google Scholar 

  9. Gupta, N., Nau, D.S.: On the complexity of blocks-world planning. Artificial Intelligence 56, 223–254 (1992)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Silva, L., Padgham, L. (2004). A Comparison of BDI Based Real-Time Reasoning and HTN Based Planning. In: Webb, G.I., Yu, X. (eds) AI 2004: Advances in Artificial Intelligence. AI 2004. Lecture Notes in Computer Science(), vol 3339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30549-1_118

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30549-1_118

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24059-4

  • Online ISBN: 978-3-540-30549-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics