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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Suzuki, I., Yamashita, M.: Agreement on a common x-y coordinate system by a group of mobile robots. Intelligent Robots: Sensing, Modeling and Planning, 305–321 (1996)
Sugihara, K., Suzuki, I.: Distributed motion coordination of multiple mobile robots. In: IEEE International Symosium on Intelligence Control, pp. 138–143 (1990)
Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots - formation of geometric patterns. SIAM Journal of Computing 28(4), 1347–1363 (1999)
Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Hard tasks for weak robots: The role of common knowledge in pattern formation by autonomous mobile robots. In: Aggarwal, A.K., Pandu Rangan, C. (eds.) ISAAC 1999. LNCS, vol. 1741, pp. 93–102. Springer, Heidelberg (1999)
Prencipe, G.: Distributed Coordination of a Set of Autonomous Mobile Robots. PhD thesis, Dipartimento di Informatica, University of Pisa (2002)
Debest, X.A.: Remark about self-stabilizing systems. Communications of the ACM 38(2), 115–117 (1995)
Sugihara, K., Suzuki, I.: Distributed algorithms for formation of geometric patterns with many mobile robots. Journal of Robotic Systems 3(13), 127–139 (1996)
Defago, X., Konagaya, A.: Circle formation for oblivious anonymous mobile robots with no common sense of orientation. In: 2nd ACM International Annual Workshop on Principles of Mobile Computing (POMC 2002), pp. 97–104 (2002)
Chatzigiannakis, I., Markou, M., Nikoletseas, S.: Distributed circle formation for anonymous oblivious robots. In: 3rd Workshop on Efficient and Experimental Algorithms, pp. 159–174 (2004)
Samia, S., Défago, X., Katayama, T.: Convergence of a uniform circle formation algorithm for distributed autonomous mobile robots. In: Japan-Tunisia Workshop on Computer Systems and Information Technology (JT-CSIT 2004) (2004)
Katreniak, B.: Biangular circle formation by asynchronous mobile robots. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol. 3499, pp. 185–199. Springer, Heidelberg (2005)
Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)
Dieudonné, Y., Petit, F.: Circle formation of weak robots and Lyndon words. Technical Report TR 2006-05, LaRIA, CNRS FRE 2733, University of Picardie Jules Verne, Amiens, France (submitted for publication, 2006), http://hal.ccsd.cnrs.fr/ccsd-00069724
Flocchini, P., Prencipe, G., Santoro, N.: Self-deployment Algorithms for Mobile Sensors on a Ring. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2006. LNCS, vol. 4240, pp. 59–70. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dieudonné, Y., Labbani-Igbida, O., Petit, F. (2006). Circle Formation of Weak Mobile Robots. In: Datta, A.K., Gradinariu, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2006. Lecture Notes in Computer Science, vol 4280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49823-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-49823-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49018-0
Online ISBN: 978-3-540-49823-0
eBook Packages: Computer ScienceComputer Science (R0)