Limitations of Front-To-End Bidirectional Heuristic Search

We present an intuitive explanation for the limited effectiveness of front-to-end bidirectional heuristic search, supported with extensive evidence from many commonly-studied domains. While previous work has proved the limitations of specific algorithms, we show that any front-to-end bidirectional heuristic search algorithm will likely be dominated by unidirectional heuristic search or bidirectional brute-force search. We also demonstrate a pathological case where bidirectional heuristic search is the dominant algorithm, so a stronger claim cannot be made. Finally, we show that on the four-peg Towers Of Hanoi with arbitrary start and goal states, bidirectional brute-force search outperforms unidirectional heuristic search using pattern-database heuristics.

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

[2]  Richard E. Korf,et al.  Disjoint pattern database heuristics , 2002, Artif. Intell..

[3]  Johanna Hendriksen,et al.  Tower of Hanoi , 2016 .

[4]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[5]  Giovanni Manzini,et al.  BIDA: An Improved Perimeter Search Algorithm , 1995, Artif. Intell..

[6]  Richard E. Korf,et al.  Compressed Pattern Databases , 2007, J. Artif. Intell. Res..

[7]  Richard E. Korf,et al.  Linear-time disk-based implicit graph search , 2008, JACM.

[8]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[9]  James B. H. Kwa,et al.  BS*: An Admissible Bidirectional Staged Heuristic Search Algorithm , 1989, Artif. Intell..

[10]  Zhifu Zhang,et al.  Inconsistent heuristics in theory and practice , 2011, Artif. Intell..

[11]  Stefan Edelkamp,et al.  Heuristic Search - Theory and Applications , 2011 .

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

[13]  Richard E. Korf,et al.  Solving Peg Solitaire with Bidirectional BFIDA , 2012, AAAI.

[14]  Marco Lippi,et al.  Efficient Single Frontier Bidirectional Search , 2012, SOCS.

[15]  Eric A. Hansen,et al.  Breadth-first heuristic search , 2004, Artif. Intell..

[16]  Peter C. Nelson,et al.  Perimeter Search , 1994, Artif. Intell..

[17]  James Tanton Mathematics Galore!: The Tower of Hanoi , 2012 .

[18]  Jonathan Schaeffer,et al.  Searching with Pattern Databases , 1996, Canadian Conference on AI.

[19]  Malte Helmert,et al.  Landmark Heuristics for the Pancake Problem , 2010, SOCS.

[20]  Richard E. Korf,et al.  1.6-Bit Pattern Databases , 2010, AAAI.

[21]  Nathan R. Sturtevant,et al.  Single-Frontier Bidirectional Search , 2010, SOCS.

[22]  Fan Yang,et al.  A General Theory of Additive State Space Abstractions , 2008, J. Artif. Intell. Res..