TY - GEN
T1 - Single-frontier bidirectional search
AU - Moldenhauer, Carsten
AU - Felner, Ariel
AU - Sturtevant, Nathan
AU - Schaeffer, Jonathan
PY - 2010/12/1
Y1 - 2010/12/1
N2 - 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 SFBDSwill work validated by experimental results.1
AB - 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 SFBDSwill work validated by experimental results.1
UR - http://www.scopus.com/inward/record.url?scp=84893363088&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84893363088
SN - 9781577354819
T3 - Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010
SP - 151
EP - 152
BT - Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010
T2 - 3rd International Symposium on Combinatorial Search, SoCS 2010
Y2 - 8 July 2010 through 10 July 2010
ER -