An Improved Di-Directional Heuristic Search Algorithm
Proceedings of the Fourth International Joint Conference on Artificial Intelligence. Search Techniques. Pages 309-313.
Abstract
A modification of Pohl's bi-directional heuristic search algorithm is desribed together with a simpl i fied 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. Keywords: artificial :lntelligence, bi-directional heuristic search, front to front guiding, path finding.
@inproceedings{ijcai1975p47,
title = {An Improved Di-Directional Heuristic Search Algorithm},
author = {de Champeaux, Dennis and Sint, Lenie},
booktitle = {Proceedings of the Fourth International Joint Conference on
Artificial Intelligence, {IJCAI-75}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Patrick Winston and Carl Hewitt},
pages = {309--313},
year = {1975},
note = {Search Techniques},
url = {https://ijcai.org/proceedings/1975/47},
}
TY - CPAPER TI - An Improved Di-Directional Heuristic Search Algorithm AU - de Champeaux, Dennis AU - Sint, Lenie T2 - Proceedings of the Fourth International Joint Conference on Artificial Intelligence, IJCAI-75 PB - International Joint Conferences on Artificial Intelligence PY - 1975 SP - 309 EP - 313 UR - https://ijcai.org/proceedings/1975/47 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: