HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Squaring the Circle with Weak Mobile Robots

Abstract : 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.
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download

https://hal.inria.fr/inria-00384093
Contributor : Franck Petit Connect in order to contact the contributor
Submitted on : Thursday, May 14, 2009 - 1:17:46 PM
Last modification on : Friday, October 8, 2021 - 4:28:06 PM
Long-term archiving on: : Thursday, June 10, 2010 - 9:24:09 PM

File

dieudonne-petit-algotel.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00384093, version 1

Citation

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

Share

Metrics

Record views

70

Files downloads

142