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 language | English |
---|---|
Title of host publication | Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019 |
Editors | Sarit Kraus |
Publisher | International Joint Conferences on Artificial Intelligence |
Pages | 6221-6225 |
Number of pages | 5 |
ISBN (Electronic) | 9780999241141 |
DOIs | |
State | Published - 2019 |
Externally published | Yes |
Event | 28th International Joint Conference on Artificial Intelligence, IJCAI 2019 - Macao, China Duration: 10 Aug 2019 → 16 Aug 2019 |
Publication series
Name | IJCAI International Joint Conference on Artificial Intelligence |
---|---|
Volume | 2019-August |
ISSN (Print) | 1045-0823 |
Conference
Conference | 28th International Joint Conference on Artificial Intelligence, IJCAI 2019 |
---|---|
Country/Territory | China |
City | Macao |
Period | 10/08/19 → 16/08/19 |
Bibliographical note
Publisher Copyright:© 2019 International Joint Conferences on Artificial Intelligence. All rights reserved.
Funding
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.
Funders | Funder number |
---|---|
HUJI Cyber Security Research Center | |
National Science Foundation | 1815660 |
National Sleep Foundation | |
United States-Israel Binational Science Foundation | 2017692 |
Israel Science Foundation | 844/17 |