Abstract
This paper proposes a distributed algorithm for circle formation by multiple autonomous mobile robots. The vision of each robot is limited to a maximum distance. The robots do not store past actions or records of past data. They are anonymous and cannot be distinguished by their appearances. All robots agree on a common origin and axes. Earlier works report algorithms for gathering of multiple autonomous mobile robots in limited visibility considering the robots to be dimensionless or points. This paper models a robot as a unit disc (fat robot). The algorithm presented in this paper also assures that there is no collision among the robots. The robots do not share a common clock. They 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
Ando, H., Suzuki, I., Yamashita, M.: Distributed memoryless point convergence algorithm for mobile robots with limited visibility. Trans. on Robotics and Automation 15(5), 818–828 (1999)
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
Efrima, A., Peleg, D.: Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots. Theoretical Computer Science 410, 1355–1368 (2009)
Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of Asynchronous Oblivious Robots with Limited Visibility. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 247–258. Springer, Heidelberg (2001)
Gan Chaudhuri, S., Mukhopadhyaya, K.: Gathering Asynchronous Transparent Fat Robots. In: Janowski, T., Mohanty, H. (eds.) ICDCIT 2010. LNCS, vol. 5966, pp. 170–175. Springer, Heidelberg (2010)
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 WS 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)
Soussi, S., Défago, X., Yamashita, M.: Using Eventually Consistent Compasses to Gather Memory-Less Mobile Robots with Limited Visibility. ACM Transactions on Autonomous and Adaptive Systems 4(1), Article 9 (January 2009)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dutta, A., Gan Chaudhuri, S., Datta, S., Mukhopadhyaya, K. (2012). Circle Formation by Asynchronous Fat Robots with Limited Visibility. In: Ramanujam, R., Ramaswamy, S. (eds) Distributed Computing and Internet Technology. ICDCIT 2012. Lecture Notes in Computer Science, vol 7154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28073-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-28073-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28072-6
Online ISBN: 978-3-642-28073-3
eBook Packages: Computer ScienceComputer Science (R0)