Article

Limitations of front-to-end bidirectional heuristic search

Authors:

Joseph K Barker,

Richard E KorfAuthors Info & Claims

AAAI'15: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence

Pages 1086 - 1092

Published: 25 January 2015 Publication History

Abstract

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.

References

[1]

Barker, J. K., and Korf, R. E. 2012. Solving peg solitaire with bidirectional BFIDA*. In Association for the Advancement of Artificial Intelligence.

[2]

Breyer, T. M., and Korf, R. E. 2010. 1.6-bit pattern databases. In Association for the Advancement of Artificial Intelligence.

[3]

Culberson, J. C., and Schaeffer, J. 1996. Searching with pattern databases. In Advances in Artifical Intelligence. Springer. 402-416.

[4]

Dillenburg, J. F., and Nelson, P. C. 1994. Perimeter search. Artificial Intelligence 65(1):165-178.

[5]

Edelkamp, S., and Schrödl, S. 2011. Heuristic Search: Theory and Applications. Morgan Kaufmann.

[6]

Felner, A.; Korf, R. E.; Meshulam, R.; and Holte, R. C. 2007. Compressed pattern databases. Journal of Artificial Intelligence Reseach 30:213-247.

[7]

Felner, A.; Moldenhauer, C.; Sturtevant, N. R.; and Schaeffer, J. 2010. Single-frontier bidirectional search. In Association for the Advancement of Artificial Intelligence.

[8]

Felner, A.; Zahavi, U.; Holte, R.; Schaeffer, J.; Sturtevant, N.; and Zhang, Z. 2011. Inconsistent heuristics in theory and practice. Artificial Intelligence 175(9):1570-1603.

[9]

Hart, P.; Nilsson, N.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. Systems Science and Cybernetics, IEEE Transactions on 4(2):100-107.

[10]

Helmert, M. 2010. Landmark heuristics for the pancake problem. In Third Annual Symposium on Combinatorial Search.

[11]

Hinz, A. M. 1997. The tower of hanoi. Algebras and Combinatorics: Proceedings of ICAC97 227-289.

[12]

Kaindl, H., and Kainz, G. 1997. Bidirectional heuristic search reconsidered. Journal of Artificial Intelligence Research 7:283-317.

[13]

Korf, R. E., and Felner, A. 2002. Disjoint pattern database heuristics. Artificial Intelligence 134(1):9-22.

[14]

Korf, R. E. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artificial intelligence 27(1):97-109.

[15]

Korf, R. E. 2008. Linear-time disk-based implicit graph search. Journal of the ACM 55(6):26.

[16]

Kwa, J. B. 1989. BS*: An admissible bidirectional staged heuristic search algorithm. Artificial Intelligence 38(1):95-109.

[17]

Lippi, M.; Ernandes, M.; and Felner, A. 2012. Efficient single frontier bidirectional search. In Proceedings of the Fifth Symposium on Combinatorial Search.

[18]

Manzini, G. 1995. BIDA*: an improved perimeter search algorithm. Artificial Intelligence 75(2):347-360.

[19]

Pearl, J. 1984. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Boston, MA, USA: Addison-Wesley Longman Publishing Co., Inc.

[20]

Pohl, I. 1971. Bi-directional search. Machine Intelligence 6:127-140.

[21]

Yang, F.; Culberson, J. C.; Holte, R.; Zahavi, U.; and Felner, A. 2008. A general theory of additive state space abstractions. Journal of Artificial Intelligence Research 32:631-662.

[22]

Zhou, R., and Hansen, E. A. 2006. Breadth-first heuristic search. Artificial Intelligence 170(4):385-408.

Cited By

Bu ZKorf R(2019)A*+IDA*Proceedings of the 28th International Joint Conference on Artificial Intelligence10.5555/3367032.3367204(1206-1212)Online publication date: 10-Aug-2019
https://dl.acm.org/doi/10.5555/3367032.3367204
Zhong SLiu QZhang ZFu Q(2019)Efficient reinforcement learning in continuous state and action spaces with Dyna and policy approximationFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-017-6222-613:1(106-126)Online publication date: 1-Feb-2019
https://dl.acm.org/doi/10.1007/s11704-017-6222-6
Chen JHolte RZilles SSturtevant N(2017)Front-to-end bidirectional heuristic search with near-optimal node expansionsProceedings of the 26th International Joint Conference on Artificial Intelligence10.5555/3171642.3171713(489-495)Online publication date: 19-Aug-2017
https://dl.acm.org/doi/10.5555/3171642.3171713
Show More Cited By

Limitations of front-to-end bidirectional heuristic search
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies

Recommendations

An Improved Bidirectional Heuristic Search Algorithm

A modification of Pohl's bidirectional heuristic search algorithm is described together with a simplified implementation. Theorems are proved about conditions yielding shortest paths. The results are given of a worst-case analysis of different ...
Bidirectional heuristic search reconsidered

The assessment of bidirectional heuristic search has been incorrect since it was first published more than a quarter of a century ago. For quite a long time, this search strategy did not achieve the expected results, and there was a major ...
Distributed Unidirectional and Bidirectional Heuristic Search: Algorithm Design and Empirical Assessment

Since its introduction three decades ago, bidirectional heuristic search did not deliver the expected performance improvement over unidirectional search methods. The problem of search frontiers passing each other is a widely accepted conjecture led to ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

AAAI'15: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence

January 2015

4331 pages

ISBN:0262511290

Sponsors

Association for the Advancement of Artificial Intelligence

Publisher

AAAI Press

Publication History

Published: 25 January 2015

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Bu ZKorf R(2019)A*+IDA*Proceedings of the 28th International Joint Conference on Artificial Intelligence10.5555/3367032.3367204(1206-1212)Online publication date: 10-Aug-2019
https://dl.acm.org/doi/10.5555/3367032.3367204
Zhong SLiu QZhang ZFu Q(2019)Efficient reinforcement learning in continuous state and action spaces with Dyna and policy approximationFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-017-6222-613:1(106-126)Online publication date: 1-Feb-2019
https://dl.acm.org/doi/10.1007/s11704-017-6222-6
Chen JHolte RZilles SSturtevant N(2017)Front-to-end bidirectional heuristic search with near-optimal node expansionsProceedings of the 26th International Joint Conference on Artificial Intelligence10.5555/3171642.3171713(489-495)Online publication date: 19-Aug-2017
https://dl.acm.org/doi/10.5555/3171642.3171713
Torralba ÁLópez CBorrajo D(2016)Abstraction heuristics for symbolic bidirectional searchProceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence10.5555/3061053.3061079(3272-3278)Online publication date: 9-Jul-2016
https://dl.acm.org/doi/10.5555/3061053.3061079
Sturtevant NChen J(2016)External memory bidirectional searchProceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence10.5555/3060621.3060716(676-682)Online publication date: 9-Jul-2016
https://dl.acm.org/doi/10.5555/3060621.3060716
Holte RFelner ASharon GSturtevant N(2016)Bidirectional search that is guaranteed to meet in the middleProceedings of the Thirtieth AAAI Conference on Artificial Intelligence10.5555/3016100.3016382(3411-3417)Online publication date: 12-Feb-2016
https://dl.acm.org/doi/10.5555/3016100.3016382

View Options

View options

Figures

Tables

Media

View Table of Conten