# Evacuating Two Robots from a Disk: A Second Cut

## TL;DR

This paper introduces an improved algorithm for evacuating two robots from a disk with an unknown exit, achieving faster evacuation times by adding a second interior detour, thus narrowing the gap between upper and lower bounds.

## Contribution

The paper presents a novel evacuation algorithm that incorporates a second interior detour, improving upon previous methods and reducing the evacuation time.

## Key findings

- Evacuation time improved to 5.6234 units
- Introduces a second interior detour for better efficiency
- Reduces gap between upper and lower bounds

## Abstract

We present an improved algorithm for the problem of evacuating two robots from the unit disk via an unknown exit on the boundary. Robots start at the center of the disk, move at unit speed, and can only communicate locally. Our algorithm improves previous results by Brandt et al. [CIAC'17] by introducing a second detour through the interior of the disk. This allows for an improved evacuation time of $5.6234$. The best known lower bound of $5.255$ was shown by Czyzowicz et al. [CIAC'15].