Skip to main content

Plan Repair in Hybrid Planning

  • Conference paper
KI 2008: Advances in Artificial Intelligence (KI 2008)

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

Included in the following conference series:

Abstract

We present a domain-independent approach to plan repair in a formal framework for hybrid planning. It exploits the generation process of the failed plan by retracting decisions that led to the failed plan fragments. They are selectively replaced by suitable alternatives, and the repaired plan is completed by following the previous generation process as close as possible. This way, a stable solution is obtained, i.e. a repair of the failed plan that causes minimal perturbation.

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 89.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. Biundo, S., Schattenberg, B.: From abstract crisis to concrete relief–a preliminary report on combining state abstraction and HTN planning. In: Proc. of ECP 2001, pp. 157–168 (2001)

    Google Scholar 

  2. Schattenberg, B., Bidot, J., Biundo, S.: On the construction and evaluation of flexible plan-refinement strategies. In: Hertzberg, J., Beetz, M., Englert, R. (eds.) KI 2007. LNCS (LNAI), vol. 4667, pp. 367–381. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  4. Fox, M., Gerevini, A., Long, D., Serina, I.: Plan stability: Replanning versus plan repair. In: Proc. of ICAPS 2006, pp. 212–221 (2006)

    Google Scholar 

  5. Yoon, S., Fern, A., Givan, R.: FF-Replan: A baseline for probabilistic planning. In: Proc. of ICAPS 2006, pp. 352–359 (2006)

    Google Scholar 

  6. Nebel, B., Köhler, J.: Plan reuse versus plan generation: A theoretical and empirical analysis. Artificial Intelligence 76, 427–454 (1995)

    Article  Google Scholar 

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

    Google Scholar 

  8. Kambhampati, S., Hendler, J.A.: A validation-structure-based theory of plan modification and reuse. Artificial Intelligence 55, 193–258 (1992)

    Article  Google Scholar 

  9. Drabble, B., Tate, A., Dalton, J.: Repairing plans on-the-fly. In: Proceedings of the NASA Workshop on Planning and Scheduling for Space (1997)

    Google Scholar 

  10. van der Krogt, R., de Weerdt, M.: Plan repair as an extension of planning. In: Proc. ICAPS 2005, pp. 161–170 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Andreas R. Dengel Karsten Berns Thomas M. Breuel Frank Bomarius Thomas R. Roth-Berghofer

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bidot, J., Schattenberg, B., Biundo, S. (2008). Plan Repair in Hybrid Planning. In: Dengel, A.R., Berns, K., Breuel, T.M., Bomarius, F., Roth-Berghofer, T.R. (eds) KI 2008: Advances in Artificial Intelligence. KI 2008. Lecture Notes in Computer Science(), vol 5243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85845-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85845-4_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85844-7

  • Online ISBN: 978-3-540-85845-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics