Plan stability: Replanning versus plan repair

ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling

Volumn 2006, Issue , 2006, Pages 212-221

  Fox, Maria ^a   Gerevini, Gerevini ^b   Long, Derek ^a   Serina, Ivan ^b  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

^b UNIVERSITY OF BRESCIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; AUTOMATION; REAL TIME SYSTEMS; SCHEDULING; STABILITY;

PLAN REPAIR STRATEGIES; PLAN STABILITY; REAL ENVIRONMENT; REPLANNING;

STRATEGIC PLANNING;

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

References (23)

1. Bacchus, F., and Kabanza, F. 2000. Using temporal logic to express search control knowledge for planning. Artificial Intelligence 116(1-2):123-191.
2. Boutilier, C.; Dean, T.; and Hanks, S. 1999. Decision-theoretic planning: Structural assumptions and computational leverage. J. AI Res. 11:1-94.
3. Cushing, W., and Kambhampati, S. 2005. Replanning: a new perspective. In Proc. of ICAPS.
4. Drummond, M.; Bresina, J.; and Swanson, K. 1994. Just-in-case scheduling. In Proc. 12th Nat. Conf. on AI (AAAI), 1098-1004.
5. Frank, J.; Gross, M. A. K.; and Kürklü, E. 2004. SOFIA'S choice: An AI approach to scheduling airborne astronomy observations. In Proc. of AAAI, 828-835.
6. Gerevini, A., and Serina, I. 2000. Fast plan adaptation through planning graphs: local and systematic search techniques. In Proc. of Int. Conf. on AI Planning and Scheduling (AIPS'00).
7. Gerevini, A.; Saetti, A.; and Serina, I. 2003. Planning through stochastic local search and temporal action graphs. J. AI Res. 20.
8. Hammond, K. 1990. Explaining and repairing plans that fail. Artificial Intelligence 45:173-228.
9. Hanks, S., and Weld, D. 1995. A domain-independent algorithm for plan adaptation. J. AI Res. 2:319-360.
10. Hoffmann, J. 2003. The Metric-FF planning system: Translating "ignoring delete lists" to numerical state variables. J. AI Res. 20.
11. Horty, J. F., and Pollack, M. E. 2001. Evaluating new options in the context of existing plans. Artificial Intelligence 127:199-220.
12. Kambhampati, S., and Hendler, J. 1992. A validation-structure-based theory of plan modification and reuse. Artificial Intelligence 55:193-258.
13. Kambhampati, S. 1990. Mapping and retrieval during plan reuse: a validation structure based approach. In Proc. of AAAI, 170-175.
14. Koenig, S.; Furcy, D.; and Bauer, C. 2002. Heuristic .search-based replanning. In Proc. of Int. Conf. on AI Planning and Scheduling (AIPS'02), 310-317.
15. Kvarnström, J., and Magnusson, M. 2003. Talplanner in the 3rd international planning competition: Extensions and control rules. J. AI Research 20.
16. Nau, D.; Au, T.-C.; llghami, O.; Kuter, U.; Murdoch, J.; Wu, D.; and Yaman, F. 2003. An HTN planning environment. J. AI Res. 20.
17. Nebel, B., and Koehler, J. 1995. Plan reuse versus plan generalion: A theoretical and empirical analysis. Artificial Intelligence 76(1-2):427-454.
18. Pryor, L., and Collins, G. 1996. Planning for contingencies: A decision-based approach. J. AI Res. 4:287-339.
19. Simmons, R. 1988. A theory of debugging plans and interpretations. In Proc. of AAAI, 94-99.
20. Stulp, F., and Beetz, M. 2005. Optimized execution of action chains using learned performance models of abstract actions. In Proc. of IJCAI, 1272-1278.
21. Traum, D., and Allen, J. 1994. Towards a formal theory of repair in plan execution and plan recognition. In Proc. UK PlanSIG.
22. van der Krogt, R., and de Weerdt, M. 2005. Plan repair as an extension of planning. In Proc. of the 15th Int. Conf. on Automated Planning and Scheduling (ICAPS-05), 161-170.
23. Veloso, M. 1994. Planning and learning by analogical reasoning. LNCS 886. Springer-Verlag.