TY - GEN
T1 - Optimally efficient bidirectional search
AU - Shaham, Eshed
AU - Felner, Ariel
AU - Sturtevant, Nathan R.
AU - Rosenschein, Jeffrey S.
N1 - Publisher Copyright:
© 2019 International Joint Conferences on Artificial Intelligence. All rights reserved.
PY - 2019/1/1
Y1 - 2019/1/1
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/85074946331
U2 - 10.24963/ijcai.2019/867
DO - 10.24963/ijcai.2019/867
M3 - Conference contribution
AN - SCOPUS:85074946331
T3 - IJCAI International Joint Conference on Artificial Intelligence
SP - 6221
EP - 6225
BT - Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019
A2 - Kraus, Sarit
PB - International Joint Conferences on Artificial Intelligence
T2 - 28th International Joint Conference on Artificial Intelligence, IJCAI 2019
Y2 - 10 August 2019 through 16 August 2019
ER -