KBFS: K-Best-First Search

Annals of Mathematics and Artificial Intelligence

Volumn 39, Issue 1-2, 2003, Pages 19-39

  Felner, Ariel ^a   Kraus, Sarit ^a   Korf, Richard E ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037745099     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1024452529781     Document Type: Article

References (27)

1. P.P. Chakrabarti, S. Ghose, A. Acharya and S.C. de Sarkar, Heuristic search in restricted memory, Artificial Intelligence 41(2) (1989) 197-221.
2. H.W. Davis, A. Bramanti-Gregor and J. Wang, The advantages of using depth and breadth components in heuristic search, Methodologies for Intelligent Systems 3 (1989) 19-28.
3. R. Dechter and J. Pearl, Generalized best-first search strategies and the optimality of A*, Journal of the Association for Computing Machinery 32(3) (1985) 505-536.
4. E.W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik 1 (1959) 269-271.
5. M. Evett, J. Hendler, A. Mahanti and D.S. Nau, PRA*: Massively parallel heuristic search, Journal of Parallel and Distributed Computing 25(2) (1995) 92-103.
6. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
7. J. Gasching, Performance measurement and analysis of certain search algorithms, Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA (1979).
8. 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(2) (1968) 100-107.
9. W.D. Harvey and M.L. Ginsberg, Limited discrepancy search, in: Proc. of IJCAI-95, Montreal, Canada (1995) pp. 607-613.
10. A. Junghanns and J. Schaeffer, Domain-dependent single-agent search enhancements, in: Proc. of IJCAI-99, Stockholm, Sweden (1999) pp. 570-575.
11. N. Karmarkar and R.M. Karp, The differencing method of set partitioning, Technical Report, UCB/CSD 82/113 (1982).
12. R. Karp and J. Pearl, Searching for an optimal path in a tree with random costs, Artificial Intelligence 21(1-2) (1983) 99-116.
13. R.E. Korf, Depth-first iterative-deepening: An optimal admissible tree search, Artificial Intelligence 27(1) (1985) 97-109.
14. R.E. Korf, Linear-space best-first search, Artificial Intelligence 62(1) (1993) 41-78.
15. R.E. Korf, Improved limited discrepancy search, in: Proc. of AAAI-96, Portland, OR (1996) pp. 286-291.
16. R.E. Korf, A complete anytime algorithm for number partitioning, Artificial Intelligence 106(2) (1998) 181-203.
17. R.E. Korf and D.M. Chickering, Best-first minimax search, Artificial Intelligence 84(1-2) (1996) 299-337.
18. R.E. Korf and A. Felner, Disjoint pattern database heuristics, Artificial Intelligence 134 (2002) 9-22.
19. P. Meseguer, Interleaved depth-first search, in: Proc. of IJCAI-97 (1997) pp. 1382-1387.
20. D.S. Nau, Pathology on game trees revisited, and an alternative to minimaxing, Artificial Intelligence 21(1-2) (1983) 221-244.
21. I. Pohl, Heuristic search viewed as path finding in a graph, Artificial Intelligence 1 (1971) 193-204.
22. C. Powley and R.E. Korf, Single-agent parallel window search, IEEE Transactions on Pattern Analysis and Machine Intelligence 13(5) (1991) 466-477.
23. V.N. Rao and V. Kumar, On the efficiency of parallel backtracking, IEEE Transactions on Parallel and Distributed Systems 4 (1993) 427-437.
24. S.J. Russell, Efficient memory-bounded search methods, in: Proc. of ECAI-92 (1992).
25. A. Sen and A. Bagchi, Fast recursive formulations for best-first search that allow controlled use of memory, in: Proc. of IJCAI-89, Detroit, MI (1989) pp. 297-302.
26. P. Shell, J.A.H. Rubio and G.Q. Barro, Improving search through diversity, in: Proc. of AAAI-94, Seattle, WA (1994) pp. 1323-1328.
27. T. Walsh, Depth-bounded discrepancy search, in: Proc. of IJCAI-97 (1997) pp. 1388-1393.