Related papers: God Save the Queen
We introduce and study a new search-type problem with ($n+1$)-robots on a disk. The searchers (robots) all start from the center of the disk, have unit speed, and can communicate wirelessly. The goal is for a distinguished robot (the queen)…
Two robots stand at the origin of the infinite line and are tasked with searching collaboratively for an exit at an unknown location on the line. They can travel at maximum speed $b$ and can change speed or direction at any time. The two…
There are $n\geq 3$ unit speed mobile agents placed at the origin of the infinite line. In as little time as possible, the agents must find and evacuate from an exit placed at an initially unknown location on the line. The agents can…
Assume that two robots are located at the centre of a unit disk. Their goal is to evacuate from the disk through an exit at an unknown location on the boundary of the disk. At any time the robots can move anywhere they choose on the disk,…
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…
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…
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…
This paper solves a pursuit-evasion problem in which a prince must find a princess who is constrained to move on each day from one vertex of a finite graph to another. Unlike the related and much studied `Cops and Robbers Game', the prince…
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…
Princess Kaguya is a heroine of a famous folk tale, as every Japanese knows. She was assumed to be confined in a bamboo cavity with cylindrical shape, and then fortuitously discovered by an elderly man in the forest. Here, we pose a…
To investigate the evacuation behaviors of pedestrians considering action of the guard and develop an effective evacuation strategy in the artificial attack, an extended floor field model was proposed. In this model, the assault on…
In this paper, the impact of escaping in couples on the evacuation dynamics has been investigated via experiments and modeling. Two sets of experiments have been implemented, in which pedestrians are asked to escape either in individual or…
The input to the \emph{Triangle Evacuation} problem is a triangle $ABC$. Given a starting point $S$ on the perimeter of the triangle, a feasible solution to the problem consists of two unit-speed trajectories of mobile agents that…
We consider evacuation of a group of $n \geq 2$ autonomous mobile agents (or robots) from an unknown exit on an infinite line. The agents are initially placed at the origin of the line and can move with any speed up to the maximum speed $1$…
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…
The angel game is played on $2$-dimensional infinite grid by $2$ players, the angel and the devil. In each turn, the angel of power $c \in \mathbb{N}$ moves from her current point $(x, y)$ to a point $(x', y')$ which $\max\{|x - x'|, |y -…
The stairwell is the main path for emergency evacuation of people in super high-rise buildings, so revealing the movement characteristics in the stairwell based on experimental data is the basis for controlling the evacuation process of…
Effective evacuation policies in emergency situations are important to save lives. To develop such policies, simulation models based on cellular automata have been used for crowd evacuation dynamics. In most previous studies of crowd…
How many mutually non-attacking queens can be placed on a d-dimensional chessboard of size n? The n-queens problem in higher dimensions is a generalization of the well-known n-queens problem. We provide a comprehensive overview of…
We present an improved algorithm for the problem of evacuating two robots from the unit disk via an unknown exit on the boundary. Robots start at the center of the disk, move at unit speed, and can only communicate locally. Our algorithm…