AAAI Publications, Tenth Annual Symposium on Combinatorial Search

Font Size: 
The Minimal Set of States that Must Be Expanded in a Front-to-End Bidirectional Search
Eshed Shaham, Ariel Felner, Jingwei Chen, Nathan R. Sturtevant

Last modified: 2017-07-03


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.

Full Text: PDF