论文信息 - An Improved Bidirectional Heuristic Search Algorithm

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 algorithms, suggesting a rank order of their quality. Results that Pohl had obtained with a unidirectional heuristic search algorithm on the 15-puzzle are compared with the results obtained with the new — simplified — algorithm.

Dennis de Champeaux | Lenie Sint | D. Champeaux | L. Sint

[1] W. W. Bledsoe,et al. Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub. , 1971, SGAR.

[2] Earl D. Sacerdott. Planning in a hierarchy of abstraction spaces , 1973, IJCAI 1973.

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

[4] Richard S. Rosenberg,et al. Look-Ahead and One-Person Games , 1972 .

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