Hierarchical heuristic search revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3607 LNAI, Issue , 2005, Pages 121-133

  Holte, Robert C ^a   Grajkowski, Jeffery ^a   Tanner, Brian ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; HIERARCHICAL SYSTEMS; PROBLEM SOLVING; SEARCH ENGINES;

HIERARCHICAL HEURISTIC SEARCH; PATTERN DATABASE; SEARCH PROBLEMS;

HEURISTIC PROGRAMMING;

EID: 26944463406     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11527862_9     Document Type: Conference Paper

References (17)

1. Andreas Auer and Hermann Kaindl. A case study of revisiting best-first vs. depth-first search. Proceedings of the Sixteenth European Conference on Artificial Intelligence (ECAI-04), pages 141-145, 2004.
2. Ting Chen and Steve Skiena. Sorting with fixed-length reversals. Discrete Applied Mathematics, 71(1-3):269-295, 1996. Special volume on computational molecular biology.
3. J. C. Culberson and J. Schaeffer. Efficiently searching the 15-puzzle. Technical report, Department of Computer Science, University of Alberta, 1994.
4. J. C. Culberson and J. Schaeffer. Pattern databases. Computational Intelligence, 14(3):318-334, 1998.
5. Harry Dweighter. Problem e2569. American Mathematical Monthly, 82:1010, 1975.
6. S. Edelkamp. Planning with pattern databases. Proceedings of the 6th European Conference on Planning (ECP-01), pages 13-24, 2001.
7. A. Feiner, R. E. Korf, and S. Hanan. Additive pattern database heuristics. Journal of Artificial Intelligence, 21:1-39, 2004.
8. Ariel Feiner, Uzi Zahavi, Jonathan Schaeffer, and Robert Holte. Dual lookups in pattern databases. Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), 2005.
9. P.E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4:100-107, 1968.
10. I. T. Hernádvölgyi. Searching for macro operators with automatically generated heuristics. Advances in Artificial Intelligence - Proceedings of the Fourteenth Biennial Conference of the Canadian Society for Computational Studies of Intelligence (LNAI 2056), pages 194-203, 2001.
11. I. T. Hernádvölgyi. Solving the sequential ordering problem with automatically generated lower bounds. Proceedings of Operations Research 2003 (Heidelberg, Germany), pages 355-362, 2003.
12. R. C. Holte, M. B. Perez, R. M. Zimmer, and A. J. MacDonald. Hierarchical A*: Searching abstraction hierarchies efficiently. Proc. Thirteenth National Conference on Artificial Intelligence (AAAI-96), pages 530-535, 1996.
13. Robert C. Holte, Jack Newton, Ariel Feiner, and Ram Meshulam. Mutiple pattern databases. Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS-04), pages 122-131, 2004.
14. R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27:97-109, 1985.
15. R. E. Korf. Finding optimal solutions to Rubik's Cube using pattern data-bases. Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), pages 700-705, 1997.
16. David Silver. Cooperative pathfinding. Proceedings of the First Annual Conference on Artificial Intelligence and Interactive Entertainment (AIIDE-05), pp. 117-122, 2005.
17. R. Zhou and E. A. Hansen. Space-efficient memory-based heuristics. Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI-04), pages 677-682, 2004.