Partitioning algorithms for agent-based crowd simulation

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...

Full description

Saved in:
Bibliographic Details
Main Author: Wang, Yongwei
Other Authors: Cai Wentong
Format: Theses and Dissertations
Language:English
Published: 2011
Subjects:
Online Access:https://hdl.handle.net/10356/46252
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-46252
record_format dspace
spelling sg-ntu-dr.10356-462522023-03-04T00:36:45Z Partitioning algorithms for agent-based crowd simulation Wang, Yongwei Cai Wentong School of Computer Engineering Parallel and Distributed Computing Centre DRNTU::Engineering::Computer science and engineering::Computing methodologies::Simulation and modeling 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. Generally, for an agent-based crowd simulation that aims to simulate a large number of agents under different scenarios, a proper partitioning algorithm is an essential factor to the performance of the system. However, selecting/developing an appropriate partitioning algorithm for a specific agent-based crowd simulation still remains an issue. One way is to implement distributed agent-based crowd simulations using multiple partitioning algorithms and to compare their performance. This requires multiple distributed simulation experiments, one for each partitioning algorithm. Considering the resources and the effort needed to perform multiple distributed simulation experiments, it is therefore preferred to predict the performance of partitioning algorithms instead. The research reported in this thesis focuses on investigating an effective and efficient approach to evaluate proposed partitioning algorithms for agent-based crowd simulations. A generic framework and an evaluation process are proposed to address the issue of selecting an appropriate partitioning algorithm by simulating the effect of a partitioning algorithm so as to predict its performance for the agent-based simulations. Our study also focuses on investigating and developing efficient and effective partitioning algorithms for crowd simulation. Generally, agents form into groups or follow flow patterns in crowd simulation. MASTER OF ENGINEERING (SCE) 2011-07-08T06:31:50Z 2011-07-08T06:31:50Z 2011 2011 Thesis Wang, Y. (2011). Partitioning algorithms for agent-based crowd simulation. Master’s thesis, Nanyang Technological University, Singapore. https://hdl.handle.net/10356/46252 10.32657/10356/46252 en 95 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Engineering::Computer science and engineering::Computing methodologies::Simulation and modeling
spellingShingle DRNTU::Engineering::Computer science and engineering::Computing methodologies::Simulation and modeling
Wang, Yongwei
Partitioning algorithms for agent-based crowd simulation
description 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. Generally, for an agent-based crowd simulation that aims to simulate a large number of agents under different scenarios, a proper partitioning algorithm is an essential factor to the performance of the system. However, selecting/developing an appropriate partitioning algorithm for a specific agent-based crowd simulation still remains an issue. One way is to implement distributed agent-based crowd simulations using multiple partitioning algorithms and to compare their performance. This requires multiple distributed simulation experiments, one for each partitioning algorithm. Considering the resources and the effort needed to perform multiple distributed simulation experiments, it is therefore preferred to predict the performance of partitioning algorithms instead. The research reported in this thesis focuses on investigating an effective and efficient approach to evaluate proposed partitioning algorithms for agent-based crowd simulations. A generic framework and an evaluation process are proposed to address the issue of selecting an appropriate partitioning algorithm by simulating the effect of a partitioning algorithm so as to predict its performance for the agent-based simulations. Our study also focuses on investigating and developing efficient and effective partitioning algorithms for crowd simulation. Generally, agents form into groups or follow flow patterns in crowd simulation.
author2 Cai Wentong
author_facet Cai Wentong
Wang, Yongwei
format Theses and Dissertations
author Wang, Yongwei
author_sort Wang, Yongwei
title Partitioning algorithms for agent-based crowd simulation
title_short Partitioning algorithms for agent-based crowd simulation
title_full Partitioning algorithms for agent-based crowd simulation
title_fullStr Partitioning algorithms for agent-based crowd simulation
title_full_unstemmed Partitioning algorithms for agent-based crowd simulation
title_sort partitioning algorithms for agent-based crowd simulation
publishDate 2011
url https://hdl.handle.net/10356/46252
_version_ 1759853331206897664