Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Hierarchical Path Planning for Virtual Crowds
| Book Series | Lecture Notes in Computer Science |
| Publisher | Springer Berlin / Heidelberg |
| ISSN | 0302-9743 (Print) 1611-3349 (Online) |
| Volume | Volume 5277/2008 |
| Book | Motion in Games |
| DOI | 10.1007/978-3-540-89220-5 |
| Copyright | 2008 |
| ISBN | 978-3-540-89219-9 |
| DOI | 10.1007/978-3-540-89220-5_5 |
| Pages | 43-50 |
| Subject Collection | Computer Science |
| SpringerLink Date | Friday, November 07, 2008 |
| |
|
Hierarchical Path Planning for Virtual Crowds
Kai Yip Wong4 and Céline Loscos5
| (4) |
University College London, Gower Street, London, WC1E 6BT, UK |
| (5) |
Institut d’Informàtica i Aplicacions, Universitat de Girona, Campus Montilivi, Girona, 17071, Spain |
Abstract
In this paper, we propose a hierarchical approach to path planning that scales well for large crowds. Crowds have become an
important research field that presents challenges associated to the high complexity of potential behaviors. In most related
work crowds are designed to follow global or local rules that infer intelligent navigation and behavior. Path planning methods
can be applied in simulation where it is required to have an exact distribution of the crowd in the environment. However,
the simulation is often created offline as path planning algorithms do not scale well with large numbers of agents, if each
is considered individually. Our approach provides reliable paths that can be used for environment crowd distribution evaluations,
and scales well with a high number of agents to run at interactive from rates for up to a few thousand agents.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|