Get started
Keyword

A* algorithm

Description: A graph search algorithm that finds low-cost paths by combining the cost already incurred with a heuristic estimate of remaining cost.
Wikidata ID: wiki/Q277680
OpenAlex ID: keywords/a-algorithm
A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems
2001 · Tracy D Braun, Howard Jay Siegel, et al. · Journal of Parallel and Distributed Computing · 1,724
Department of Computer Science
1993 · Hylke Buisman, Manuel Gomez-rodriguez, et al. · Journal of Computational and Applied Mathematics · 1,210
Generalized best-first search strategies and the optimality of A*
1985 · Rina Dechter, Judea Pearl · Journal of the ACM · 1,071
PDF
Path Planning for Autonomous Vehicles in Unknown Semi-structured Environments
2010 · Dmitri Dolgov, Sebastian Thrun, et al. · The International Journal of Robotics Research · 977
Path Planning with Modified a Star Algorithm for a Mobile Robot
2014 · František Duchoň, Andrej Babinec, et al. · Procedia Engineering · 872
PDF
Computing the shortest path: A search meets graph theory
2005 · Andrew V. Goldberg, Chris Harrelson · 743
Fast Exact Inference with a Factored Model for Natural Language Parsing
2002 · Dan Klein, Christopher D. Manning · 743
Lifelong Planning A∗
2004 · Sven Koenig, Maxim Likhachev, et al. · Artificial Intelligence · 660
PDF
Maximum margin planning
2006 · Nathan D. Ratliff, J. Andrew Bagnell, et al. · International Conference on Machine Learning · 617
Theta*: Any-Angle Path Planning on Grids
2010 · K. Daniel, A. Nash, et al. · Journal of Artificial Intelligence Research · 466
PDF
Online Graph Pruning for Pathfinding On Grid Maps
2011 · Daniel Harabor, Alban Grastien · Proceedings of the AAAI Conference on Artificial Intelligence · 416
Preserving order in a forest in less than logarithmic time and linear space
1977 · P. van Emde Boas · Information Processing Letters · 413
Footstep Planning for the Honda ASIMO Humanoid
2006 · J. Chestnutt, M. Lau, et al. · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · 398
VFH/sup */: local obstacle avoidance with look-ahead verification
2002 · I. Ulrich, J. Borenstein · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · 388
LAO∗: A heuristic search algorithm that finds solutions with loops
2001 · Eric A. Hansen, Shlomo Zilberstein · Artificial Intelligence · 388
PDF
Subdimensional expansion for multirobot path planning
2014 · Glenn Wagner, Howie Choset · Artificial Intelligence · 370
Ligand docking to proteins with discrete side-chain flexibility
1994 · Andrew R. Leach · Journal of Molecular Biology · 364
Correction to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths"
1972 · Peter E. Hart, Nils J. Nilsson, et al. · ACM SIGART Bulletin · 364
Searching for solutions in games and artificial intelligence
1994 · L.V. Allis · 347
PDF
A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion
1985 · Chien-Chung Shen, Wen-Hsiang Tsai · IEEE Transactions on Computers · 339
Theta*: Any-angle path planning on grids
2007 · Kenny Daniel, Alex Nash, et al. · 334
Performance measurement and analysis of certain search algorithms.
1979 · John Gaschnig · 333
The increasing cost tree search for optimal multi-agent pathfinding
2012 · Guni Sharon, Roni Stern, et al. · Artificial Intelligence · 330
PDF
Finding shortest paths on real road networks: the case for A*
2008 · W. Zeng, R. L. Church · International Journal of Geographical Information Systems · 330
Near Optimal Hierarchical Path-Finding.
2004 · Adi Botea, Martin Müller, et al. · 330
Works count: 10,520
Citation count: 89,660
Year
Topic
Type