Searching without a heuristic: Efficient use of abstraction

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2010, Pages 114-120

  Larsen, Bradford ^a   Burns, Ethan ^a   Ruml, Wheeler ^a   Holte, Robert C ^b  

^a Univ of New Hampshire   (United States)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ARTIFICIAL INTELLIGENCE; BENCHMARKING; HEURISTIC METHODS; LEARNING ALGORITHMS; MODULAR ROBOTS;

ABSTRACT SPACE; ALTERNATING DIRECTIONS; BASE LEVEL SEARCH; HEURISTIC EVALUATION FUNCTIONS; HEURISTIC SEARCH ALGORITHMS; HIERARCHICAL ALGORITHM; OPTIMAL PATH LENGTHS; PATTERN DATABASE;

HEURISTIC ALGORITHMS;

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

References (13)

1. Culberson, J. C, and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
2. Felner, A., and Adler, A. 2005. Solving the 24-puzzle with instance dependent pattern databases. In Zucker, J.-D., and Saitta, L., eds., Abstraction, Reformulation and Approximation, volume 3607 of Lecture Notes in Computer Science, 248-260. Springer.
3. Felner, A.; Korf, R. E.; and Hanan, S. 2004. Additive pattern database heuristics. Journal of Artificial Intelligence Research 22(1):279-318.
4. Hart, P. E.; Nilsson, N. J.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SSC-4 2:100-107.
5. Holte, R. C; Perez, M. B.; Zimmer, R. M.; and MacDonald, A.J. 1996. Hierarchical A*: Searching abstraction hierarchies efficiently. In Proceedings of the National Conference on Artificial Intelligence, 530-535.
6. Holte, R. C; Grajkowski, J.; and Tanner, B. 2005. Hierarchical heuristic search revisited. In Zucker, J.-D., and Saitta, L., eds., Abstraction, Reformulation and Approximation, volume 3607 of Lecture Notes in Computer Science, 121-133. Springer.
7. Kaindl, H., and Kainz, G. 1997. Bidirectional heuristic search reconsidered. Journal of Artificial Intelligence Research 7:283.
8. Korf, R. E. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27:97-109.
9. Nilsson, N. J. 1980. Principles of Artificial Intelligence. Tioga Publishing Co.
10. Prieditis, A. 1993. Machine discovery of effective admissible heuristics. Machine Learning 12:117-141.
11. Silver, D. 2005. Cooperative pathfinding. In Young, M., and Laird, J., eds., Proceedings of the First Artificial Intelligence and Interactive Digital Entertainment Conference (AIIDE 2005), 117-122. AAAI Press.
12. Yang, F.; Culberson, J. C; Holte, R.; Zahavi, U.; and Felner, A. 2008. A general theory of additive state space abstractions. Journal of Artificial Intelligence Research 32:631-662.
13. Zhou, R., and Hansen, E. A. 2004. Space-efficient memory-based heuristics. In Proceedings of the Nineteenth National Conference on Anifical Intelligence (AAAI-04), 677-682. AAAI Press/The MIT Press.