Abstract
This paper proposes a distributed algorithm for circle formation by a system of mobile robots. Each robot observes the positions of other robots and moves to a new position. Eventually they form a circle. The robots do not store past actions. They are anonymous and cannot be distinguished by their appearance and do not have a common coordinate system (origin and axis) and chirality (common handedness). Most of the earlier works assume the robots to be dimensionless (points). In this paper a robot is represented as a unit disc (fat robot). The robots are assumed to be transparent in order to achieve full visibility. However, a robot is considered as a physical obstacle for another robot. The robots execute the algorithm asynchronously.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Czyzowicz, J., Gasieniec, L., Pelc, A.: Gathering Few Fat Mobile Robots in the Plane. Theoretical Computer Science 410, 481–499 (2009)
Défago, X., Konagaya, A.: Circle Formation for Oblivious Anonymous Mobile Robots with no Common Sense of Orientation. In: Proc. 2nd International Annual Workshop on Principles of Mobile Computing, pp. 97–104 (2002)
Défago, X., Souissi, S.: Non Uniform Circle Formation Algorithm for Oblivious Mobile Robots with Convergence Towards Uniformity. Theoretical Computer Science 396(1-3), 97–112
Dutta, A., Gan Chaudhuri, S., Datta, S., Mukhopadhyaya, K.: Circle Formation by Asynchronous Fat Robots with Limited Visibility. In: Ramanujam, R., Ramaswamy, S. (eds.) ICDCIT 2012. LNCS, vol. 7154, pp. 83–93. Springer, Heidelberg (2012)
Efrima, A., Peleg, D.: Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots. Theoretical Computer Science 410, 1355–1368 (2009)
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)
Payton, D., Estkowski, R., Howard, M.: Pheromone Robotics and the Logic of Virtual Pheromones. In: Şahin, E., Spears, W.M. (eds.) Swarm Robotics 2004. LNCS, vol. 3342, pp. 45–57. Springer, Heidelberg (2005)
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)
Sugihara, K., Suzuki, I.: Distributed Motion Coordination of Multiple Mobile Robots. In: Proc. IEEE International Symposium on Intelligent 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)
Uny Cao, Y., Fukunaga, A.S., Kahng, A.B.: Cooperative Mobile Robotics: Antecedents and Directions. Autonomous Robots 4, 1–23 (1997)
Weisstein, E.W.: Reuleaux Triangle, From MathWorld- A Wolfram Web Resource, http://mathworld.com/ReuleauxTriangle.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Datta, S., Dutta, A., Gan Chaudhuri, S., Mukhopadhyaya, K. (2013). Circle Formation by Asynchronous Transparent Fat Robots. In: Hota, C., Srimani, P.K. (eds) Distributed Computing and Internet Technology. ICDCIT 2013. Lecture Notes in Computer Science, vol 7753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36071-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-36071-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36070-1
Online ISBN: 978-3-642-36071-8
eBook Packages: Computer ScienceComputer Science (R0)