Abstract
We propose to use the generalized visibility graph (Vgraph) to represent search space for finding a natural-looking path in computer games. The generalized Vgraph is the extension of the visibility graph to the generalized polygonal world which is produced as a result of dilating polygonal obstacles. That is, the generalized visibility graph is constructed on the expanded boundaries of obstacles so that the path keeps an amount of clearance from obstacles. We also introduce an algorithm that can efficiently incorporate a start and a goal location to the map represented in a generalized Vgraph for quick path-finding. The A* algorithm with Euclidean distance is used for quick path-finding. The proposed approach is compared to other major search space representations analytically and empirically. The results show that the map can be generated efficiently by using the generalized Vgraph and the paths found look natural.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
de Berg, M., van Kreveld, M., Overmas, M., Schwarzkorf, O.: Computational Geometry-Algorithms and Applications, 2nd edn. Springer, Berlin Heidelberg, New York (2000)
Botea, A., Muller, M., Schaeffer, J.: Near optimal hierarchical path-finding. Journal of game development 1(1), 1–22 (2004)
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)
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)
Latombe, J.C.: Robot Motion Planning. Kluwer Academic Publishers, Boston (1991)
Laumond, J.P.: Obstacle growing in a nonpolygonal world. Inform. Proc. Letter 25(1), 41–50 (1987)
Pinter, M.: Towards more realistic pathfinding. Game Developer Magazine (April 2001)
Rabin, S.: A* speed optimizations and A* Aesthetic Optimizations. In: Deloura, M. (ed.) Game Programming Gems, Charles Rive Media, pp. 264–287. (2000)
Stout, B.: Smart moves: Intelligent path-finding. Game developer magazine, 28–35 (October 1996)
Tozour, P.: Search Space Representations. In: Rabin, S. (eds.): AI Game Programming Wisdom 2. Charles Rive Media, pp. 85-102 (2004)
Woodcock, S.: Game AI: The state of the industry. Game Developer Magazine (August 2000)
Young, T.: Expanded Geometry for Points-of-Visibility Pathfinding. In: Deloura, M. (eds.): Game Programming Gems 2, Charles Rive Media (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, K. (2006). Finding a Natural-Looking Path by Using Generalized Visibility Graphs. In: Yang, Q., Webb, G. (eds) PRICAI 2006: Trends in Artificial Intelligence. PRICAI 2006. Lecture Notes in Computer Science(), vol 4099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-36668-3_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-36668-3_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36667-6
Online ISBN: 978-3-540-36668-3
eBook Packages: Computer ScienceComputer Science (R0)