Related papers: Improved Algorithms for the Evacuation Route Plann…
Evacuation shelters, which are urgently required during natural disasters, are designed to minimize the burden of evacuation on human survivors. However, the larger the scale of the disaster, the more costly it becomes to operate shelters.…
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…
A dynamic flow network consists of a directed graph, where nodes called sources represent locations of evacuees, and nodes called sinks represent locations of evacuation facilities. Each source and each sink are given supply representing…
A recently identified problem is that of finding an optimal investment plan for a transportation network, given that a disaster such as an earthquake may destroy links in the network. The aim is to strengthen key links to preserve the…
In dynamic flow networks, every vertex starts with items (flow) that need to be shipped to designated sinks. All edges have two associated quantities: length, the amount of time required for a particle to traverse the edge, and capacity,…
Evacuation plans have been historically used as a safety measure for the construction of buildings. The existing crowd simulators require fully-modeled 3D environments and enough time to prepare and simulate scenarios, where 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…
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…
Computer based models describing pedestrian behavior in an emergency evacuation play a vital role in the development of active strategies that minimize the evacuation time when a closed area must be evacuated. The reference model has a…
In this paper, we study discrete evacuation in networks, where agents know the network topology and designated exit nodes but do not know the number and initial positions of other agents. Each agent initially occupies a distinct node and…
Natural crises form a big threat on environment; these crises mean the loss of enterprises and individuals, and therefore losses in the sum total of community development. Management to these crises is required through a crisis management…
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…
Following [21, 23], the present work investigates a new relative entropy-regularized algorithm for solving the optimal transport on a graph problem within the randomized shortest paths formalism. More precisely, a unit flow is injected into…
As natural disasters become increasingly frequent, the need for efficient and equitable evacuation planning has become more critical. This paper proposes a data-driven, reinforcement learning-based framework to optimize bus-based…
In this paper, we discuss our approach and algorithmic framework for solving large-scale security constrained optimal power flow (SCOPF) problems. SCOPF is a mixed integer non-convex optimization problem that aims to obtain the minimum…
Human beings face threats because of unexpected happenings, which can be avoided through an adequate crisis evacuation plan, which is vital to stop wound and demise as its negative results. Consequently, different typical evacuation…
We develop a risk-aware Model Predictive Control (MPC) framework for large-scale vehicular evacuations. Traffic dynamics are captured by the Generalized Bathtub Model, which describes the network-wide trip completion rate by tracking the…
This paper introduces a graph-based, potential-guided method for path planning problems in unknown environments, where obstacles are unknown until the robots are in close proximity to the obstacle locations. Inspired by optimal transport…
How to free a road from vehicle traffic as efficiently as possible and in a given time, in order to allow for example the passage of emergency vehicles? We are interested in this question which we reformulate as an optimal control problem.…
Generating time-optimal, collision-free trajectories for autonomous mobile robots involves a fundamental trade-off between guaranteeing safety and managing computational complexity. State-of-the-art approaches formulate spline-based motion…