Plan repair as an extension of planning

ICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2005, Pages 161-170

  Van Der Krogt, Roman ^a   De Weerdt, Mathijs ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC ENVIRONMENTS; GENERALISATION; PLANNING HEURISTICS; PLANNING SYSTEMS; PLANNING TECHNIQUES; REPAIR METHODS; REPAIR TECHNIQUES; STRAIGHT-FORWARD METHOD;

REPAIR;

EID: 84890252780     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Blum, A. L. and Furst, M. L. 1997. Fast planning through planning graph analysis. Artificial Intelligence 90:281-300.
2. Boella, G. and Damiano, R. 2002. A replanning algorithm for a reactive agent architecture. In Artificial Intelligence: Methodology, Systems, and Applications (LLNCS 2443J, 183- 192. Springer Verlag.
3. Drabble, B.; Dalton, J. and Tate, A. 1997. Repairing plans on the fly. In Proc. of the NASA Workshop on Planning and Scheduling for Space, Oxnard, CA.
4. Erol, K.; Hendler, J. and Nau, D. S. 1994. Semantics for hierarchical task network planning. Technical Report CS-TR-3239, UMIACS-TR-94-31, Computer Science, University of Maryland.
5. Gerevini, A. and Serina, I. 2000. Fast plan adaptation through planning graphs: Local and systematic search techniques. In Proc. of the Fifth Int. Conf. on AI Planning Systems (AIPS-00), 112-121.
6. Glover, F. and Laguna, M. 1993. Tabu search. In Modern Heuristic Techniques for Combinatorial Problems. Scientific Publications, Oxford.
7. Hammond, K. J. 1990. Explaining and repairing plans that fail. Artificial Intelligence 45:173-228.
8. Hanks, S. and Weld, D. 1995. A domain-independent algorithm for plan adaptation. Journal of AI Research 2:319-360.
9. Hoffmann, J. and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of AI Research 14:253-302.
10. Kambhampati, S.; Knoblock, C. A. and Yang, Q. 1995. Planning as refinement search: A unified framework for evaluating design tradeoffs in partial-order planning. Artificial Intelligence 76(1- 2): 167-238.
11. Kambhampati, S. 1997. Refinement planning as a unifying framework for plan synthesis. AI Magazine 18(2):67-97.
12. Koehler, J. 1994. Flexible plan reuse in a formal framework. In Proc. of the 2nd European Workshop on Planning (EWSP-93), 171-184.
13. Koenig, S.; Likhachev, M. and Furcy, D. 2002. Lifelong planning A*. Technical Report GIT-COGSCI-2002/2, Georgia Institute of Technology, Atlanta, Georgia.
14. Long, D., and Fox, M. 2003. The 3rd international planning competition: Results and analysis. JAIR 20:1-59.
15. Nebel, B. and Koehler, J. 1995. Plan reuse versus plan generation: A complexity-theoretic perspective. Artificial Intelligence 76:427-454.
16. van der Krogt, R.; de Weerdt, M. and Witteveen, C. 2003. A resource based framework for planning and replanning. Web Intelligence and Agent Systems 1(3/4): 173-186.
17. Wang, X. and Chien, S. 1997. Replanning using hierarchical task network and operator-based planning. Technical report, Jet Propulsion Laboratory Nasa.
18. Younes, H. L. S. and Simmons, R. G. 2003. VHPOP: Versatile heuristic partial order planner. JAIR 20:405-430.