Indoor evacuation planning using a limited number of sensors

Ashok Nallagalva, N. L. Sarda, A. Bhushan
{"title":"Indoor evacuation planning using a limited number of sensors","authors":"Ashok Nallagalva, N. L. Sarda, A. Bhushan","doi":"10.1145/2835596.2835597","DOIUrl":null,"url":null,"abstract":"This paper focuses on indoor evacuation path planning problem where the objective is to find evacuation paths for each evacuee such that the evacuation egress time is minimized. Since paths are dependent on the distribution of evacuees, initial positions of evacuees are required to find optimal paths during emergency. Instrumenting a building to obtain initial positions and count of people in a building is very challenging (and costly), and hence evacuation plans are prepared for a few expected distributions. Generally, a standard plan based on a predominant distribution of evacuees is posted on the walls inside an indoor facility for people to follow. However, the actual distribution may be another distribution from among the possible distributions. In this work, we consider the problem of finding the distribution that prevails at the evacuation time so that evacuees can be guided to follow the optimal paths (leading to minimum time) rather than following the standard plan. We propose a cost-effective solution to this problem by observing movement of people within a specified time period, labeled distribution detection window, using minimum number of optimally located sensors. This is in contrast to existing approaches which assume that unlimited sensors are available to instantaneously obtain the exact distribution of evacuees at the time of incidence. To our knowledge this paper presents the first formal evacuation planning approach that enables the user to optimally tradeoff the delay in distribution detection with the cost of the deployed sensor network used to obtain this distribution. Our approach is based on the popular heuristic denoted as Capacity Constrained Routing Planner (CCRP). Our approach is illustrated by a set of experiments on two case studies. The results demonstrate that evacuation plans obtained using minimum number of sensors are better than the standard plans and are comparable to evacuation plans computed using unlimited number of sensors.","PeriodicalId":323570,"journal":{"name":"Proceedings of the 1st ACM SIGSPATIAL International Workshop on the Use of GIS in Emergency Management","volume":"171 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1st ACM SIGSPATIAL International Workshop on the Use of GIS in Emergency Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2835596.2835597","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper focuses on indoor evacuation path planning problem where the objective is to find evacuation paths for each evacuee such that the evacuation egress time is minimized. Since paths are dependent on the distribution of evacuees, initial positions of evacuees are required to find optimal paths during emergency. Instrumenting a building to obtain initial positions and count of people in a building is very challenging (and costly), and hence evacuation plans are prepared for a few expected distributions. Generally, a standard plan based on a predominant distribution of evacuees is posted on the walls inside an indoor facility for people to follow. However, the actual distribution may be another distribution from among the possible distributions. In this work, we consider the problem of finding the distribution that prevails at the evacuation time so that evacuees can be guided to follow the optimal paths (leading to minimum time) rather than following the standard plan. We propose a cost-effective solution to this problem by observing movement of people within a specified time period, labeled distribution detection window, using minimum number of optimally located sensors. This is in contrast to existing approaches which assume that unlimited sensors are available to instantaneously obtain the exact distribution of evacuees at the time of incidence. To our knowledge this paper presents the first formal evacuation planning approach that enables the user to optimally tradeoff the delay in distribution detection with the cost of the deployed sensor network used to obtain this distribution. Our approach is based on the popular heuristic denoted as Capacity Constrained Routing Planner (CCRP). Our approach is illustrated by a set of experiments on two case studies. The results demonstrate that evacuation plans obtained using minimum number of sensors are better than the standard plans and are comparable to evacuation plans computed using unlimited number of sensors.
利用有限数量的传感器进行室内疏散规划
本文主要研究室内疏散路径规划问题,其目标是为每个疏散人员找到疏散路径,使疏散出口时间最小。由于路径依赖于疏散人员的分布,因此在紧急情况下需要疏散人员的初始位置来找到最优路径。对建筑物进行仪器测量以获得建筑物内的初始位置和人数是非常具有挑战性的(而且成本很高),因此要为一些预期的分布准备疏散计划。一般来说,一个基于疏散人员主要分布的标准计划被张贴在室内设施的墙上,供人们遵循。然而,实际的分布可能是可能分布中的另一个分布。在这项工作中,我们考虑的问题是找到疏散时间内普遍存在的分布,以便引导疏散人员遵循最优路径(导致最短时间),而不是遵循标准计划。我们提出了一种经济有效的解决方案,即在指定时间段内观察人员的运动,标记分布检测窗口,使用最少数量的最佳定位传感器。这与现有的方法相反,现有的方法假设有无限的传感器可用,以便在事件发生时立即获得撤离人员的确切分布。据我们所知,本文提出了第一个正式的疏散规划方法,使用户能够最优地权衡分布检测的延迟与用于获得该分布的部署传感器网络的成本。我们的方法是基于流行的启发式算法,称为容量约束路由规划(CCRP)。我们的方法是通过两个案例研究的一组实验来说明的。结果表明,使用最小传感器数量得到的疏散方案优于标准方案,与使用无限传感器数量计算的疏散方案具有可比性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信