Skip to main content

Plan Recovery in Reactive HTNs Using Symbolic Planning

  • Conference paper
  • First Online:
Artificial General Intelligence (AGI 2015)

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

Included in the following conference series:

Abstract

Building formal models of the world and using them to plan future action is a central problem in artificial intelligence. In this work, we combine two well-known approaches to this problem, namely, reactive hierarchical task networks (HTNs) and symbolic linear planning. The practical motivation for this hybrid approach was to recover from breakdowns in HTN execution by dynamically invoking symbolic planning. This work also reflects, however, on the deeper issue of tradeoffs between procedural and symbolic modeling. We have implemented our approach in a system that combines a reactive HTN engine, called Disco, with a STRIPS planner implemented in Prolog, and conducted a preliminary evaluation.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ayan, N.F., Kuter, U., Yaman, F., Goldman, R.: HOTRiDE: Hierarchical ordered task replanning in dynamic environments. In: Planning and Plan Execution for Real-World Systems-Principles and Practices for Planning in Execution: Papers from the ICAPS Workshop, Providence, RI (2007)

    Google Scholar 

  2. Boella, G., Damiano, R.: A replanning algorithm for a reactive agent architecture. In: Scott, D. (ed.) AIMSA 2002. LNCS (LNAI), vol. 2443, pp. 183–192. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Brom, C.: Hierarchical reactive planning: Where is its limit. In: Proceedings of MNAS: Modelling Natural Action Selection, Edinburgh, Scotland (2005)

    Google Scholar 

  4. Fikes, R.E., Nilsson, N.J.: STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2, 189–208 (1971)

    Article  Google Scholar 

  5. Firby, R.: An investigation into reactive planning in complex domains. In: AAAI, pp. 202–206 (1987)

    Google Scholar 

  6. Ghallab, M., et al.: PDDL-The planning domain definition language (1998)

    Google Scholar 

  7. Krogt, R.V.D., Weerdt, M.D.: Plan repair as an extension of planning. In: ICAPS, pp. 161–170 (2005)

    Google Scholar 

  8. Rich, C.: Building task-based user interfaces with ANSI/CEA-2018. IEEE Computer 42, 20–27 (2009)

    Article  Google Scholar 

  9. Rich, C., Sidner, C.L.: Using collaborative discourse theory to partially automate dialogue tree authoring. In: Nakano, Y., Neff, M., Paiva, A., Walker, M. (eds.) IVA 2012. LNCS, vol. 7502, pp. 327–340. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  10. Warfield, I., Hogg, C., Lee-Urban, S., Munoz-Avila, H.: Adaptation of hierarchical task network plans. In: FLAIRS, pp. 429–434 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Charles Rich .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Ould Ouali, L., Rich, C., Sabouret, N. (2015). Plan Recovery in Reactive HTNs Using Symbolic Planning. In: Bieger, J., Goertzel, B., Potapov, A. (eds) Artificial General Intelligence. AGI 2015. Lecture Notes in Computer Science(), vol 9205. Springer, Cham. https://doi.org/10.1007/978-3-319-21365-1_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21365-1_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21364-4

  • Online ISBN: 978-3-319-21365-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics