Bidirectional search that is guaranteed to meet in the middle

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

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

43 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 languageEnglish
Title of host publication30th AAAI Conference on Artificial Intelligence, AAAI 2016
PublisherAAAI press
Pages3411-3417
Number of pages7
ISBN (Electronic)9781577357605
StatePublished - 2016
Externally publishedYes
Event30th AAAI Conference on Artificial Intelligence, AAAI 2016 - Phoenix, United States
Duration: 12 Feb 201617 Feb 2016

Publication series

Name30th AAAI Conference on Artificial Intelligence, AAAI 2016

Conference

Conference30th AAAI Conference on Artificial Intelligence, AAAI 2016
Country/TerritoryUnited States
CityPhoenix
Period12/02/1617/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.

FundersFunder number
National Science Foundation1551406
Compute Canada
Natural Sciences and Engineering Research Council of Canada
Israel Science Foundation417/13

    Fingerprint

    Dive into the research topics of 'Bidirectional search that is guaranteed to meet in the middle'. Together they form a unique fingerprint.

    Cite this