Abstract
A* is optimal among admissible unidirectional algorithms when searching with a consistent heuristic. Recently, similar optimality bounds have been established for bidirectional search but, no practical algorithm is guaranteed to always achieve this bound. In this paper we study the nature of the number of nodes that must be expanded in any front-to-end bidirectional search. We present an efficient algorithm for computing that number and show that a theoretical parameterized generalization of MM, with the correct parameter, is the optimal front-to-end bidirectional search. We then experimentally compare various algorithms and show how far they are from optimal.
| Original language | English |
|---|---|
| Pages | 82-90 |
| Number of pages | 9 |
| State | Published - 2017 |
| Externally published | Yes |
| Event | 10th Annual Symposium on Combinatorial Search, SoCS 2017 - Pittsburgh, United States Duration: 16 Jun 2017 → 17 Jun 2017 |
Conference
| Conference | 10th Annual Symposium on Combinatorial Search, SoCS 2017 |
|---|---|
| Country/Territory | United States |
| City | Pittsburgh |
| Period | 16/06/17 → 17/06/17 |
Bibliographical note
Publisher Copyright:Copyright c 2017, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.