Evacuating robots via unknown exit in a disk

Consider k mobile robots inside a circular disk of unit radius. The robots are required to evacuate the disk through an unknown exit point situated on its boundary. We assume all robots having the same (unit) maximal speed and starting at the centre of the disk. The robots may communicate in order to inform themselves about the presence (and its position) or the absence of an exit. The goal is for all the robots to evacuate through the exit in minimum time.

We consider two models of communication between the robots: in non-wireless (or local) communication model robots exchange information only when simultaneously located at the same point, and wireless communication in which robots can communicate one another at any time.

We study the following question for different values of k: what is the optimal evacuation time for k robots? We provide algorithms and show lower bounds in both communication models for k = 2 and k = 3 thus indicating a difference in evacuation time between the two models. We also obtain almost-tight bounds on the asymptotic relation between evacuation time and team size, for large k. We show that in the local communication model, a team of k robots can always evacuate in time, 3 + whereas at least 3 + +O(k⁻²) time is sometimes required. In the wireless communication model, time 3+ (k^−4/3) always suffices to complete evacuation, and at least 3+ is sometimes required. This shows a clear separation between the local and the wireless communication models.