Abstract
The Circle Formation Problem (CFP) consists in the design of a protocol insuring that starting from an initial arbitrary configuration, n robots eventually form a regular n-gon. In this paper, we present the first protocol which deterministically solves CFP in finite time for any number of robots, provided that n {4, 6, 8}. The proposed protocol works in the semi-synchronous model introduced in [1]. The robots are assumed to be uniform, anonymous, oblivious, and they share no kind of coordinate system nor common sense of direction. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Dieudonné, Y., Labbani-Igbida, O., & Petit, F. (2006). Circle formation of weak mobile robots. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4280 LNCS, pp. 262–275). Springer Verlag. https://doi.org/10.1007/978-3-540-49823-0_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
