Hierarchical Path Planning for Virtual Crowds

  • Kai Yip Wong
  • Céline Loscos
Conference paper

DOI: 10.1007/978-3-540-89220-5_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5277)
Cite this paper as:
Wong K.Y., Loscos C. (2008) Hierarchical Path Planning for Virtual Crowds. In: Egges A., Kamphuis A., Overmars M. (eds) Motion in Games. MIG 2008. Lecture Notes in Computer Science, vol 5277. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Kai Yip Wong
    • 1
  • Céline Loscos
    • 2
  1. 1.University College LondonLondonUK
  2. 2.Institut d’Informàtica i AplicacionsUniversitat de GironaGironaSpain

Personalised recommendations