An improved bi-directional heuristic search algorithm

Authors:
Dennis De Champeaux;Lenie Sint
Affiliations:
Instituut voor Bedrijfseconomie en Accountancy, Universiteit van Amsterdam, Netherlands;Instituut voor Bedrijfseconomie en Accountancy, Universiteit van Amsterdam, Netherlands
Venue:
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Year:
1975

Citing 2
Cited 0

Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence
Planning in a hierarchy of abstraction spaces

IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

A modification of Pohl's bi-directional heuristic search algorithm is desribed 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 rankorder of their quality. Results that Pohl had obtained with a uni-directional heuristic search algorithm on the 15-puzzle are compared with the results obtained by the new -simplified-algorithm.