Breadth-first heuristic search

Artificial Intelligence

Volumn 170, Issue 4-5, 2006, Pages 385-408

  Zhou, Rong ^a   Hansen, Eric A ^a  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

Branch and bound search; Heuristic search; Memory limited graph search; Planning

Indexed keywords

COMPUTER SIMULATION; GENETIC ALGORITHMS; GRAPH THEORY; ITERATIVE METHODS; PROBLEM SOLVING;

BRANCH-AND-BOUND SEARCH; HEURISTIC SEARCH; MEMORY-LIMITED GRAPH SEARCH;

HEURISTIC PROGRAMMING;

EID: 32944479332     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2005.12.002     Document Type: Article

References (31)

1. B. Bonet, and H. Geffner Heuristic search planner 2.0 AI Magazine 22 3 2001 77 80
2. B. Bonet, and H. Geffner Planning as heuristic search Artificial Intelligence 129 1 2001 5 33
3. R. Dechter, and J. Pearl Generalized best-first search strategies and the optimality of A* J. ACM 32 3 1985 505 536
4. E. Dijkstra A note on two problems in connexion with graphs Numer. Math. 1 1959 269 271
5. S. Edelkamp, S. Jabbar, S. Schrodl, External A*, in: Proceedings of the 27th German Conference on Artificial Intelligence, Ulm, Germany, 2004, pp. 226-240
6. A. Felner, R. Meshulam, R. Holte, R. Korf, Compressing pattern databases, in: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-04), San Jose, CA, 2004, pp. 638-643
7. J. Frame Solution to advanced problem 3918 Amer. Math. Monthly 48 1941 216 217
8. O. Hansson, A. Mayer, and M. Yung Criticizing solutions to relaxed models yields powerful admissible heuristics Information Sci. 63 3 1992 207 227
9. P. Hart, N. Nilsson, and B. Raphael A formal basis for the heuristic determination of minimum cost paths IEEE Trans. Syst. Sci. Cybernet. (SSC) 4 2 1968 100 107
10. P. Haslum, H. Geffner, Admissible heuristics for optimal planning, in: Proceedings of the 5th International Conference on AI Planning and Scheduling, Breckenridge, CO, 2000, pp. 140-149
11. A.M. Hinz, The Tower of Hanoi, in: Algebras and Combinatorics: Proceedings of ICAC'97, Hong Kong, 1997, pp. 277-289
12. D. Hirschberg A linear space algorithm for computing maximal common subsequences Comm. ACM 18 6 1975 341 343
13. R. Korf Depth-first iterative deepening: An optimal admissible tree search Artificial Intelligence 27 1 1985 97 109
14. R. Korf Linear-space best-first search Artificial Intelligence 62 1 1993 41 78
15. R. Korf, Divide-and-conquer bidirectional search: First results, in: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), Stockholm, Sweden, 1999, pp. 1184-1189
16. R. Korf, Best-first frontier search with delayed duplicate detection, in: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-04), San Jose, CA, 2004, pp. 650-657
17. R. Korf, and A. Felner Disjoint pattern database heuristics Artificial Intelligence 134 1-2 2002 9 22
18. R. Korf, W. Zhang, Divide-and-conquer frontier search applied to optimal sequence alignment, in: Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-00), Austin, TX, 2000, pp. 910-916
19. R. Korf, W. Zhang, I. Thayer, and H. Hohwald Frontier search J. ACM 52 5 2005 715 748
20. D. Long, and M. Fox The 3rd international planning competition: Results and analysis J. Artificial Intelligence Res. 20 2003 1 59
21. T. Miura, T. Ishida, Stochastic node caching for memory-bounded search, in: Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98), Madison, WI, 1998, pp. 450-456
22. E. Myers, and W. Miller Optimal alignments in linear space Comput. Appl. Biosci. 4 1 1988 11 17
23. I. Pohl First results on the effect of error in heuristic search Machine Intelligence 5 1970 219 236
24. A. Reinefeld, and T. Marsland Enhanced iterative-deepening search IEEE Trans. Pattern Anal. Machine Intelligence 16 7 1994 701 710
25. B. Stewart Solution to advanced problem 3918 Amer. Math. Monthly 48 1941 217 219
26. R. Zhou, E. Hansen, Sparse-memory graph search, in: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), Acapulco, Mexico, 2003, pp. 1259-1266
27. R. Zhou, E. Hansen, Sweep A*: Space-efficient heuristic search in partially ordered graphs, in: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI-03), Sacramento, CA, 2003, pp. 427-434
28. R. Zhou, E. Hansen, Breadth-first heuristic search, in: Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS-04), Whistler, British Columbia, 2004, pp. 92-100
29. R. Zhou, E. Hansen, Structured duplicate detection in external-memory graph search, in: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-04), San Jose, CA, 2004, pp. 683-688
30. R. Zhou, E. Hansen, Beam-stack search: Integrating backtracking with beam search, in: Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS-05), Monterey, CA, 2005, pp. 90-98
31. R. Zhou, E. Hansen, External-memory pattern databases using structured duplicate detection, in: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-05), Pittsburgh, PA, 2005, pp. 1398-1404