Uniform Circle Formation by Fat Robots

  • Moumita MondalEmail author
  • Sruti Gan Chaudhuri
  • Shankha Bhattacharya
Conference paper
Part of the Lecture Notes on Data Engineering and Communications Technologies book series (LNDECT, volume 26)


This paper proposes a distributed algorithm for forming a Uniform Circle by \(n>1\) autonomous, homogeneous disc shaped robots (also known as fat robots), where the robots are asked to place themselves equidistant apart on the periphery of a circle (not given in advanced). The robots operate by executing cycles of the states “sense-compute-move” simultaneously. They do not interact by message passing. The robots can recollect neither the past actions nor the sensed data from previous cycle. They are indistinguishable. The robots do not have any global coordinate system. They agree upon only Y-axis (South and North direction). This paper presents a collision free movement strategy for the robots in order to form a uniform circle.


Uniform circle formation Autonomous Oblivious Fat robots 


  1. 1.
    Czyzowicz, J., Gasieniec, L., Pelc, A.: Gathering few fat mobile robots in the plane. Theor. Comput. Sci. 410(6–7), 481–499 (2009)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Datta, S., Dutta, A., Gan Chaudhuri, S., Mukhopadhyaya, K.: Circle formation by asynchronous transparent fat robots. In: International Conference on Distributed Computing and Internet Technology. LNCS, vol. 7753, pp. 195–207 (2013)CrossRefGoogle Scholar
  3. 3.
    Debest, A.: emark about self-stabilizing systems. Commun. ACM 38(2), 115–117 (1995)Google Scholar
  4. 4.
    \(\acute{{\rm D}}\)efago, X., Konagaya, A.: Circle formation for oblivious anonymous mobile robots with no common sense of orientation. In: Proceedings 2nd International Annual Workshop on Principles of Mobile Computing, pp. 97–104 (2002)Google Scholar
  5. 5.
    \(\acute{{\rm D}}\)efago, X., Souissi, S.: Non uniform circle formation algorithm for oblivious mobile robots with convergence towards uniformity. Theor. Comput. Sci. 396(1–3), 97–112 (2008)Google Scholar
  6. 6.
    Dutta, A., Gan Chaudhuri, S., Datta, S., Mukhopadhyaya, K.: Circle formation by asynchronous fat robots with limited visibility. In: International Conference on Distributed Computing and Internet Technology, pp. 83–89. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  7. 7.
    Flocchini, P., Prencipe, G., Santoro, N., Viglietta, G.: Distributed computing by mobile robots solving the uniform circle formation problem. In: 18th International Conference on Principles of Distributed Systems (OPODIS). LNCS, vol. 8878, pp. 217–232 (2014)Google Scholar
  8. 8.
    Katreniak, B.: Biangular circle formation by asynchronous mobile robots. In: Pelc, A., Raynal, M. (eds.) SIROCCO. LNCS, vol. 3499, pp. 185–199 (2005)CrossRefGoogle Scholar
  9. 9.
    Mamino, M., Viglietta, G.: Square Formation by Asynchronous Oblivious Robots. arXiv:1605.06093v2 [cs.DC] 20 May 2016
  10. 10.
    Prencipe, G.: Instantaneous actions vs. full asynchronicity: controlling and coordinating a set of autonomous mobile robots. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, pp. 154–171. Springer, Heidelberg (2001)Google Scholar
  11. 11.
    Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 28(4), 1347–1363 (1999)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Sugihara, K., Suzuki, I.: Distributed algorithms for formation of geometric patterns with many mobile robots. J. Robot. Syst. 3(13), 127–139 (1996)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Moumita Mondal
    • 1
    Email author
  • Sruti Gan Chaudhuri
    • 1
  • Shankha Bhattacharya
    • 1
    • 2
  1. 1.Jadavpur UniversityKolkataIndia
  2. 2.Cognizant Solutions TechnologyKolkataIndia

Personalised recommendations