2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/113552In 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.RoboticsCircle Formation of Weak Mobile Robotstext