Advertisement

Mutual Visibility for Asynchronous Robots

  • Subhash Bhagat
  • Sruti Gan Chaudhuri
  • Krishnendu MukhopadhyayaEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11639)

Abstract

This paper presents a study of the mutual visibility problem for a set of opaque asynchronous robots in the Euclidean plane. Due to opacity, if three robots lie on a line, the middle robot obstructs the visions of the two other robots. The mutual visibility problem requires the robots to coordinate their movements to form a configuration in which no three robots are collinear. This work presents a distributed algorithm which solves the mutual visibility problem for a set of \(n\ge 2\) asynchronous robots under the FState computational model. The proposed algorithm assumes 1 bit of persistent memory and the knowledge of n. The proposed solution works under the non-rigid movements of the robots and also provides collision free movements for the robots.

References

  1. 1.
    Flocchini, P., Santoro, N., Viglietta, G., Yamashita, M.: Rendezvous of two robots with constant memory. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 189–200. Springer, Cham (2013).  https://doi.org/10.1007/978-3-319-03578-9_16CrossRefGoogle Scholar
  2. 2.
    Di Luna, G.A., Flocchini, P., Poloni, F., Santoro, N., Viglietta, G.: The mutual visibility problem for oblivious robots. In: Proceedings of 26th Canadian Conference on Computational Geometry (CCCG) (2014)Google Scholar
  3. 3.
    Bhagat, S., Chaudhuri, S.G., Mukhopadhyaya, K.: Formation of general position by asynchronous mobile robots under one-axis agreement. In: Kaykobad, M., Petreschi, R. (eds.) WALCOM 2016. LNCS, vol. 9627, pp. 80–91. Springer, Cham (2016).  https://doi.org/10.1007/978-3-319-30139-6_7CrossRefGoogle Scholar
  4. 4.
    Agathangelou, C., Georgiou, C., Mavronicolas, M.: A distributed algorithm for gathering many fat mobile robots in the plane. In: Proceedings of the 32nd ACM Symposium on Principles of Distributed Computing (PODC), pp. 250–259 (2013)Google Scholar
  5. 5.
    Di Luna, G.A., Flocchini, P., Gan Chaudhuri, S., Poloni, F., Santoro, N., Viglietta, G.: Mutual visibility by luminous robots without collisions. Inf. Comput. 254, 392–418 (2017)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Bhagat, S., Mukhopadhyaya, K.: Optimum algorithm for mutual visibility among asynchronous robots with lights. In: Spirakis, P., Tsigas, P. (eds.) SSS 2017. LNCS, vol. 10616, pp. 341–355. Springer, Cham (2017).  https://doi.org/10.1007/978-3-319-69084-1_24CrossRefGoogle Scholar
  7. 7.
    Sharma, G., Vaidyanathan, R., Trahan, J.L.: Constant-time complete visibility for asynchronous robots with lights. In: Spirakis, P., Tsigas, P. (eds.) SSS 2017. LNCS, vol. 10616, pp. 265–281. Springer, Cham (2017).  https://doi.org/10.1007/978-3-319-69084-1_18CrossRefGoogle Scholar
  8. 8.
    Bhagat, S., Mukhopadhyaya, K.: Mutual visibility by robots with persistent memory. In: Proceedings of 13th International Frontiers of Algorithmics Workshop (FAW), pp. 144–155 (2019)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Subhash Bhagat
    • 1
  • Sruti Gan Chaudhuri
    • 2
  • Krishnendu Mukhopadhyaya
    • 3
    Email author
  1. 1.University of OttawaOttawaCanada
  2. 2.Jadavpur UniversityKolkataIndia
  3. 3.Indian Statistical InstituteKolkataIndia

Personalised recommendations