Circle Formation of Weak Mobile Robots
Yoann Dieudonne (LaRIA), Ouiddad Labbani-Igbida (CREA), Franck Petit, (LaRIA)
TL;DR
This paper proves a conjecture related to the behavior of weak mobile robots and introduces a deterministic protocol for forming a regular polygon in finite time.
Contribution
It confirms a conjecture by Défago & Konagaya and presents a new deterministic protocol for circle formation.
Findings
Proof of the conjecture by Défago & Konagaya
A finite-time deterministic circle formation protocol
Formal verification of the protocol's correctness
Abstract
In this paper we prove the conjecture of D\'{e}fago & Konagaya. Furthermore, we describe a deterministic protocol for forming a regular n-gon in finite time.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.