A survey and classification of A* based best-first heuristic search algorithms

Authors:
Luis Henrique Oliveira Rios;Luiz Chaimowicz
Affiliations:
Departamento de Ciência da Computação, Universidade Federal de Minas Gerais;Departamento de Ciência da Computação, Universidade Federal de Minas Gerais
Venue:
SBIA'10 Proceedings of the 20th Brazilian conference on Advances in artificial intelligence
Year:
2010

Citing 21
Cited 1

Depth-first iterative-deepening: an optimal admissible tree search

Artificial Intelligence
Real-time heuristic search

Artificial Intelligence
PRA*: massively parallel heuristic search

PRA*: massively parallel heuristic search
Efficient memory-bounded search methods

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Linear-space best-first search

Artificial Intelligence
Complexity analysis admissible heuristic search

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Agent-centered search

AI Magazine
Real-Time Search for Autonomous Agents and Multiagent Systems

Autonomous Agents and Multi-Agent Systems
Memory-Bounded A* Graph Search

Proceedings of the Fifteenth International Florida Artificial Intelligence Research Society Conference
A* with Partial Expansion for Large Branching Factor Problems

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Multiple sequence alignment using anytime A*

Eighteenth national conference on Artificial intelligence
Lifelong planning A*

Artificial Intelligence
Incremental heuristic search in AI

AI Magazine
Frontier search

Journal of the ACM (JACM)
Real-time adaptive A*

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Generalized Adaptive A*

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Dynamic fringe-saving A*

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Best-first frontier search with delayed duplicate detection

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Anytime heuristic search

Journal of Artificial Intelligence Research
The fringe-saving A* search algorithm: a feasibility study

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Best-first heuristic search for multi-core machines

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence

Application of wrapper methods for feature selection in modelling ripening process of a viticulture crop

ACACOS'11 Proceedings of the 10th WSEAS international conference on Applied computer and applied computational science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.