@inproceedings{17d19e816f6f4968833303fbd8c23539,

title = "Minimizing node expansions in bidirectional search with consistent heuristics",

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

author = "Eshed Shaham and Ariel Felner and Sturtevant, {Nathan R.} and Rosenschein, {Jeffrey S.}",

note = "Publisher Copyright: {\textcopyright} 2018, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 11th International Symposium on Combinatorial Search, SoCS 2018 ; Conference date: 14-07-2018 Through 15-07-2018",

year = "2018",

month = jan,

day = "1",

language = "English",

series = "Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018",

publisher = "AAAI press",

pages = "81--89",

editor = "Vadim Bulitko and Sabine Storandt",

booktitle = "Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018",

}