Breadth-First Heuristic Search

All Papers

Recent work shows that the memory requirements of best- first heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show that memory requirements can be reduced even further by using a breadth-first instead of a best-first search strategy. We describe optimal and approximate breadth-first heuristic search algorithms that use divide-and-conquer solution reconstruction. Computational results show that they outperform other optimal and approximate heuristic search algorithms in solving domain-independent planning problems.