Advanced SearchSearch Tips
Reducing Search Space of A* Algorithm Using Obstacle Information
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
  • Journal title : Journal of Korea Game Society
  • Volume 15, Issue 4,  2015, pp.179-188
  • Publisher : Korea Game Society
  • DOI : 10.7583/JKGS.2015.15.4.179
 Title & Authors
Reducing Search Space of A* Algorithm Using Obstacle Information
Cho, Sung Hyun;
  PDF(new window)
The A* algorithm is a well-known pathfinding algorithm. However, if the information about obstacles is not exploited, the algorithm may collide with obstacles or lead into swamp areas unnecessarily. In this paper, we propose new heuristic functions using the information of obstacles to avoid them or swamp areas. It takes time to process the information of obstacles before starting pathfinding, but it may not cause any problems most of cases because it is not processed in real time. We showed that the proposed methods could reduce the search space effectively through experiments. Furthermore, we showed that heuristic functions using obstacle information could reduce the search space effectively without processing obstacle information at all.
A* Algorithm;Path Finding;Heuristic Function;Search Space Reduction;
 Cited by
Bryan Stout, "The Basics of A* for Path Planning", Game Programming Gems, pp.254-263, Charles River Media, 2000.

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. crossref(new window)

Nils J. Nilsson, Artificial intelligence: A New Synthesis, Morgan Kafmann, 1998.

R. Korf, "Depth-first Iterative Deepening: An Optimal Admissible Tree Search", Artificial Intelligence, 27: pp. 97-109, 1985. crossref(new window)

Robert Kirk and DeLisle, "Beyond A*: IDA* and Fringe Search", Game Programming Gems 7, pp. 289-294, 2008.

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.

Ron Penton, Data Structures for Game Programmers, Premier Press Game Development, pp. 715-767, 2002.

Sung Hyun Cho, "A Pathfinding Algorithm Using Path Information", Korea Game Society, Vol. 13, No. 1, pp. 31-40, 2013.

Dan Higgins, "Fast A* implementation", AI game Programming Wisdom, pp. 223-238, 2003.

Steve Ravin, "A* Speed Optimizations", Game programming Gems, pp. 363-381, Charles River Media, 2000.

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.