Browse > Article

Efficient State Space Generation for Guaranteeing a Natural-Looking Path for NPCs  

Yu, Kyeon-Ah (덕성여자대학교 컴퓨터공학부)
Publication Information
Journal of KIISE:Software and Applications / v.34, no.4, 2007 , pp. 368-376 More about this Journal
Abstract
How to represent the search space is as important as which search algorithm to use for finding natural-looking paths for moving NPC (non-player character) in computer games. Recently, various state space representation methods which have been developed for computer games are being used while A* algorithm dominates as the preferred search algorithm. These representation methods show some drawbacks such as the size of state space is too large, there is no guarantee for optimality, the path found is not natural-looking, and the generation of nodes and links is not automatic by depending on a level designer. In this paper the requirements for natural-looking paths are introduced and to find paths satisfying these requirements, the use of the generalized visibility graphs which is the extended version of the visibility graph in Robotics is proposed.
Keywords
search; path planning; state space; computer game; visibility graph;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Rossignac, J. and Requicha, A. G., 'Offsetting operations in solid modeling,' Computer Aided Geometric Design, Vol.3, pp.129-148, 1986   DOI   ScienceOn
2 Luger, G. and Stubblefield, W: Artificial Intelligence:Structures and Strategies for Complex Problem Solving. 3rd edn. Addison Wesley Longman Inc., 1998
3 Lee, D.T., Proximity and Reachability in the Plane, Ph.D. Dissertation, University of Illinoi, Urbana, IL, 1978
4 de Berg, M., van Kreveld, M., Overmas, M., Schwarzkorf, O., Computational Geometry-Algorithms and Applications. 2nd edn. Springer-Verlag, Berlin Heidelberg New York, 2000
5 Kitzinger, J., The Visibility Graph Among Polygonal Obstacles: a Comparison of Algorithms, M.S. Dissertation, University of New Mexico, 2003
6 Rabin, S., 'A* speed optimizations and A* Aesthetic Optimizations,' In: Deloura, M. (eds.): Game Programming Gems. Charles Rive Media, pp.264-287, 2000
7 Latombe, J. C., Robot Motion Planning, Kluwer Academic Publishers, 1991
8 Wein, R., Van der Berg, J.P., Halperin, D., 'The Visibility-Voronoi Complex and Its Applications,' In: Proc. European Workshop on Computational Geometry, pp.151-154, 2005
9 Pinter, M., 'Towards more realistic pathfinding,' Game Developer Magazine April, 2001
10 Laumond, J. P., 'Obstacle growing in a nonpolygonal world,' Inform. Proc. Letter, Vol.25(1),pp.41-50, 1987   DOI   ScienceOn
11 Woodcock, S.: Game AI, 'The state of the industry,' Game Developer Magazine August, 2000
12 Jung, D., Kim, H., Kim, J., Um K., Cho, H., 'Efficient Path Finding in 3D Games by using Visibility Tests with the A* Algorithm,' In: Proceedings of the International Conference Artificial Intelligence and Soft Computing, Spain, 2004
13 Young, T., 'Expanded Geometry for Points-of-Visibility Pathfinding,' In: Deloura, M. (eds.): Game Programming Gems 2, Charles Rive Media, 317-323, 2001
14 Tozour, P., 'Search Space Representations,' In:Rabin, S. (eds.): AI Game Programming Wisdom 2. Charles Rive Media, pp.85-102, 2004
15 Stout, B., 'Smart moves: Intelligent path-finding,' Game developer magazine, pp.28-35, 1996
16 Botea, A., Muller, M., Schaeffer, J., 'Near optimal hierarchical path-finding. Journal of game development,' Vol.1(1), pp.1-22, 2004
17 Yap, P., 'Grid-based Path-finding,' Lecture notes in Artificial Intelligence, Vol.2338, pp.44-55, 2002
18 Stentz, A., 'The Focused D* Algorithm for Real-Time Replanning,' in Proceedings of IJCAI'95, pp.1652-1659, 1995