Abstract
Bidirectional search and heuristic search are techniques that improve the performance of a shortest path graph search. Despite many attempts to use both at the same time, this combination had been leading to worse results in average, compared to the classic unidirectional heuristic A* algorithm. In[4], a new graph search algorithm was developed LCS*, that is the first to combine these techniques effectively. LCS* is a generic and simultaneous bidirectional heuristic algorithm which is faster than A* in most domains. This work present formal proofs of the completeness and admissibility of LCS*.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Dechter and J. Pearl, Generalized Best-First Search Strategies and the Optimality of A, J. Assoc. Comput. Mach., 32 (1985), pp. 505–536.
S. Ghosh and A. Mahanti, Bidirectional Heuristic Search with Limited Resources, Information Processing Letters, 40 (1991), pp. 335–340.
P. E. Hart, N. J. Nilsson, and B. Raphael,A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Transactions on Systems, Science and Cybernetics, SSC-4 (1968), pp. 100–107.
M. Johann, A. Caldwell, A. Kahng, and R. Reis, A New Bidirectional Heu-ristic Shortest Path Search Algorithm. Accepted for publication in the proceedings of the International ICSC Congress on Intelligent Systems and Applications, 2000.
H. Kaindl, G. Kainz, A. Leeb, and H. Smetana, How to Use Limited Memory in Heuristic Search, in Proceedings of the International Joint Conference on Artificial Intelligence, vol. 1, 1995, pp. 236–242.
H. Kaindl, G. Kainz, Bidirectional Heuristic Search Reconsidered, in Journal of Artificial Intelligence, vol. 7, 1997, pp. 283–317.
A. L. Koll and H. Kaindl, Bidirectional Best-First Search with Bounded Error: Summary of Results, in Proceedings of the International Joint Conference on Artificial Intelligence, 1993, pp. 217–223.
J. B. H. Kwa, BS: An Admissible Bidirectional Staged Heuristic Search Algo-rithm, Artificial Intelligence, 38 (1989), pp. 95–109.
G. Manzini, BIDA: An Improved Perimeter Search Algorithm, Artificial Intelligence, 75 (1995), pp. 347–360.
N. J. Nilsson, Problem-Solving Methods in Artificial Intelligence, McGraw-Hill Book Co., 1971, ch. State-Space Search Methods, pp. 43–79.
J. Pearl, Heuristics, Addison-Wesley, 1984, ch. Formal Properties of Heuristic Methods, pp. 73–87+.
I. Pohl, Bi-Directional Search, in Machine Intelligence, 1971, pp. 127–140.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Johann, M.O., Caldwell, A., Reis, R.A.L., Kahng, A.B. (2000). Admissibility Proofs for the LCS* Algorithm. In: Monard, M.C., Sichman, J.S. (eds) Advances in Artificial Intelligence. IBERAMIA SBIA 2000 2000. Lecture Notes in Computer Science(), vol 1952. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44399-1_25
Download citation
DOI: https://doi.org/10.1007/3-540-44399-1_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41276-2
Online ISBN: 978-3-540-44399-5
eBook Packages: Springer Book Archive