The Fringe-Saving A* search algorithm - A feasibility study

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 2391-2397

  Sun, Xiaoxun ^a   Koenig, Sven ^a  

^a University of Southern California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FEASIBILITY STUDIES; RUNTIMES; SEARCH ALGORITHMS; SEARCH PROBLEM; SEARCH TREES; SHORTEST PATH; TRAVERSABILITY;

FORESTRY; GRAPH THEORY;

ARTIFICIAL INTELLIGENCE;

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

References (9)

1. T. Corman, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, second edition, 1990.
2. P. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 2:100-107, 1968.
3. S. Koenig and M. Likhachev. Fast replanning for navigation in unknown terrain. Transaction on Robotics, 21(3):354-363, 2005. (Pubitemid 40858151)
4. S. Koenig and M. Likhachev. A new principle for incremental heuristic search: Theoretical results. In Proceedings of the International Conference on Autonomous Planning and Scheduling, pages 402-405, 2006.
5. S. Koenig, M. Likhachev, and D. Furcy. Lifelong planning A*. Artificial Intelligence Journal, 155(1-2):93-146, 2004.
6. S. Koenig, M. Likhachev, Y. Liu, and D. Furcy. Incremental heuristic search in artificial intelligence. Artificial Intelligence Magazine, 25(2):99-112, 2004.
7. J. Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, 1985.
8. A. Stentz. The focussed D* algorithm for real-time replanning. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 1652-1659, 1995.
9. K. Trovato and L. Dorst. Differential A*. IEEE Transactions on Knowledge and Data Engineering, 14:1218-1229, 2002.