Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Korf (1993)
Linear-Space Best-First SearchArtif. Intell., 62
W. Harvey, M. Ginsberg (1995)
Limited Discrepancy Search
A linear or memory-bounded space version of KBFS may be introduced in order for KBFS to be widely used
Stuart Russell (1992)
Efficient Memory-Bounded Search Methods
R. Korf, Ariel Felner (2002)
Disjoint pattern database heuristicsArtif. Intell., 134
Peter Shell, Juan Rubio, Gonzalo Barro (1994)
Improving Search through Diversity
Determine under what circumstances KBFS outperforms BFS and what is the optimal value of K
Path Nodes Path Nodes Path Nodes Path Nodes Path Nodes Path Nodes
Narenda Karmarker, R. Karp (1983)
The Differencing Method of Set Partitioning
R. Korf (1998)
A Complete Anytime Algorithm for Number PartitioningArtif. Intell., 106
Stuart Russell (1992)
Eecient Memory-bounded Search Methods
Dana Nau (1983)
Pathology on Game Trees Revisited, and an Alternative to MinimaxingArtif. Intell., 21
P. Meseguer (1997)
Interleaved Depth-First Search
E. KorfRichard (1985)
Depth-first iterative-deepening: an optimal admissible tree searchArtificial Intelligence
A parallel version of KBFS might be examined. In this form of KBFS, K processors expand the K best nodes simultaneously
V. Rao, Vipin Kumar (1993)
On the Efficiency of Parallel BacktrackingIEEE Trans. Parallel Distributed Syst., 4
R. Korf (1996)
Improved Limited Discrepancy Search
J. Gaschnig (1979)
Performance measurement and analysis of certain search algorithms.
Andreas Junghanns, J. Schaeffer (1999)
Domain-Dependent Single-Agent Search Enhancements
R. Korf, D. Chickering (1996)
Best-First Minimax SearchArtif. Intell., 84
R. Karp, J. Pearl (1983)
Searching for an Optimal Path in a Tree with Random CostsArtif. Intell., 21
M. Evett, J. Hendler, A. Mahanti, Dana Nau (1995)
PRA*: Massively Parallel Heuristic SearchJ. Parallel Distributed Comput., 25
R. Dechter, J. Pearl (1985)
Generalized best-first search strategies and the optimality of A*J. ACM, 32
C. Powley, R. Korf (1991)
Single-Agent Parallel Window SearchIEEE Trans. Pattern Anal. Mach. Intell., 13
M.R. Garey, D.S. Johnson (1979)
Computers and Intractability: A Guide to the Theory of NPCompleteness
Vipin Kumarxz (1992)
On the Eeciency of Parallel Backtracking
I. Pohl (1970)
Heuristic Search Viewed as Path Finding in a GraphArtif. Intell., 1
P. Chakrabarti, S. Ghose, A. Acharya, S. Sarkar (1989)
Heuristic Search in Restricted MemoryArtif. Intell., 41
P. Hart, N. Nilsson, B. Raphael (1968)
A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Trans. Syst. Sci. Cybern., 4
H. Davis, Anna Bramanti-Gregor, Jin Wang (1988)
The Advantages of Using Depth and Breadth Components in Heuristic Search
E. Dijkstra (1959)
A note on two problems in connexion with graphsNumerische Mathematik, 1
T. Walsh (1997)
Depth-bounded Discrepancy Search
David Johnson (1982)
The NP-Completeness Column: An Ongoing GuideJ. Algorithms, 4
A. Sen, A. Bagchi (1989)
Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory
M. Garey (1979)
Johnson: computers and intractability: a guide to the theory of np- completeness (freeman
R. Dechter, J. Pearl (1985)
Generalized best-first search strategies and the optimality of A*Journal of the Association for Computing Machinery, 32
We introduce a new algorithm, K-best-first search (KBFS), which is a generalization of the well known best-first search (BFS). In KBFS, each iteration simultaneously expands the K best nodes from the open-list (rather than just the best as in BFS). We claim that KBFS outperforms BFS in domains where the heuristic function has large errors in estimation of the real distance to the goal state or does not predict dead-ends in the search tree. We present empirical results that confirm this claim and show that KBFS outperforms BFS by a factor of 15 on random trees with dead-ends, and by a factor of 2 and 7 on the Fifteen and Twenty-Four tile puzzles, respectively. KBFS also finds better solutions than BFS and hill-climbing for the number partitioning problem. KBFS is only appropriate for finding approximate solutions with inadmissible heuristic functions.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Oct 10, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.