Single-Frontier Bidirectional Search

Ariel Felner; Carsten Moldenhauer; Nathan Sturtevant; Jonathan Schaeffer

Single-Frontier Bidirectional Search

Ariel Felner
, Carsten Moldenhauer
, Nathan Sturtevant
, Jonathan Schaeffer

Ben-Gurion University of the Negev
Humboldt University of Berlin
University of Alberta

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

23 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 language	English
Title of host publication	Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010
Publisher	AAAI press
Pages	59-64
Number of pages	6
ISBN (Electronic)	9781577354642
State	Published - 15 Jul 2010
Externally published	Yes
Event	24th AAAI Conference on Artificial Intelligence, AAAI 2010 - Atlanta, United States Duration: 11 Jul 2010 → 15 Jul 2010

Publication series

Name	Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010

Conference

Conference	24th AAAI Conference on Artificial Intelligence, AAAI 2010
Country/Territory	United States
City	Atlanta
Period	11/07/10 → 15/07/10

Bibliographical note

Publisher Copyright:
© 2010, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Funding

This research was supported by the Israeli Science Foundation (ISF) grants No. 728/06 and 305/09, and by iCORE.

Funders	Funder number
Israel Science Foundation	305/09, 728/06

Cite this

@inproceedings{2d2388b217694438a8fb24b8fb4d3b3b,

title = "Single-Frontier Bidirectional Search",

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.",

author = "Ariel Felner and Carsten Moldenhauer and Nathan Sturtevant and Jonathan Schaeffer",

note = "Publisher Copyright: {\textcopyright} 2010, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 24th AAAI Conference on Artificial Intelligence, AAAI 2010 ; Conference date: 11-07-2010 Through 15-07-2010",

year = "2010",

month = jul,

day = "15",

language = "אנגלית",

series = "Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010",

publisher = "AAAI press",

pages = "59--64",

booktitle = "Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010",

}

Felner, A, Moldenhauer, C, Sturtevant, N & Schaeffer, J 2010, Single-Frontier Bidirectional Search. in Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010. Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010, AAAI press, pp. 59-64, 24th AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, United States, 11/07/10.

Single-Frontier Bidirectional Search. / Felner, Ariel; Moldenhauer, Carsten; Sturtevant, Nathan et al.
Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010. AAAI press, 2010. p. 59-64 (Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Single-Frontier Bidirectional Search

AU - Felner, Ariel

AU - Moldenhauer, Carsten

AU - Sturtevant, Nathan

AU - Schaeffer, Jonathan

PY - 2010/7/15

Y1 - 2010/7/15

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85150748468

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85150748468

T3 - Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010

SP - 59

EP - 64

BT - Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010

PB - AAAI press

T2 - 24th AAAI Conference on Artificial Intelligence, AAAI 2010

Y2 - 11 July 2010 through 15 July 2010

ER -

Single-Frontier Bidirectional Search

Abstract

Publication series

Conference

Bibliographical note

Funding

Other files and links

Fingerprint

Cite this