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*. © Springer-Verlag 2000.
Cite
CITATION STYLE
Johann, M. O., Caldwell, A., Reis, R. A. L., & Kahng, A. B. (2000). Admissibility proofs for the LCS* algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1952 LNAI, pp. 236–244). Springer Verlag. https://doi.org/10.1007/3-540-44399-1_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
