Abstract
A central problem in games is planning high-quality paths for characters avoiding obstacles in the environment. Current games require a path planner that is fast (to ensure real-time interaction) and flexible (to avoid local hazards). In addition, a path needs to be natural, meaning that the path is smooth, short, keeps some clearance to obstacles, avoids other characters, etcetera.
Game worlds are normally populated with a large number of characters. In this paper we show how the recently introduced Corridor Map Method can be extended and used to efficiently compute smooth motions for these characters. We will consider crowds in which the characters wander around, characters have goals, and characters behave as a coherent group.
The approach is very fast. Even in environments with 5000 characters it uses only 40% of the processing power of a single core of a cpu. Also the resulting paths are indeed natural.
This is a preview of subscription content, log in via an institution to check access.
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)
Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4, 100–107 (1968)
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.: Interactive motion planning using hardware-accelerated computation of generalized Voronoi diagrams. In: IEEE International Conference on Robotics and Automation, pp. 2931–2937 (2000)
Perlin, K.: An image synthesizer. Computer Graphics 19(3), 287–296 (1985); SIGGRAPH 1985 Proceedings
Karamouzas, I., Overmars, M.H.: Adding variation to path planning. In: Computer Animation and Social Agents (2008)
Helbing, D., Molnár, P.: Social force model for pedestrian dynamics. Physical Review 51, 4282–4287 (1995)
Morini, F., Yersina, B., Maïm, J., Thalmann, D.: Real-time scalable motion planning for crowds. In: International Conference on Cyberworlds, pp. 144–151 (2007)
Sud, A., Gayle, R., Andersen, E., Guy, S., Lin, M., Manocha, D.: Real-time navigation of independent agents using adaptive roadmaps. In: ACM symposium on Virtual reality software and technology, pp. 99–106 (2007)
Treuille, A., Cooper, S., Popović, Z.: Continuum crowds. Transactions on Graphics 25, 1160–1168 (2006)
Knoblauch, R., Pietrucha, M., Nitzburg, M.: Field studies of pedestrian walking speed and start-up time. Transportation Research Record, 27–38 (1996)
Kamphuis, A., Overmars, M.: Finding paths for coherent groups using clearance. In: Eurographics/ ACM SIGGRAPH Symposium on Computer Animation, pp. 19–28 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Geraerts, R., Kamphuis, A., Karamouzas, I., Overmars, M. (2008). Using the Corridor Map Method for Path Planning for a Large Number of Characters. In: Egges, A., Kamphuis, A., Overmars, M. (eds) Motion in Games. MIG 2008. Lecture Notes in Computer Science, vol 5277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89220-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-89220-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89219-9
Online ISBN: 978-3-540-89220-5
eBook Packages: Computer ScienceComputer Science (R0)