Towards a Better Understanding of Bidirectional Search
Abstract
Three admissible bidirectional search algorithms have been described in the literature: A Cartesian product approach due to Doran, Pohl's BHPA, and Champeaux and Sint's BHFFA2. This paper describes an algorithm, GP, which contains the latter two and others. New admissibility results are obtained. A first order analysis is made comparing the run times of Cartesian produc$ search, two versions of GP, and unidirectional A. The goal is to gain insight on when bidirectional search is useful and direction for seeking better bidirectional search algorithms. 1.
Cite
Text
Davis et al. "Towards a Better Understanding of Bidirectional Search." AAAI Conference on Artificial Intelligence, 1984.Markdown
[Davis et al. "Towards a Better Understanding of Bidirectional Search." AAAI Conference on Artificial Intelligence, 1984.](https://mlanthology.org/aaai/1984/davis1984aaai-better/)BibTeX
@inproceedings{davis1984aaai-better,
title = {{Towards a Better Understanding of Bidirectional Search}},
author = {Davis, Henry W. and Pollack, Randy B. and Sudkamp, Thomas A.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1984},
pages = {68-72},
url = {https://mlanthology.org/aaai/1984/davis1984aaai-better/}
}