D-Node Retargeting in Bidirectional Heuristic Search

Although it is generally agreed that bidirectional heuristic search is potentially more efficient than unidirectional heuristic search, so far there have been no algorithms which realize this potential. The basic difficulty is that the two search trees (one rooted at the start, the other at the goal) do not meet in the middle. This results in essentially two unidirectional searches and poorer performance. In this paper we present an efficient algorithm for bidirectional heuristic search which overcomes this difficulty. We also compare this algorithm with de Champeaux's BHFFA [2,3] on the basis of search efficiency, solution quality, and computational cost.

[1]  Dennis de Champeaux,et al.  An Improved Bidirectional Heuristic Search Algorithm , 1975, JACM.

[2]  J. Doran,et al.  Experiments with the Graph Traverser program , 1966, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[3]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[4]  Eugene L. Lawler,et al.  Finding Shortest Paths in Very Large Networks , 1983, WG.

[5]  Ira Sheldon Pohl,et al.  Bi-directional and heuristic search in path problems , 1969 .

[6]  Dennis de Champeaux,et al.  Bidirectional Heuristic Search Again , 1983, JACM.