Single-frontier bidirectional search

Carsten Moldenhauer, Ariel Felner, Nathan Sturtevant, Jonathan Schaeffer

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

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

Original languageEnglish
Title of host publicationProceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010
Pages151-152
Number of pages2
StatePublished - 1 Dec 2010
Event3rd International Symposium on Combinatorial Search, SoCS 2010 - Atlanta, GA, United States
Duration: 8 Jul 201010 Jul 2010

Publication series

NameProceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010

Conference

Conference3rd International Symposium on Combinatorial Search, SoCS 2010
Country/TerritoryUnited States
CityAtlanta, GA
Period8/07/1010/07/10

Cite this