Optimized route for crowd evacuation

Sai Keung Wong, Yu Shuen Wang, Pao Kun Tang, Tsung Yu Tsai

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


An evacuation plan helps people move away from an area or a building. To achieve a fast evacuation, we present an algorithm to compute the optimal route for each local region. The idea is to reduce congestion and to maximize the number of evacuees arriving at exits in every time span. Our system considers the crowd distribution, exit locations, and corridor widths when determining the optimal routes. It also simulates crowd movements during the route optimization. To implement this idea, we expect that neighboring crowds who take different evacuation routes should arrive at respective exits nearly at the same time. If this is not the case, our system updates the routes of the slower crowds. Given that crowd simulation is non-linear, the optimal route is computed in an iterative manner. The process repeats until an optimal state is achieved. Experiment results demonstrate the feasibility of our evacuation route optimization.

Original languageEnglish
Title of host publicationPacific Graphics 2016 - 24th Pacific Conference on Computer Graphics and Applications, Short Papers Proceedings
EditorsEitan Grinspun, Bernd Bickel, Yoshinori Dobashi
PublisherIEEE Computer Society
Number of pages5
ISBN (Electronic)9783038680246
StatePublished - 2016
Event24th Pacific Conference on Computer Graphics and Applications, Pacific Graphics 2016 - Okinawa, Japan
Duration: 11 Oct 201614 Oct 2016

Publication series

NameProceedings - Pacific Conference on Computer Graphics and Applications
ISSN (Print)1550-4085


Conference24th Pacific Conference on Computer Graphics and Applications, Pacific Graphics 2016


Dive into the research topics of 'Optimized route for crowd evacuation'. Together they form a unique fingerprint.

Cite this