Minimizing node expansions in bidirectional search with consistent heuristics

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

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

18 Scopus citations

Abstract

A* is optimally effective with regard to node expansions among unidirectional admissible algorithms-those that only assume that the heuristic used is admissible. Among bidirectional algorithms the Fractional MM algorithm is optimally effective (given the correct parameters) among admissible algorithms. This paper generalizes the bidirectional result to more complex settings where more information on the problem domain can be exploited: (1) When the cost of the minimal edge ? is known. (2) When the algorithm knows that the heuristics are consistent. This characterization uses a novel algorithm called MT. MT is similar to Fractional MM and is also optimally effective, but simpler to analyze.

Original languageEnglish
Title of host publicationProceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018
EditorsVadim Bulitko, Sabine Storandt
PublisherAAAI press
Pages81-89
Number of pages9
ISBN (Electronic)9781577358022
StatePublished - 1 Jan 2018
Event11th International Symposium on Combinatorial Search, SoCS 2018 - Stockholm, Sweden
Duration: 14 Jul 201815 Jul 2018

Publication series

NameProceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018

Conference

Conference11th International Symposium on Combinatorial Search, SoCS 2018
Country/TerritorySweden
CityStockholm
Period14/07/1815/07/18

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Minimizing node expansions in bidirectional search with consistent heuristics'. Together they form a unique fingerprint.

Cite this