A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Single-Frontier Bidirectional Search
2010
Proceedings of the International Symposium on Combinatorial Search
Preserved Fulltext
We introduce a new bidirectional search algorithm, Single-Frontier Bidirectional Search (SFBDS). Unlike traditional BDS which keeps two frontiers, SFBDS uses a single frontier. At a particular node we can decide to search from start to goal or from goal to start, choosing the direction with the highest potential for minimizing the total work done. We provide theoretical analysis that explains when SFBDS will work validated by experimental results.
doi:10.1609/socs.v1i1.18153
fatcat:hemcif44xvg3vgewuss5r5uumq