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 amendments to steer the search using computationally demanding heuristics. The computation cost associated with front-to-front evaluations crippled further investigation and hence bidirectional search was long neglected. However, recent findings demonstrate that the initial conjecture is wrong since the major search effort is spent after the frontiers have already met . In this paper we reconsider bidirectional search by proposing a new generic approach based on cluster computing. The proposed approach is then evaluated and compared with its unidirectional counterparts. The obtained results reveal that cluster computing is a viable approach for distributed heuristic search. Particularly, clustered bidirectional search is capable of solving problems beyond unidirectional search capabilities and in the same time outperforms unidirectional approaches in terms of memory space and execution time.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
A. Al-Ayyoub and F. Masoud. Heuristic search revisited. Journal of Systems and Software, 55(2):103–113, 2000.
A. Al-Ayyoub and F. Masoud. Search quality and effectiveness for intelligent systems. In Proceedings of the 8th International Conference on Intelligent Systems, Denver, Colorado, USA, pp. 146–149, June 24–26, 1999.
D. DeChampeaux. Bidirectional heuristic search again. Journal of the ACM, 30(1): 22–32, 1983.
D. DeChampeaux and L. Sint. An improved bidirectional heuristic search algorithm. Journal of the ACM, 24(2):177–191, 1977.
A. Grama and V. Kumar. A survey of parallel search algorithms for discrete optimization. Technical Report Number 93-11. Department of Computer Science and Engineering, The University of Minnesota, 1993.
O. Hansson, A. Mayer, and M. Yung. Criticizing solutions to relaxed models yields powerful admissible heuristics. Information Science, 63(3):207–227, 1992.
H. Kaindl and G. Kainz. Bidirectional heuristic search reconsidered. Journal of Artificial Intelligence Research, 7:283–317, 1997.
R. Krof. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97–109, 1985.
R. Korf. Linear-space best-first search. Artificial Intelligence, 62(1):41–78, 1993.
V. Kumar and V. Rao. Scalable parallel formulation of depth-first search. In V. Kumar, P. Gopalakishnan, and L. Kanal, eds. Parallel Algorithms for Machine Intelligence and Vision, Springer-Verlag, New York, 1990.
G. Manzini. BIDA*: An improved perimeter search algorithm. Artificial Intelligence, 75(2):347–360, 1995.
N. Nadal. Tree search and arc consistency in constraint satisfaction algorithms. In L. Kanal and V. Kumar, eds. Search in Artificial Intelligence, Springer-Verlag, New York, 1988.
N. Nilsson. Principles of Artificial Intelligence. Tioga Publishing Company, Palo Alto, 1980.
J. Pearl. Heuristic-Intelligence Search Strategies for Computer Problem Solving. Addison-Wesley, Reading MA, 1984.
I. Phol. Bi-directional search. Machine Intelligence, 6:127–140, 1971.
G. Politowski and I. Pohl. D-node Retargeting in Bidirectional Heuristic Search. In Proceedings of the Fourth National Conference on Artificial Intelligence, Menlo Park, CA, pp. 274–277, 1984.
C. Powley and R. Korf. Single-agent parallel window search. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI–13(5):466–477,1991.
V. Rao and V. Kumar. Parallel depth-first search, Part I: implementation. International Journal of Parallel Programming, 16(6):479–499, 1987.
About this article
Cite this article
Al-Ayyoub, A. Distributed Unidirectional and Bidirectional Heuristic Search: Algorithm Design and Empirical Assessment. J Supercomput 32, 231–250 (2005). https://doi.org/10.1007/s11227-005-0165-7
- cluster computing
- distributed heuristic search
- performance evaluation