Evacuation
Robots start at the centre of a disk (or a polygon) and must all leave through an exit at an unknown point of the boundary, as fast as possible.
Problem statement and measuresexpand
\(k\) unit-speed robots start together at the centre of a unit disk (or the centroid of a unit equilateral triangle or square). An exit lies at an unknown point of the boundary; a robot recognises it only on reaching it. Time is the worst case, over exit positions, of the time until the last robot reaches the exit (in priority evacuation, where one robot is the queen: until the queen does).
Measures: Evacuation time, worst-case time until the last robot (or the queen) reaches the exit; unit disk, unit speed.
Three wireless robots, one Byzantine
verifiedWith one Byzantine robot among three: between \(\approx 5.948\) and \(\approx 6.921\).
Assumed (added on the last edge are outlined)
Not assumed
Formal definitions of this setting
- Domain: disk
- The unit disk; robots start at its centre; the exit is a point of the boundary circle.
- Number of robots: three robots
- Three robots.
- Goal: all robots
- The task ends when the last robot reaches the exit.
- Exits: one exit
- One exit, at an unknown point of the boundary.
- Communication: wireless
- Wireless: every robot can send messages to every other robot instantly at any distance.
- Faults: Byzantine
- Up to \(f\) robots may lie: stay silent when they find the target, or claim to have found it where it is not.
- Speeds: equal speeds
- All robots move at most at unit speed.
- Randomness: deterministic
- Trajectories are fixed functions of the information received.
What is known
- three robots, at most one Byzantine
Results, in order of publication
Open questions
None recorded for this variant.
Notes
Byzantine evacuation with \(k\) robots and \(f\) faults is studied by Leonardos et al. 2023 and Behrouz et al. 2025; those papers were not read.
What carries over from neighbouring settings
Read off the order of assumptions, not checked case by case: results may carry extra assumptions (shown on their pages), and asynchronous time is measured in epochs.
Algorithms from weaker settings work here
No catalogued weaker setting.
Lower bounds from stronger settings hold here
Know a better result for this setting, or found a mistake? Suggest a result · Report an error. Accepted contributions are acknowledged.