Single-Frontier Bidirectional Search

Ariel Felner, Carsten Moldenhauer, Nathan Sturtevant, Jonathan Schaeffer

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

22 Scopus citations

Abstract

On the surface, bidirectional search (BDS) is an attractive idea with the potential for significant asymptotic reductions in search effort. However, the results in practice often fall far short of expectations. We introduce a new bidirectional search algorithm, Single-Frontier Bidirectional Search (SFBDS). Unlike traditional BDS which keeps two frontiers, SFBDS uses a single frontier. Each node in the tree can be seen as an independent task of finding the shortest path between the current start and current goal. 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. Theoretical results give insights as to when this approach will work and experimental data validates the algorithm for a broad range of domains.

Original languageEnglish
Title of host publicationProceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010
PublisherAAAI press
Pages59-64
Number of pages6
ISBN (Electronic)9781577354642
StatePublished - 15 Jul 2010
Event24th AAAI Conference on Artificial Intelligence, AAAI 2010 - Atlanta, United States
Duration: 11 Jul 201015 Jul 2010

Publication series

NameProceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010

Conference

Conference24th AAAI Conference on Artificial Intelligence, AAAI 2010
Country/TerritoryUnited States
CityAtlanta
Period11/07/1015/07/10

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Single-Frontier Bidirectional Search'. Together they form a unique fingerprint.

Cite this