An Optimized Evacuation Plan for an Active-Shooter Situation Constrained by Network Capacity

• URL: http://arxiv.org/abs/2505.07830v1
• Date: Tue, 29 Apr 2025 18:06:00 GMT
• Title: An Optimized Evacuation Plan for an Active-Shooter Situation Constrained by Network Capacity
• Authors: Joseph Lavalle-Rivera, Aniirudh Ramesh, Subhadeep Chakraborty,
• Abstract summary: Emergency evacuation is intensely stressful, which along with the lack of verifiable real-time information may lead to fatal incorrect decisions.<n>We develop a multi-route routing optimization algorithm that determines multiple optimal safe routes for each evacuee.<n>Overall, our algorithm reduces the total casualties by 34.16% and 53.3%, compared to our previous routing algorithm without capacity constraints and an expert-advised routing strategy respectively.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A total of more than 3400 public shootings have occurred in the United States between 2016 and 2022. Among these, 25.1% of them took place in an educational institution, 29.4% at the workplace including office buildings, 19.6% in retail store locations, and 13.4% in restaurants and bars. During these critical scenarios, making the right decisions while evacuating can make the difference between life and death. However, emergency evacuation is intensely stressful, which along with the lack of verifiable real-time information may lead to fatal incorrect decisions. To tackle this problem, we developed a multi-route routing optimization algorithm that determines multiple optimal safe routes for each evacuee while accounting for available capacity along the route, thus reducing the threat of crowding and bottlenecking. Overall, our algorithm reduces the total casualties by 34.16% and 53.3%, compared to our previous routing algorithm without capacity constraints and an expert-advised routing strategy respectively. Further, our approach to reduce crowding resulted in an approximate 50% reduction in occupancy in key bottlenecking nodes compared to both of the other evacuation algorithms.

Related papers

• GREAT-EER: Graph Edge Attention Network for Emergency Evacuation Responses [3.854471865029609]
  Emergency situations that require the evacuation of urban areas can arise from man-made causes (e.g., terrorist attacks or industrial accidents) or natural disasters.<n>In this work, we identify and propose the Bus Evacuation Orienteering Problem (BEOP), an NP-hard optimization problem.<n>The purpose of bus-based evacuation is to reduce congestion and disorder that arises in purely car-focused evacuation scenarios.
  arXiv  Detail & Related papers  (2026-02-16T12:04:14Z)
• Towards Fairness-aware Crowd Management System and Surge Prevention in Smart Cities [20.737615140148673]
  We advocate for implementing a fair evacuation strategy following a surge event, which considers the diverse needs of all individuals. Secondly, we propose a preventative approach involving the adjustment of attraction locations and switching between stage performances. Our findings demonstrate the positive impact of the fair evacuation strategy on safety measures and inclusivity, which increases fairness by 41.8% on average.
  arXiv  Detail & Related papers  (2023-11-03T20:33:41Z)
• iPLAN: Intent-Aware Planning in Heterogeneous Traffic via Distributed Multi-Agent Reinforcement Learning [57.24340061741223]
  We introduce a distributed multi-agent reinforcement learning (MARL) algorithm that can predict trajectories and intents in dense and heterogeneous traffic scenarios. Our approach for intent-aware planning, iPLAN, allows agents to infer nearby drivers' intents solely from their local observations.
  arXiv  Detail & Related papers  (2023-06-09T20:12:02Z)
• Prioritizing emergency evacuations under compounding levels of uncertainty [34.71695000650056]
  We propose and analyze a decision support tool for pre-crisis training exercises for teams preparing for civilian evacuations. We use different classes of Markov decision processes (MDPs) to capture compounding levels of uncertainty. We show that accounting for the compounding levels of model uncertainty incurs added complexity without improvement in policy performance.
  arXiv  Detail & Related papers  (2022-09-30T21:01:05Z)
• Simulation-Assisted Optimization for Large-Scale Evacuation Planning with Congestion-Dependent Delays [12.57612445391585]
  We present MIP-LNS, a scalable optimization method that utilizes search with mathematical optimization. We also present the method MIP-LNS-SIM, where we combine agent-based simulation with MIP-LNS to estimate delays due to congestion. In addition, MIP-LNS-SIM has a significantly lower percent error in estimated evacuation completion time compared to MIP-LNS.
  arXiv  Detail & Related papers  (2022-09-04T05:30:51Z)
• Safe Online Bid Optimization with Return-On-Investment and Budget Constraints subject to Uncertainty [87.81197574939355]
  We study the nature of both the optimization and learning problems. We provide an algorithm, namely GCB, guaranteeing sublinear regret at the cost of a potentially linear number of constraints violations. More interestingly, we provide an algorithm, namely GCB_safe(psi,phi), guaranteeing both sublinear pseudo-regret and safety w.h.p. at the cost of accepting tolerances psi and phi.
  arXiv  Detail & Related papers  (2022-01-18T17:24:20Z)
• Optimizing Mixed Autonomy Traffic Flow With Decentralized Autonomous Vehicles and Multi-Agent RL [63.52264764099532]
  We study the ability of autonomous vehicles to improve the throughput of a bottleneck using a fully decentralized control scheme in a mixed autonomy setting. We apply multi-agent reinforcement algorithms to this problem and demonstrate that significant improvements in bottleneck throughput, from 20% at a 5% penetration rate to 33% at a 40% penetration rate, can be achieved.
  arXiv  Detail & Related papers  (2020-10-30T22:06:05Z)
• Excursion Search for Constrained Bayesian Optimization under a Limited Budget of Failures [62.41541049302712]
  We propose a novel decision maker grounded in control theory that controls the amount of risk we allow in the search as a function of a given budget of failures. Our algorithm uses the failures budget more efficiently in a variety of optimization experiments, and generally achieves lower regret, than state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-05-15T09:54:09Z)
• Congestion-aware Evacuation Routing using Augmented Reality Devices [96.68280427555808]
  We present a congestion-aware routing solution for indoor evacuation, which produces real-time individual-customized evacuation routes among multiple destinations. A population density map, obtained on-the-fly by aggregating locations of evacuees from user-end Augmented Reality (AR) devices, is used to model the congestion distribution inside a building.
  arXiv  Detail & Related papers  (2020-04-25T22:54:35Z)
• Reinforcement Learning Based Vehicle-cell Association Algorithm for Highly Mobile Millimeter Wave Communication [53.47785498477648]
  This paper investigates the problem of vehicle-cell association in millimeter wave (mmWave) communication networks. We first formulate the user state (VU) problem as a discrete non-vehicle association optimization problem. The proposed solution achieves up to 15% gains in terms sum of user complexity and 20% reduction in VUE compared to several baseline designs.
  arXiv  Detail & Related papers  (2020-01-22T08:51:05Z)
• Three Dimensional Route Planning for Multiple Unmanned Aerial Vehicles using Salp Swarm Algorithm [0.0]
  Route planning is a series of translation and rotational steps from a given start location to the destination goal location. The proposed approach improves the average cost and overall time by 1.25% and 6.035% respectively.
  arXiv  Detail & Related papers  (2019-11-24T12:36:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.