Flexible Path Planning Using Corridor Maps

Authors:
Mark Overmars;Ioannis Karamouzas;Roland Geraerts
Affiliations:
Department of Information and Computing Sciences, Utrecht University, Utrecht, the Netherlands 3508 TA;Department of Information and Computing Sciences, Utrecht University, Utrecht, the Netherlands 3508 TA;Department of Information and Computing Sciences, Utrecht University, Utrecht, the Netherlands 3508 TA
Venue:
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Year:
2008

Citing 9
Cited 2

Artificial intelligence: a modern approach

Artificial intelligence: a modern approach
Fast computation of generalized Voronoi diagrams using graphics hardware

Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Robot Motion Planning

Robot Motion Planning
Game Programming Gems

Game Programming Gems
Retraction: A new approach to motion-planning

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The visibility--voronoi complex and its applications

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Planning Algorithms

Planning Algorithms
The corridor map method: a general framework for real-time high-quality path planning: Research Articles

Computer Animation and Virtual Worlds
Creating High-quality Paths for Motion Planning

International Journal of Robotics Research

Camera Planning in Virtual Environments Using the Corridor Map Method

MIG '09 Proceedings of the 2nd International Workshop on Motion in Games
Knowledge-based probability maps for covert pathfinding

MIG'10 Proceedings of the Third international conference on Motion in games

Quantified Score

Hi-index	0.00

Visualization

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.