Priority Evacuation from a Disk Using Mobile Robots

05/09/2018
by   J. Czyzowicz, et al.
0

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) to reach and evacuate from an exit that is hidden on the perimeter of the disk in as little time as possible. The remaining n robots (servants) are there to facilitate the queen's objective and are not required to reach the hidden exit. We provide upper and lower bounds for the time required to evacuate the queen from a unit disk. Namely, we propose an algorithm specifying the trajectories of the robots which guarantees evacuation of the queen in time always better than 2 + 4(√(2)-1) π/n for n ≥ 4 servants. We also demonstrate that for n ≥ 4 servants the queen cannot be evacuated in time less than 2+π/n+2/n^2.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/07/2019

Chauffeuring a Crashed Robot from a Disk

Evacuation of robots from a disk has attained a lot of attention recentl...
research
05/25/2019

Evacuating Two Robots from a Disk: A Second Cut

We present an improved algorithm for the problem of evacuating two robot...
research
04/22/2019

Energy Consumption of Group Search on a Line

Consider two robots that start at the origin of the infinite line in sea...
research
10/02/2019

Optimal Patrolling of High Priority Segments While Visiting the Unit Interval with a Set of Mobile Robots

Consider a region that requires to be protected from unauthorized penetr...
research
12/07/2017

Gathering in the Plane of Location-Aware Robots in the Presence of Spies

A set of mobile robots (represented as points) is distributed in the Car...
research
08/05/2021

Evacuating from ell_p Unit Disks in the Wireless Model

The search-type problem of evacuating 2 robots in the wireless model fro...
research
12/25/2018

Evacuating Equilateral Triangles and Squares in the Face-to-Face Model

Consider k robots initially located at a point inside a region T. Each r...

Please sign up or login with your details

Forgot password? Click here to reset