Abstract
Path planning is a central problem in virtual environments and games. When computer-controlled characters move around in virtual worlds they have to plan their paths to desired locations. These paths must avoid collisions with the environment and with other moving characters. Also a chosen path must be natural, meaning that it is the kind of path a real human being could take. The algorithms for planning such paths must be able to handle hundreds of characters in real-time and must be flexible.
The Corridor Map Method (cmm) was recently introduced as a flexible path planning method in interactive virtual environments and games. The method is fast and flexible and the resulting paths are reasonable. However, the paths tend to take unnatural turns when characters get close to other characters or small obstacles. In this paper we will improve on the cmm by decoupling collision avoidance with the environment and local steering behavior. The result is a method that keeps the advantages of the cmm but has much more natural steering. Also the method allows for more flexibility in the desired routes of the characters.
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.
Similar content being viewed by others
References
Latombe, J.C.: Robot Motion Planning. Kluwer, Dordrecht (1991)
LaValle, S.: Planning Algorithms (2006), http://planning.cs.uiuc.edu
Rimon, E., Koditschek, D.: Exact robot navigation using artificial potential fields. IEEE Transactions on Robotics and Automation 8, 501–518 (1992)
DeLoura, M.: Game Programming Gems 1. Charles River Media, Inc. (2000)
Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs (1994)
Geraerts, R., Overmars, M.: Creating high-quality paths for motion planning. International Journal of Robotics Research 26, 845–863 (2007)
Geraerts, R., Overmars, M.: The corridor map method: A general framework for real-time high-quality path planning. Computer Animation and Virtual Worlds 18, 107–119 (2007)
Geraerts, R., Overmars, M.: Enhancing corridor maps for real-time path planning in virtual environments. In: Computer Animation and Social Agents (2008)
Hoff, K., Culver, T., Keyser, J., Lin, M., Manocha, D.: Fast computation of generalized voronoi diagrams using graphics hardware. In: International Conference on Computer Graphics and Interactive Techniques, pp. 277–286 (1999)
Stucki, P.: Obstacles in pedestrian simulations. Master’s thesis, Swiss Federal Institute of Technology ETH (September 2003)
Transportation Research Board, National Research Council Washington, D.C: Highway Capacity Manual (2000)
Helbing, D., Molnár, P.: Social force model for pedestrian dynamics. Physical Review 51, 4282–4287 (1995)
Wein, R., Berg, J., Halperin, D.: The Visibility-Voronoi complex and its applications. In: Annual Symposium on Computational Geometry, pp. 63–72 (2005)
Ó’Dúnlaing, C., Sharir, M., Yap, C.: Retraction: A new approach to motion planning. In: ACM Symposium on Theory of Computing, pp. 207–220 (1983)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Overmars, M., Karamouzas, I., Geraerts, R. (2008). Flexible Path Planning Using Corridor Maps. In: Halperin, D., Mehlhorn, K. (eds) Algorithms - ESA 2008. ESA 2008. Lecture Notes in Computer Science, vol 5193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87744-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-87744-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87743-1
Online ISBN: 978-3-540-87744-8
eBook Packages: Computer ScienceComputer Science (R0)