Minimization of Mean-CVaR Evacuation Time of a Crowd using Rescue Guides: a Scenario-based Approach

Anton von Schantz, H. Ehtamo, S. Hostikka
{"title":"Minimization of Mean-CVaR Evacuation Time of a Crowd using Rescue Guides:\n a Scenario-based Approach","authors":"Anton von Schantz, H. Ehtamo, S. Hostikka","doi":"10.17815/cd.2021.112","DOIUrl":null,"url":null,"abstract":"In case of a threat in a public space, the crowd in it should be moved\n to a shelter or evacuated without delays. Risk management and evacuation\n planning in public spaces should also take into account uncertainties in the\n traffic patterns of crowd flow. One way to account for the uncertainties is\n to make use of safety staff, or guides, that lead the crowd out of the\n building according to an evacuation plan. Nevertheless, solving the minimum\n time evacuation plan is a computationally demanding problem. In this paper,\n we model the evacuating crowd and guides as a multi-agent system with the\n social force model. To represent uncertainty, we construct probabilistic\n scenarios. The evacuation plan should work well both on average and also for\n the worst-performing scenarios. Thus, we formulate the problem as a\n bi-objective scenario optimization problem, where the mean and conditional\n value-at-risk (CVaR) of the evacuation time are objectives. A solution\n procedure combining numerical simulation and genetic algorithm is presented.\n We apply it to the evacuation of a fictional passenger terminal. In the\n mean-optimal solution, guides are assigned to lead the crowd to the nearest\n exits, whereas in the CVaR-optimal solution the focus is on solving the\n physical congestion occurring in the worst-case scenario. With one guide\n positioned behind each agent group near each exit, a plan that minimizes\n both objectives is obtained.","PeriodicalId":93276,"journal":{"name":"Collective dynamics","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Collective dynamics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17815/cd.2021.112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In case of a threat in a public space, the crowd in it should be moved to a shelter or evacuated without delays. Risk management and evacuation planning in public spaces should also take into account uncertainties in the traffic patterns of crowd flow. One way to account for the uncertainties is to make use of safety staff, or guides, that lead the crowd out of the building according to an evacuation plan. Nevertheless, solving the minimum time evacuation plan is a computationally demanding problem. In this paper, we model the evacuating crowd and guides as a multi-agent system with the social force model. To represent uncertainty, we construct probabilistic scenarios. The evacuation plan should work well both on average and also for the worst-performing scenarios. Thus, we formulate the problem as a bi-objective scenario optimization problem, where the mean and conditional value-at-risk (CVaR) of the evacuation time are objectives. A solution procedure combining numerical simulation and genetic algorithm is presented. We apply it to the evacuation of a fictional passenger terminal. In the mean-optimal solution, guides are assigned to lead the crowd to the nearest exits, whereas in the CVaR-optimal solution the focus is on solving the physical congestion occurring in the worst-case scenario. With one guide positioned behind each agent group near each exit, a plan that minimizes both objectives is obtained.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用救援指南最小化人群平均CVaR疏散时间:一种基于场景的方法
如果公共场所受到威胁,应立即将里面的人群转移到避难所或疏散。公共场所的风险管理和疏散规划也应考虑到人群流动交通模式的不确定性。解决不确定性的一种方法是使用安全人员或向导,根据疏散计划引导人群离开大楼。然而,解决最短时间疏散计划是一个计算量很高的问题。在本文中,我们用社会力量模型将疏散人群和导游建模为一个多智能体系统。为了表示不确定性,我们构建了概率场景。疏散计划在平均情况下以及在表现最差的情况下都应该运行良好。因此,我们将该问题公式化为双目标情景优化问题,其中疏散时间的平均值和条件风险值(CVaR)是目标。提出了一种将数值模拟与遗传算法相结合的求解方法。我们将其应用于一个虚构的客运码头的疏散。在平均最优解中,导游被指派带领人群前往最近的出口,而在CVaR最优解中的重点是解决最坏情况下发生的物理拥堵。在每个出口附近的每个代理组后面都有一个向导,可以获得一个最小化这两个目标的计划。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
审稿时长
23 weeks
期刊最新文献
Improving Pedestrian Dynamics Predictions Using Neighboring Factors Evaluation of Data Fitting Approaches for Speed/Flow Density Relationships Numerical and Theoretical Analysis of a New One-Dimensional Cellular Automaton Model for Bidirectional Flows Are Depth Field Cameras Preserving Anonymity? Pilot Study of Mental Simulation of People Movement During Evacuations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1