Circle Formation of Weak Mobile Robots
In this paper we prove the conjecture of Défago & Konagaya. Furthermore, we describe a deterministic protocol for forming a regular n-gon in finite time.
cs.RO↗
arXiv subjects
Publications and source records attributed to Yoann Dieudonne.
In this paper we prove the conjecture of Défago & Konagaya. Furthermore, we describe a deterministic protocol for forming a regular n-gon in finite time.