Lifelong Planning A*

Artificial Intelligence

Volumn 155, Issue 1-2, 2004, Pages 93-146

  Koenig, Sven ^a   Likhachev, Maxim ^b   Furcy, David ^c  

^a USC ^*  (United States)

^b Carnegie Mellon University   (United States)

^c Georgia Institute of Technology   (United States)

Author keywords

A*; Continual planning; Heuristic search; Heuristic search based planning; Incremental search; Lifelong planning; Plan reuse; Replanning; Symbolic STRIPS style planning

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MOTION PLANNING; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

CONTINUAL PLANNING; HEURISTIC SEARCH; HEURISTIC SEARCH-BASED PLANNING; INCREMENTAL SEARCH; LIFELONG PLANNING; PLAN REUSE; REPLANNING; SYMBOLIC STRIPS-STYLE PLANNING;

ARTIFICIAL INTELLIGENCE;

EID: 1842564047     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2003.12.001     Document Type: Article

References (53)

1. desJardins M., Durfee E., Ortiz C., Wolverton M. A survey of research in distributed, continual planning. Artificial Intelligence Magazine. 20:(4):1999;13-22.
2. Kott A., Saks V., Mercer A. A new technique enables dynamic replanning and rescheduling of aeromedical evacuation. Artificial Intelligence Magazine. 20:(1):1999;43-53.
3. Myers K. CPEF: A continuous planning and execution framework. Artificial Intelligence Magazine. 20:(4):1999;63-69.
4. Pemberton J., Korf R. Incremental search algorithms for real-time decision making. Proceedings of the International Conference on Artificial Intelligence Planning Systems, Chicago, IL. 1994;140-145.
5. Ramalingam G., Reps T. An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms. 21:1996;267-305.
6. Nilsson N. Problem-Solving Methods in Artificial Intelligence. 1971;McGraw-Hill, New York.
7. Thrun S. Lifelong learning algorithms. Thrun S., Pratt L. Learning To Learn. 1998;Kluwer Academic, Dordrecht.
8. Likhachev M., Koenig S. Speeding up the parti-game algorithm. Becker S., Thrun S., Obermayer K. Advances in Neural Information Processing Systems. vol. 15:2002;MIT Press, Cambridge, MA.
9. Pearl J. Heuristics: Intelligent Search Strategies for Computer Problem Solving. 1985;Addison-Wesley, Reading, MA.
10. Bellman R. Dynamic Programming. 1957;Princeton University Press, Princeton, NJ.
11. Nebel B., Koehler J. Plan reuse versus plan generation: A theoretical and empirical analysis. Artificial Intelligence. 76:(1-12):1995;427-454.
12. Narváez P., Siu K., Tzeng H. New dynamic algorithms for shortest path tree computation. IEEE/ACM Trans. Networking. 8:(6):2000;734-746.
13. Buriol L., Resende M., Ribeiro C., Thorup M. A memetic algorithm for OSPF routing. Proceedings of the INFORMS Telecommunications Conference. 2002;187-188.
14. McDermott D. A heuristic estimator for means-ends analysis in planning. Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling. 1996;142-149.
15. Bonet B., Loerincs G., Geffner H. A robust and fast action selection mechanism. Proc. AAAI-97, Providence, RI. 1997;714-719.
16. Bonet B., Geffner H. Heuristic search planner 2.0. Artificial Intelligence Magazine. 22:(3):2000;77-80.
17. Hoffmann J. FF: The fast-forward planning systems. Artificial Intelligence Magazine. 22:(3):2000;57-62.
18. Refanidis I., Vlahavas I. GRT: A domain-independent heuristic for STRIPS worlds based on greedy regression tables. Proceedings of the European Conference on Planning. 1999;346-358.
19. Srivastava B., Nguyen X., Kambhampati S., Do M., Nambiar U., Nie Z., Niganda R., Zimmerman T. AltAlt: Combining graphplan and heuristic state search. Artificial Intelligence Magazine. 22:(3):2000;88-90.
20. Koenig S., Furcy D., Bauer C. Heuristic search-based replanning. Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling. 2002;294-301.
21. Hanks S., Weld D. A domain-independent algorithm for plan adaptation. J. Artificial Intelligence Res. 2:1995;319-360.
22. Dechter R., Dechter A. Belief maintenance in dynamic constraint networks. Proc. AAAI-88, St. Paul. MN. 1988;37-42.
23. Verfaillie G., Schiex T. Solution reuse in dynamic constraint satisfaction problems. Proc. AAAI-94, Seattle, WA. 1994;307-312.
24. Mittal S., Falkenhainer B. Dynamic constraint satisfaction problems. Proc. AAAI-90, Boston, MA. 1990;25-32.
25. Miguel I., Shen Q. Extending FCSP to support dynamically changing problems. Proceedings of IEEE International Fuzzy Systems Conference. 1999;1615-1620.
26. Hammond K. Explaining and repairing plans that fail. Artificial Intelligence. 45:1990;173-228.
27. Simmons R. A theory of debugging plans and interpretations. Proc. AAAI-88, St. Paul, MN. 1988;94-99.
28. Gerevini A., Serina I. Fast plan adaptation through planning graphs: Local and systematic search techniques. Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling. 2000;112-121.
29. Koehler J. Flexible plan reuse in a formal framework. Bäckström C., Sandewall E. Current Trends in AI Planning. 1994;171-184 IOS Press, Amsterdam.
30. Veloso M. Planning and Learning by Analogical Reasoning. 1994;Springer, Berlin.
31. Alterman R. Adaptive planning. Cognitive Sci. 12:(3):1988;393-421.
32. Kambhampati S., Hendler J. A validation-structure-based theory of plan modification and reuse. Artificial Intelligence. 55:1992;193-258.
33. Ramalingam G., Reps T. On the computational complexity of dynamic graph problems. Theoret. Comput. Sci. 158:(1-2):1996;233-277.
34. Ausiello G., Italiano G., Marchetti-Spaccamela A., Nanni U. Incremental algorithms for minimal length paths. J. Algorithms. 12:(4):1991;615-638.
35. Even S., Shiloach Y. An on-line edge deletion problem. J. ACM. 28:(1):1981;1-4.
36. Even S., Gazit H. Updating distances in dynamic graphs. Meth. Oper. Res. 49:1985;371-387.
37. Feuerstein E., Marchetti-Spaccamela A. Dynamic algorithms for shortest paths in planar graphs. Theoret. Comput. Sci. 116:(2):1993;359-371.
38. Franciosa P., Frigioni D., Giaccio R. Semi-dynamic breadth-first search in digraphs. Theoret. Comput. Sci. 250:(1-2):2001;201-217.
39. Frigioni D., Marchetti-Spaccamela A., Nanni U. Fully dynamic output bounded single source shortest path problem. Proceedings of the Symposium on Discrete Algorithms, Atlanta, GA. 1996;212-221.
40. Goto S., Sangiovanni-Vincentelli A. A new shortest path updating algorithm. Networks. 8:(4):1978;341-372.
41. Italiano G. Finding paths and deleting edges in directed acyclic graphs. Inform. Process. Lett. 28:(1):1988;5-11.
42. Klein P., Subramanian S. Fully dynamic approximation schemes for shortest path problems in planar graphs. Proceedings of the International Workshop on Algorithms and Data Structures. 1993;443-451.
43. Lin C., Chang R. On the dynamic shortest path problem. J. Inform. Process. 13:(4):1990;470-476.
44. Rohnert H. A dynamization of the all pairs least cost path problem. Proceedings of the Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany. 1985;279-286.
45. Spira P., Pan A. On finding and updating spanning trees and shortest paths. SIAM J. Comput. 4:1975;375-380.
46. Edelkamp S. Updating shortest paths. Proceedings of the European Conference on Artificial Intelligence, Brighton, UK. 1998;655-659.
47. Frigioni D., Marchetti-Spaccamela A., Nanni U. Semidynamic algorithms for maintaining single source shortest path trees. Algorithmica. 22:(3):1998;250-274.
48. Frigioni D., Marchetti-Spaccamela A., Nanni U. Fully dynamic algorithms for maintaining shortest paths trees. J. Algorithms. 34:(2):2000;251-281.
49. Stentz A. The focussed D* algorithm for real-time replanning. Proc. IJCAI-95, Montreal, Quebec. 1995;1652-1659.
50. Koenig S., Likhachev M. Improved fast replanning for robot navigation in unknown terrain. Proceedings of the International Conference on Robotics and Automation, Washington, DC. 2002;968-975.
51. M. Al-Ansari, Efficient reinforcement learning in continuous environments, PhD Thesis, College of Computer Science, Northeastern University, Boston, MA, 2001.
52. Demetrescu C., Frigioni D., Marchetti-Spaccamela A., Nanni U. Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study. Proceedings of the Workshop on Algorithm Engineering. 2000;218-229.
53. Proietti G. Dynamic maintenance versus swapping: an experimental study on shortest paths trees. Proceedings of the Workshop on Algorithm Engineering. 2000;207-217.