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 language||American English|
|Title of host publication||Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019|
|Publisher||International Joint Conferences on Artificial Intelligence|
|Number of pages||5|
|State||Published - 2019|
|Event||28th International Joint Conference on Artificial Intelligence, IJCAI 2019 - Macao, China|
Duration: 10 Aug 2019 → 16 Aug 2019
|Name||IJCAI International Joint Conference on Artificial Intelligence|
|Conference||28th International Joint Conference on Artificial Intelligence, IJCAI 2019|
|Period||10/08/19 → 16/08/19|
Bibliographical noteFunding Information:
The work was supported by Israel Science Foundation (ISF) grant #844/17, by BSF grant #2017692, by NSF grant #1815660 and by the HUJI Cyber Security Research Center.
© 2019 International Joint Conferences on Artificial Intelligence. All rights reserved.