Browse > Article
http://dx.doi.org/10.7583/JKGS.2013.13.1.31

A Pathfinding Algorithm Using Path Information  

Cho, Sung Hyun (School of Games, Hongik University)
Publication Information
Journal of Korea Game Society / v.13, no.1, 2013 , pp. 31-40 More about this Journal
Abstract
A* algorithm is a well known pathfinding algorithm. However, there may be a limit to use A* algorithm in real-time in a map where many interactions occur between objects or many obstacles exist. Therefore, it may be necessary to find a naturally looking path quickly instead of finding a shortest path in games. In this paper, we propose a new heuristic function to exploit path information in a map. We also show that the pathfinding algorithm based on the proposed heuristic function can find a good path much faster than A* algorithm on several grid maps.
Keywords
A* Algorithm; Pathfinding; Heuristic Function;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 Mario Grimani and Matthew Titelbaum, "Beyond A* Algorithm", Game Programming Gems 5, pp. 452-468, Information Publishing Group, 2006.
2 Myun-Sub Lee, "A Study on Searching a Path of the Intelligent Character using Genetic Algorithm", Journal of Korea Game Society, Vol. 9, No. 4, pp. 81-88, 2009.   과학기술학회마을
3 Amit J. Patel, Amit's A* Pages, Amit's Game Programming Information, http://theory.stanford.edu/-amitp/GameProgramming/.
4 Dan Higgins, "Fast A* Implementation", AI Game Programming Wisdom, pp. 223-238, 2003.
5 Steve Ravin, "A* Speed Optimizations", Game programming Gems, pp. 363-381, Charles River Media, 2000.
6 A. Stentz, "Optimal and Efficient Path Planning for Unknown and Dynamic Environments", International Journal of Robotics and Automation, Vol. 10, pp. 89-100, 1993.
7 Oh-Ik Kwon and Teag-Keun Whangbo, "A Dynamic Pathfinding Method Avoiding Moving Obstacles in a 3D Game Environment", Journal of Korea Game Society, Vol. 6, No. 3, pp. 3-12, 2006.   과학기술학회마을
8 Bryan Stout, "The Basics of A* for Path Planning", Game Programming Gems, pp. 254-263, Charles River Media, 2000.
9 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   ScienceOn
10 Nils J. Nilsson, Artificial intelligence: A New Synthesis, Morgan Kafmann, 1998.
11 S. J. Kang, Y. O. Kim, and C. H. Kim, "Live Path: Adaptive Agent Navigation in the Interactive Virtual World", The Visual Computer, Vol. 26, No. 6, pp. 467-476, 2010.   DOI
12 Ron Penton, Data Structures for Game Programmers, Premier Press Game Development, pp. 715-767, 2002.
13 R. Korf, "Depth-first Iterative Deepening: An Optimal Admissible Tree Search", Artificial Intelligence, 27: pp. 97-109, 1985.   DOI   ScienceOn
14 Robert Kirk and DeLisle, "Beyond A*: IDA* and Fringe Search", Game Programming Gems 7, pp. 289-294, 2008.
15 Marco Tombesi, "Improved Pathfinding with Minimum Replanning Cost: Dynamic A*(D*)", Game Programming Gems 5, pp. 469-476, Information Publishing Group, 2006.
16 A. Botea, M. Muller, and J. Schaeffer, "Near Optimal Hierarchical Path-finding", J. of Game Develop. 1(1), pp. 7-28, 2004.