Abstract
Several optimality theorems hold for the A * algorithm, one important says: A * dominates every other admissible heuristic search algorithm assumed that the underlying heuristic function is monotone. An analogous result is proved for the bidirectional case. A bidirectional heuristic search algorithm, named OBDS, is presented which is admissible and dominates every other admissible bidirectional heuristic search algorithm B assumed that the underlying heuristic function is bi-monotone.
This is a preview of subscription content, log in via an institution to check access.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eckerle, J. (1994). An optimal bidirectional search algorithm. In: Nebel, B., Dreschler-Fischer, L. (eds) KI-94: Advances in Artificial Intelligence. KI 1994. Lecture Notes in Computer Science, vol 861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58467-6_37
Download citation
DOI: https://doi.org/10.1007/3-540-58467-6_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58467-4
Online ISBN: 978-3-540-48979-5
eBook Packages: Springer Book Archive