Heuristic Search-Based Replanning

Proceedings of the 6th International Conference on Artificial Intelligence Planning Systems, AIPS 2002

Volumn , Issue , 2002, Pages 294-301

  Koenig, Sven ^a   Furcy, David ^a   Bauer, Colin ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; MODULAR ROBOTS;

FEASIBILITY STUDIES; HEURISTIC SEARCH; PLANNING TASKS; RE-PLANNING; REAL-WORLD PLANNING PROBLEM; SEARCH-BASED;

HEURISTIC ALGORITHMS;

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

References (26)

1. Alterman, R. 1988. Adaptive planning. Cognitive Science 12(3):393-421.
2. Bonet, B., and Geffner, H. 2000. Heuristic search planner 2.0. Artificial Intelligence Magazine 22(3):77-80.
3. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artificial Intelligence - Special Issue on Heuristic Search 129(1):5-33.
4. Bonet, B.; Loerincs, G.; and Geffner, H. 1997. A robust and fast action selection mechanism. In Proceedings of the National Conference on Artificial Intelligence, 714-719.
5. desJardins, M.; Durfee, E.; Ortiz, C.; and Wolverton, M. 1999. A survey of research in distributed, continual planning. Artificial Intelligence Magazine 20(4):13-22.
6. Gerevini, A., and Serina, I. 2000. Fast plan adaptation through planning graphs: Local and systematic search techniques. In Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling, 112-121.
7. Hammond, K. 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 Artificial Intelligence Research 2:319-360.
9. Hoffmann, J. 2000. FF: The fast-forward planning systems. Artificial Intelligence Magazine 22(3):57-62.
10. Kambhampati, S., and Hendler, J. 1992. A validation-structure-based theory of plan modification and reuse. Artificial Intelligence 55:193-258.
11. Koehler, J. 1994. Flexible plan reuse in a formal framework. In Bäckström, C., and Sandewall, E., eds., Current Trends in AI Planning. IOS Press. 171-184.
12. Koenig, S., and Likhachev, M. 2001. Incremental A*. In Advances in Neural Information Processing Systems 14.
13. Kott, A.; Saks, V.; and Mercer, A. 1999. A new technique enables dynamic replanning and rescheduling of aeromedical evacuation. Artificial Intelligence Magazine 20(1):43-53.
14. Likhachev, M., and Koenig, S. 2001. Lifelong Planning A* and Dynamic A* Lite: The proofs. Technical report, College of Computing, Georgia Institute of Technology, Atlanta (Georgia).
15. McDermott, D. 1996. A heuristic estimator for means-ends analysis in planning. In Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling, 142-149.
16. Myers, K. 1999. Cpef: A continuous planning and execution framework. Artificial Intelligence Magazine 20(4):63-69.
17. Nebel, B., and Koehler, J. 1995. Plan reuse versus plan generation: A theoretical and empirical analysis. Artificial Intelligence 76(1-2):427-454.
18. Pearl, J. 1985. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley.
19. Ramalingam, G., and Reps, T. 1996. An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms 21:267-305.
20. Refanidis, I., and Vlahavas, I. 1999. GRT: a domain-independent heuristic for STRIPS worlds based on greedy regression tables. In Proceedings of the European Conference on Planning, 346-358.
21. Simmons, R. 1988. A theory of debugging plans and interpretations. In Proceedings of the National Conference on Artificial Intelligence, 94-99.
22. Srivastava, B.; Nguyen, X.; Kambhampati, S.; Do, M.; Nambiar, U.; Nie, Z.; Niganda, R.; and Zimmerman, T. 2000. AltAlt: Combining graphplan and heuristic state search. Artificial Intelligence Magazine 22(3):88-90.
23. Stentz, A. 1995. The focussed D* algorithm for real-time replanning. In Proceedings of the International Joint Conference on Artificial Intelligence, 1652-1659.
24. Thrun, S. 1998. Lifelong learning algorithms. In Thrun, S., and Pratt, L., eds., Learning To Learn. Kluwer Academic Publishers.
25. Veloso, M. 1994. Planning and Learning by Analogical Reasoning. Springer.
26. Wang, X. 1996. Learning Planning Operators by Observation and Practice. Ph.D. Dissertation, School of Computer Science, Carnegie Mellon University, Pittsburgh (Pennsylvania).