1 research outputs found
Chauffeuring a Crashed Robot from a Disk
Evacuation of robots from a disk has attained a lot of attention recently. We
visit the problem from the perspective of fault-tolerance. We consider two
robots trying to evacuate from a disk via a single hidden exit on the perimeter
of the disk. The robots communicate wirelessly. The robots are susceptible to
crash faults after which they stop moving and communicating. We design the
algorithms for tolerating one fault. The objective is to minimize the
worst-case time required to evacuate both the robots from the disk. When the
non-faulty robot chauffeurs the crashed robot, it takes amount
of time to travel unit distance. With this, we also provide a lower bound for
the evacuation time. Further, we evaluate the worst-case of the algorithms for
different values of and the crash time