Evacuating Two Robots from a Disk: A Second Cut

May 25, 2019 · The Ethereal · 🏛 Colloquium on Structural Information & Communication Complexity

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Yann Disser, Sören Schmitt arXiv ID 1905.10592 Category cs.DM: Discrete Mathematics Cross-listed cs.DS Citations 10 Venue Colloquium on Structural Information & Communication Complexity Last Checked 2 months ago
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].
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Discrete Mathematics