Bidirectional search that is guaranteed to meet in the middle

Robert C. Holte; Ariel Felner; Guni Sharon; Nathan R. Sturtevant

Bidirectional search that is guaranteed to meet in the middle

Robert C. Holte
, Ariel Felner
, Guni Sharon
, Nathan R. Sturtevant

University of Alberta
Ben-Gurion University of the Negev
University of Denver

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

52 Scopus citations

Abstract

We present MM, the first bidirectional heuristic search algorithm whose forward and backward searches are guaranteed to "meet in the middle", i.e. never expand a node beyond the solution midpoint. We also present a novel framework for comparing MM, A∗, and brute-force search, and identify conditions favoring each algorithm. Finally, we present experimental results that support our theoretical analysis.

Original language	English
Title of host publication	30th AAAI Conference on Artificial Intelligence, AAAI 2016
Publisher	AAAI press
Pages	3411-3417
Number of pages	7
ISBN (Electronic)	9781577357605
State	Published - 2016
Externally published	Yes
Event	30th AAAI Conference on Artificial Intelligence, AAAI 2016 - Phoenix, United States Duration: 12 Feb 2016 → 17 Feb 2016

Publication series

Name	30th AAAI Conference on Artificial Intelligence, AAAI 2016

Conference

Conference	30th AAAI Conference on Artificial Intelligence, AAAI 2016
Country/Territory	United States
City	Phoenix
Period	12/02/16 → 17/02/16

Bibliographical note

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

Funding

Thanks to Joseph Barker for answering questions and providing extra data related to (Barker and Korf 2015) and to Sandra Zilles and Andre Grahl Pereira for suggesting improvements in the theoretical analysis of MM. Financial support for this research was in part provided by Canada's Natural Science and Engineering Research Council (NSERC) and by Israel Science Foundation (ISF) grant #417/13. Computational facilities for some of our experiments were provided by Compute Canada. This material is based upon work supported by the National Science Foundation under Grant No. 1551406.

Funders	Funder number
National Science Foundation	1551406
Compute Canada
Natural Sciences and Engineering Research Council of Canada
Israel Science Foundation	417/13

Cite this

@inproceedings{5b6ce661cfcd475aa20a788324dc824f,

title = "Bidirectional search that is guaranteed to meet in the middle",

abstract = "We present MM, the first bidirectional heuristic search algorithm whose forward and backward searches are guaranteed to {"}meet in the middle{"}, i.e. never expand a node beyond the solution midpoint. We also present a novel framework for comparing MM, A∗, and brute-force search, and identify conditions favoring each algorithm. Finally, we present experimental results that support our theoretical analysis.",

author = "Holte, \{Robert C.\} and Ariel Felner and Guni Sharon and Sturtevant, \{Nathan R.\}",

note = "Publisher Copyright: {\textcopyright} Copyright 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 30th AAAI Conference on Artificial Intelligence, AAAI 2016 ; Conference date: 12-02-2016 Through 17-02-2016",

year = "2016",

language = "אנגלית",

series = "30th AAAI Conference on Artificial Intelligence, AAAI 2016",

publisher = "AAAI press",

pages = "3411--3417",

booktitle = "30th AAAI Conference on Artificial Intelligence, AAAI 2016",

}

Bidirectional search that is guaranteed to meet in the middle. / Holte, Robert C.; Felner, Ariel; Sharon, Guni et al.
30th AAAI Conference on Artificial Intelligence, AAAI 2016. AAAI press, 2016. p. 3411-3417 (30th AAAI Conference on Artificial Intelligence, AAAI 2016).

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

TY - GEN

T1 - Bidirectional search that is guaranteed to meet in the middle

AU - Holte, Robert C.

AU - Felner, Ariel

AU - Sharon, Guni

AU - Sturtevant, Nathan R.

PY - 2016

Y1 - 2016

N2 - We present MM, the first bidirectional heuristic search algorithm whose forward and backward searches are guaranteed to "meet in the middle", i.e. never expand a node beyond the solution midpoint. We also present a novel framework for comparing MM, A∗, and brute-force search, and identify conditions favoring each algorithm. Finally, we present experimental results that support our theoretical analysis.

AB - We present MM, the first bidirectional heuristic search algorithm whose forward and backward searches are guaranteed to "meet in the middle", i.e. never expand a node beyond the solution midpoint. We also present a novel framework for comparing MM, A∗, and brute-force search, and identify conditions favoring each algorithm. Finally, we present experimental results that support our theoretical analysis.

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

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

AN - SCOPUS:84992057114

T3 - 30th AAAI Conference on Artificial Intelligence, AAAI 2016

SP - 3411

EP - 3417

BT - 30th AAAI Conference on Artificial Intelligence, AAAI 2016

PB - AAAI press

T2 - 30th AAAI Conference on Artificial Intelligence, AAAI 2016

Y2 - 12 February 2016 through 17 February 2016

ER -

Bidirectional search that is guaranteed to meet in the middle

Abstract

Publication series

Conference

Bibliographical note

Funding

Other files and links

Fingerprint

Cite this