Cluster based partitioning for agent-based crowd simulations

  • Authors:
  • Yongwei Wang;Michael Lees;Wentong Cai;Suiping Zhou;Malcolm Yoke Hean Low

  • Affiliations:
  • Nanyang Technological University, Singapore;Nanyang Technological University, Singapore;Nanyang Technological University, Singapore;Nanyang Technological University, Singapore;Nanyang Technological University, Singapore

  • Venue:
  • Winter Simulation Conference
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Simulating crowds is a challenging but important problem. There are various methodologies in the literature ranging from macroscopic numerical flow simulations to detailed, microscopic agent simulations. One key issue for all crowd simulations is scalability. Some methods address this issue through abstraction, describing global properties of homogeneous crowds. However, ideally a modeler should be able to simulate large heterogeneous crowds at fine levels of detail. We are attempting to achieve scalability through the application of distributed simulation techniques to agent-based crowd simulation. Distributed simulation, however, introduces its own challenges, in particular how to efficiently partition the load between a number of machines. In this paper we introduce a method of partitioning agents onto machines using an adapted k-means clustering algorithm. We present, validate and use an analysis tool to compare the proposed clustered partitioning approach with a series of existing methods.