Evacuating Robots from a Disk Using Face-to-Face Communication
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, independently of each other, with maximum speed $1$. The robo...
Main Authors: | Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Lata Narayanan, Jarda Opatrny, Birgit Vogtenhuber |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2020-08-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/6198/pdf |
Similar Items
-
Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models
by: Konstantinos Georgiou, et al.
Published: (2019-06-01) -
A Multi-Objective Optimization Problem on Evacuating 2 Robots from the Disk in the Face-to-Face Model; Trade-Offs between Worst-Case and Average-Case Analysis
by: Huda Chuangpishit, et al.
Published: (2020-10-01) -
Impact of Locality on Location Aware Unit Disk Graphs
by: Evangelos Kranakis, et al.
Published: (2008-09-01) -
Robot Evacuation on a Line Assisted by a Bike
by: Khaled Jawhar, et al.
Published: (2021-01-01) -
Privacy Preserving Face Recognition in Cloud Robotics: A Comparative Study
by: Chiranjeevi Karri, et al.
Published: (2021-07-01)