| HAL-Inria | Publications, software ... of Inria's scientists |
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.
Cited literature [4 references]
https://hal.inria.fr/inria-00384093
Contributor : Franck Petit <>
Submitted on : Thursday, May 14, 2009 - 1:17:46 PM
Last modification on : Monday, April 19, 2021 - 8:56:32 AM
Long-term archiving on: : Thursday, June 10, 2010 - 9:24:09 PM
Contributor : Franck Petit <>
Submitted on : Thursday, May 14, 2009 - 1:17:46 PM
Last modification on : Monday, April 19, 2021 - 8:56:32 AM
Long-term archiving on: : Thursday, June 10, 2010 - 9:24:09 PM
File
dieudonne-petit-algotel.pdf
Files produced by the author(s)