Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
A Survey and Classification of A* Based Best-First Heuristic Search Algorithms
verfasst von : Luis Henrique Oliveira Rios, Luiz Chaimowicz
Erschienen in: Advances in Artificial Intelligence – SBIA 2010
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A* (
a-star
) is a well known best-first search algorithm that has been applied to the solution of different problems. In recent years, several extensions have been proposed to adapt it and improve its performance in different application scenarios. In this paper, we present a survey and classification of the main extensions to the A* algorithm that have been proposed in the literature. We organize them into five classes according to their objectives and characteristics:
incremental
,
memory-concerned
,
parallel
,
anytime
, and
real-time
. For each class, we discuss its main characteristics and applications and present the most representative algorithms.