D* Lite

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 476-483

  Koenig, Sven ^a   Likhachev, Maxim ^b  

^a Georgia Institute of Technology   (United States)

^b Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MOBILE ROBOTS; PROBLEM SOLVING; ROBOTICS;

HEURISTIC SEARCH;

ARTIFICIAL INTELLIGENCE;

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

References (18)

1. Edelkamp, S. 1998. Updating shortest paths. In Proceedings of the European Conference on Artificial Intelligence, 655-659.
2. Frigioni, D.; Marchetti-Spaccamela, A.; and Nanni, U. 2000. Fully dynamic algorithms for maintaining shortest paths trees. Journal of Algorithms 34(2):251-281.
3. Hanks, S., and Weld, D. 1995. A domain-independent algorithm for plan adaptation. Journal of Artificial Intelligence Research 2:319-360.
4. Koenig, S., and Likhachev, M. 2001. Incremental A*. In Proceedings of the Neural Information Processing Systems.
5. Koenig, S.; Tovey, C.; and Halliburton, W. 2001. Greedy mapping of terrain. In Proceedings of the International Conference on Robotics and Automation, 3594-3599.
6. 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).
7. Matthies, L.; Xiong, Y; Hogg, R.; Zhu, D.; Rankin, A.; Kennedy, B.; Hebert, M.; Maclachlan, R.; Won, C.; Frost, T.; Sukhatme, G.; McHenry, M.; and Goldberg, S. 2000. A portable, autonomous, urban reconnaissance robot. In Proceedings of the International Conference on Intelligent Autonomous Systems.
8. Moore, A., and Atkeson, C. 1995. The parti-game algorithm for variable resolution reinforcement learning in multidimensional state-spaces. Machine Learning 21(3):199-233.
9. Nilsson, N. 1971. Problem-Solving Methods in Artificial Intelligence. McGraw-Hill.
10. Pearl, J. 1985. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley.
11. Ramalingam, G., and Reps, T. 1996. An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms 21:267-305.
12. Romero, L.; Morales, E.; and Sucar, E. 2001. An exploration and navigation approach for indoor mobile robots considering sensor's perceptual limitations. In Proceedings of the International Conference on Robotics and Automation, 3092-3097.
13. Stentz, A., and Hebert, M. 1995. A complete navigation system for goal acquisition in unknown environments. Autonomous Robots 2(2): 127-145.
14. Stentz, A. 1994. Optimal and efficient path planning for partially-known environments. In Proceedings of the International Conference on Robotics and Automation, 3310-3317.
15. Stentz, A. 1995. The focussed D* algorithm for real-time replanning. In Proceedings of the International Joint Conference on Artificial Intelligence, 1652-1659.
16. Thayer, S.; Digney, B.; Diaz, M.; Stentz, A.; Nabbe, B.; and Hebert, M. 2000. Distributed robotic mapping of extreme environments. In Proceedings of the SPIE: Mobile Robots XV and Telemanipulator and Telepresence Technologies VII, volume 4195.
17. Thrun, S.; Bücken, A.; Burgard, W.; Fox, D.; Fröhlinghaus, T.; Hennig, D.; Hofmann, T.; Krell, M.; and Schmidt, T. 1998. Map learning and high-speed navigation in RHINO. In Kortenkamp, D.; Bonasso, R.; and Murphy, R., eds., Artificial Intelligence Based Mobile Robotics: Case Studies of Successful Robot Systems. MIT Press. 21-52.
18. Yahja, A.; Stentz, A.; Brumitt, B.; and Singh, S. 1998. Framed-quadtree path planning for mobile robots operating in sparse environments. In International Conference on Robotics and Automation.