Squaring the Circle with Weak Mobile Robots - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Squaring the Circle with Weak Mobile Robots


We present two non-trivial deterministic protocols that solve the circle formation problem (CFP) with 4 and 3 robots, respectively. Both solutions do not require that each robot reaches its destination in one atomic step. This paper closes CFP for any number n (> 0) of robots in the semi-synchronous model.
Fichier principal
Vignette du fichier
dieudonne-petit-algotel.pdf (62.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00384093 , version 1 (14-05-2009)


  • HAL Id : inria-00384093 , version 1


Yoann Dieudonné, Franck Petit. Squaring the Circle with Weak Mobile Robots. AlgoTel, 2009, Carry-Le-Rouet, France. ⟨inria-00384093⟩
72 View
160 Download


Gmail Facebook Twitter LinkedIn More