Name
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 cmmby decoupling collision avoidance with the environment and local steering behavior. The result is a method that keeps the advantages of the cmmbut has much more natural steering. Also the method allows for more flexibility in the desired routes of the characters. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-87744-8_1 | ESA |
Keywords | Field | DocType |
path planning,virtual environment,virtual worlds | Motion planning,Metaverse,Discrete mathematics,Any-angle path planning,Simulation,Computer science,Decoupling (cosmology),Medial axis,Collision,Control network,Flexible path,Distributed computing | Conference |
Volume | ISSN | Citations |
5193 | 0302-9743 | 4 |
PageRank | References | Authors |
0.50 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mark H. Overmars | 1 | 4572 | 518.80 |
| Ioannis Karamouzas | 2 | 225 | 16.79 |
| Roland Geraerts | 3 | 381 | 25.70 |