Using distance estimates in heuristic search: A re-evaluation

International Symposium on Combinatorial Search, SoCS 2009

Volumn , Issue , 2009, Pages

  Thayer, Jordan T ^a   Ruml, Wheeler ^a   Kreis, Jeff ^a  

^a Univ of New Hampshire   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC SEARCH; HEURISTIC SEARCH ALGORITHMS; PATHFINDING; RE-EVALUATION; SPEED UP;

COST ESTIMATING; ESTIMATION; HEURISTIC ALGORITHMS; MODULAR ROBOTS;

COST BENEFIT ANALYSIS;

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

References (10)

1. Bulitko, V.; Sturtevant, N.; Lu, J.; and Yau, T. 2007. Graph abstraction in real-time heuristic search. JAIR 30:51-100.
2. Cormen, T.; Leiserson, C.; Rivest, R.; and Stein, C. 2001. Introduction to Algorithms. Cambridge, MA: MIT Press.
3. Dechter, R., and Pearl, J. 1988. The optimality of A*. In Kanal, L., and Kumar, V., eds., Search in Artificial Intelligence. Springer-Verlag. 166-199.
4. Hansen, E. A., and Zhou, R. 2007. Anytime heuristic search. JAIR 28:267-297.
5. Hart, P. E.; Nilsson, N. J.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions of Systems Science and Cybernetics SSC-4(2):100-107.
6. Korf, R. E. 1985. Iterative-deepening-A*: An optimal admissible tree search. In Proceedings of IJCAI-85, 1034-1036.
7. Likhachev, M.; Gordon, G.; and Thrun, S. 2003. ARA*: Formal analysis. Technical Report CMU-CS-03-148, Carnegie Mellon University School of Computer Science.
8. Pearl, J., and Kim, J. H. 1982. Studies in semi-admissible heuristics. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-4(4):391-399.
9. Pearl, J. 1984. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley.
10. Sedgewick, R. 1992. Algorithms in C. Boston, MA: Addison-Wesley Professional.