|Type of publication:||Inproceedings|
|Title||Distributed Circle Formation for Anonymous Oblivious Robots|
|Bibtex cite ID||RACTI-RU1-2004-24|
|Booktitle ||3rd Workshop on Efficient and Experimental Algorithms (WEA 2004)|
|Series ||Lecture Notes in Computer Science|
|Year published ||2004|
|Publisher ||Springer Verlag|
|Location ||Angra dos Reis, Rio de Janeiro, Brazil|
|Keywords ||Mobile Robots|
This paper deals with systems of multiple mobile robots each of which observes the positions of the other robots and moves to a new position so that eventually the robots form a circle. In the model we study, the robots are anonymous and oblivious, in the sense that they cannot be distinguished by their appearance and do not have a common x-y coordinate system, while they are unable to remember past actions.
We propose a new distributed algorithm for circle formation on the plane. We prove that our algorithm is correct and provide an upper bound for its performance. In addition, we conduct an extensive and detailed comparative simulation experimental study with the DK algorithm described in . The results show that our algorithm is very simple and takes considerably less time to execute than algorithm DK.
|Topics ||=SEE CLASSIFICATION DIFFERENCE FROM OTHERS=
=SEE OWN CLASSIFICATION=|
wea04ichatz.pdf (main file) |