Wong, Sai-KeungWang, Yu-ShuenTang, Pao-KunTsai, Tsung-YuEitan Grinspun and Bernd Bickel and Yoshinori Dobashi2016-10-112016-10-112016978-3-03868-024-6-https://doi.org/10.2312/pg.20161327https://diglib.eg.org:443/handle/10.2312/pg20161327An 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.I.3.7 [Computer Graphics]Three Dimensional Graphics and RealismAnimation10.2312/pg.201613277-11