Flexible path planning using corridor maps

6Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Overmars, M., Karamouzas, I., & Geraerts, R. (2008). Flexible path planning using corridor maps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5193 LNCS, pp. 1–12). Springer Verlag. https://doi.org/10.1007/978-3-540-87744-8_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free