Admissibility Proofs for the LCS* Algorithm

Authors:
Marcelo O. Johann;Andrew E. Caldwell;Ricardo A. L. Reis;Andrew B. Kahng
Affiliations:
-;-;-;-
Venue:
IBERAMIA-SBIA '00 Proceedings of the International Joint Conference, 7th Ibero-American Conference on AI: Advances in Artificial Intelligence
Year:
2000

Citing 8
Cited 0

Generalized best-first search strategies and the optimality of A*

Journal of the ACM (JACM)
BS*: an admissible bidirectional staged heuristic search algorithm

Artificial Intelligence
Bidirectional heuristic search with limited resources

Information Processing Letters
BIDA: an improved perimeter search algorithm

Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence
Bidirectional heuristic search reconsidered

Journal of Artificial Intelligence Research
Bidirectional best-first search with bounded error: summary of results

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
How to use limited memory in heuristic search

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

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*.