Related papers: Evacuation of rectilinear polygons
Large-scale controlled evacuations require emergency services to select evacuation routes, decide departure times, and mobilize resources to issue orders, all under strict time constraints. Existing algorithms almost always allow for…
Let $G=(V,E)$ be a graph modelling a building or road network in which edges have-both travel times (lengths) and capacities associated with them. An edge's capacity is the number of people that can enter that edge in a unit of time. In…
Emergency evacuation is the process of movement of people away from the threat or actual occurrence of hazards such as natural disasters, terrorist attacks, fires and bombs. In this paper, we focus on evacuation from a building, but the…
We address the facility location problems on dynamic flow path networks. A dynamic flow path network consists of an undirected path with positive edge lengths, positive edge capacities, and positive vertex weights. A path can be considered…
In an emergency situation, the evacuation of a large crowd from a complex building can become slow or even dangerous without a working evacuation plan. The use of rescue guides that lead the crowd out of the building can improve the…
It is shown in this work that the average individual egress time and other performance indicators for egress of people from a building can be improved under certain circumstances if counterflow occurs. The circumstances include widely…
Uncertain dynamic obstacles, such as pedestrians or vehicles, pose a major challenge for optimal robot navigation with safety guarantees. Previous work on motion planning has followed two main strategies to provide a safe bound on an…
For safety reasons, it is important that the design of buildings and public facilities comply with the guidelines compiled in building codes.The latter are often premised on the concept of exit capacity, \emph{i.e.}, the mean pedestrian…
A dynamic path network is an undirected path with evacuees situated at each vertex. To evacuate the path, evacuees travel towards a designated sink (doorway) to exit. Each edge has a capacity, the number of evacuees that can enter the edge…
Improving emergency evacuations is a top priority in human safety and in pedestrian dynamics. In this paper, we use the social force model, in order to optimize high-anxiety pedestrian evacuations. We explore two architectural layouts, the…
We present a congestion-aware routing solution for indoor evacuation, which produces real-time individual-customized evacuation routes among multiple destinations while keeping tracks of all evacuees' locations. A population density map,…
We consider the problem of evacuating $k \geq 2$ mobile agents from a unit-sided equilateral triangle through an exit located at an unknown location on the perimeter of the triangle. The agents are initially located at the centroid of the…
In the fast evacuation problem, we study the path planning problem for two robots who want to minimize the worst-case evacuation time on the unit disk. The robots are initially placed at the center of the disk. In order to evacuate, they…
In zone-based evacuation planning, the region to evacuate is divided into zones and each zone must be assigned a path to safety and departure times along the path. Zone-based evacuations are highly desirable in practice because they allow…
Current regulations demand that at least two exits should be available for a safe evacuation during a panic situation. Although the "faster is slower" effect is expected to take place near the exits, the evacuation time will improve because…
The problem of finding the optimal placement of emergency exits in an indoor environment to facilitate the rapid and orderly evacuation of crowds is addressed in this work. A cellular-automaton model is used to simulate the behavior of…
Motivated by evacuation scenarios arising in extreme events such as flooding or forest fires, we study the problem of smoothly scheduling a set of paths in graphs where connections become impassable at some point in time. A schedule is…
This paper studies the fundamental problem of how to reroute $k$ unsplittable flows of a certain demand in a capacitated network from their current paths to their respective new paths, in a congestion-free manner and fast. This scheduling…
Sublinear time complexity is required by the massively parallel computation (MPC) model. Breaking dynamic programs into a set of sparse dynamic programs that can be divided, solved, and merged in sublinear time. The rectangle escape problem…
Exit paths in buildings are designed to minimise evacuation time when the building is at full capacity. We present an evacuation support system which does this regardless of the number of evacuees. The core concept is to even-out congestion…