Introduction to Evacuation Problems
An evacuation problem is a search problem where more then one agent is looking for the target. The search terminates when all agents have found the target. In the wireless communication model, two agents can exchange information wirelessly. Therefore, as soon as one agent finds the target, the other agents learn the location of the target and they can immediately go to the target's location. In the face-to-face communication model, two agents can only exchange information when they stand at the same location at the same time.
In this talk I will present results from these two papers:
- Czyzowicz, Georgiou, Kranakis, Narayanan, Opatrny and Vogtenhuber. Evacuating Robots from a Disk Using Face-to-Face Communication. International Conference on Algorithms and Complexity (CIAC), Lecture Notes in Computer Science, Volume 9079: 140-152, 2015.
- Czyzowicz, Gasieniec, Gorry, Kranakis, Martin and Pajak. Evacuating Robots via Unknown Exit in a Disk. International Symposium on DIStributed Computing (DISC), Lecture Notes in Computer Science, Volume 8784: 122-136, 2014.