Optimally efficient bidirectional search

Eshed Shaham, Ariel Felner, Nathan R. Sturtevant, Jeffrey S. Rosenschein

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

Abstract

A is optimally efficient with regard to node expansions among unidirectional admissible algorithms-those that only assume that the heuristic used is admissible. This paper studies algorithms that are optimally efficient for bidirectional search algorithms. We present the Fractional MM algorithm and its sibling, the MT algorithm, which is simpler to analyze. We then develop variants of these algorithms that are optimally efficient, each under different assumptions on the information available to the algorithm.

Original languageEnglish
Title of host publicationProceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019
EditorsSarit Kraus
PublisherInternational Joint Conferences on Artificial Intelligence
Pages6221-6225
Number of pages5
ISBN (Electronic)9780999241141
DOIs
StatePublished - 1 Jan 2019
Event28th International Joint Conference on Artificial Intelligence, IJCAI 2019 - Macao, China
Duration: 10 Aug 201916 Aug 2019

Publication series

NameIJCAI International Joint Conference on Artificial Intelligence
Volume2019-August
ISSN (Print)1045-0823

Conference

Conference28th International Joint Conference on Artificial Intelligence, IJCAI 2019
Country/TerritoryChina
CityMacao
Period10/08/1916/08/19

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this