1 |
Bryan Stout, "The Basics of A* for Path Planning", Game Programming Gems, pp.254-263, Charles River Media, 2000.
|
2 |
P. Hart, N. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths", IEEE Trans. Syst. Sci. Cybernet, 4(2): pp. 100-107, 1968.
DOI
|
3 |
Nils J. Nilsson, Artificial intelligence: A New Synthesis, Morgan Kafmann, 1998.
|
4 |
R. Korf, "Depth-first Iterative Deepening: An Optimal Admissible Tree Search", Artificial Intelligence, 27: pp. 97-109, 1985.
DOI
|
5 |
Robert Kirk and DeLisle, "Beyond A*: IDA* and Fringe Search", Game Programming Gems 7, pp. 289-294, 2008.
|
6 |
Nir Pochter, Aviv Zohar, Jeffrey S. Rosenschein, Ariel Felnner, "Search Space Reduction Using Swamp Hierarchies", Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, pp. 155-160, 2010.
|
7 |
Ron Penton, Data Structures for Game Programmers, Premier Press Game Development, pp. 715-767, 2002.
|
8 |
Sung Hyun Cho, "A Pathfinding Algorithm Using Path Information", Korea Game Society, Vol. 13, No. 1, pp. 31-40, 2013.
|
9 |
Dan Higgins, "Fast A* implementation", AI game Programming Wisdom, pp. 223-238, 2003.
|
10 |
Steve Ravin, "A* Speed Optimizations", Game programming Gems, pp. 363-381, Charles River Media, 2000.
|
11 |
Daniel Harabor and Alban Grastein, "Online Graph Pruning for Pathfinding on Grid Maps", Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, pp. 1114-1119, 2011.
|