Optimally Efficient Bidirectional Search

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.1

[1]  Hermann Kaindl,et al.  Bidirectional Heuristic Search Reconsidered , 1997, J. Artif. Intell. Res..

[2]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[3]  Nathan R. Sturtevant,et al.  MM: A bidirectional search algorithm that is guaranteed to meet in the middle , 2017, Artif. Intell..

[4]  Nathan R. Sturtevant,et al.  The Minimal Set of States that Must Be Expanded in a Front-to-End Bidirectional Search , 2021, SOCS.

[5]  Nathan R. Sturtevant,et al.  Improving Bidirectional Heuristic Search by Bounds Propagation , 2021, SOCS.

[6]  Nathan R. Sturtevant,et al.  Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions , 2017, IJCAI.

[7]  Nathan R. Sturtevant,et al.  Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics , 2018, SOCS.

[8]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[9]  Nathan R. Sturtevant,et al.  Bidirectional Search That Is Guaranteed to Meet in the Middle , 2016, AAAI.

[10]  Mike Barley,et al.  GBFHS: A Generalized Breadth-First Heuristic Search Algorithm , 2018, SOCS.

[11]  Rina Dechter,et al.  Generalized best-first search strategies and the optimality of A* , 1985, JACM.

[12]  Nathan R. Sturtevant,et al.  Enriching Non-Parametric Bidirectional Search Algorithms - Extended Abstract , 2019, SOCS.

[13]  Nathan R. Sturtevant,et al.  Sufficient Conditions for Node Expansion in Bidirectional Heuristic Search , 2017, ICAPS.