Advertisement

Computation Under Restricted Visibility

  • Subhash Bhagat
  • Krishnendu Mukhopadhyaya
  • Srabani Mukhopadhyaya
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11340)

Abstract

In a swarm of robots, each robot has certain capabilities to perform their computations to achieve a global objective. One such capability is the sensing capability, known as vision. This enables a robot to sense the positions of the other robots in the system. The sensing capability may be restricted by two factors: (i) the sensing range and (ii) the opacity of the robots. The sensing range may be limited or unlimited and the robots may be transparent or opaque. When robots have limited sensing range, a robot can sense all the robots within a fixed radius around it. If three opaque robots are collinear, the middle robot obstructs the vision of the two other robots. This chapter deals with these two constraints on the vision of the robots. A model with such a constraint is referred to as the restricted visibility model. This chapter presents different geometric formation problems for swarm robots under the restricted visibility model.

Keywords

Swarm robots Limited visibility Opaque robots 

References

  1. 1.
    Agathangelou, C., Georgiou, C., Mavronicolas, M.: A distributed algorithm for gathering many fat mobile robots in the plane. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC, pp. 250–259 (2013)Google Scholar
  2. 2.
    Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Trans. Robot. Autom. 15(5), 818–828 (1999)CrossRefGoogle Scholar
  3. 3.
    Bhagat, S., Chaudhuri, S.G., Mukhopadhyaya, K.: Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement. J. Discret. Algorithms 36, 50–62 (2016)MathSciNetCrossRefGoogle Scholar
  4. 4.
    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
  5. 5.
    Bhagat, S., Chaudhuri, S.G., Mukhopadhyaya, K.: Gathering of opaque robots in 3D space, pp. 2:1–2:10 (2018)Google Scholar
  6. 6.
    Bolla, K., Kovacs, T., Fazekas, G.: Gathering of fat robots with limited visibility and without global navigation. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) EC/SIDE -2012. LNCS, vol. 7269, pp. 30–38. Springer, Heidelberg (2012).  https://doi.org/10.1007/978-3-642-29353-5_4CrossRefGoogle Scholar
  7. 7.
    Cohen, R., Peleg, D.: Convergence of autonomous mobile robots with inaccurate sensors and movements. SIAM J. Comput. 38(1), 276–302 (2008)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Cord-Landwehr, A., et al.: Collisionless gathering of robots with an extent. In: Černá, I., et al. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 178–189. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-18381-2_15CrossRefGoogle Scholar
  9. 9.
    Cord-Landwehr, A., Fischer, M., Jung, D., Meyer auf der Heide, F.: Asymptotically optimal gathering on a grid. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, pp. 301–312 (2016)Google Scholar
  10. 10.
    Czyzowicz, J., Gasieniec, L., Pelc, A.: Gathering few fat mobile robots in the plane. Theoret. Comput. Sci. 410(6–7), 481–499 (2009)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Degener, B., Kempkes, B., Langner, T., Meyer auf der Heide, F., Pietrzyk, P., Wattenhofer, R.: A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, pp. 139–148 (2011)Google Scholar
  12. 12.
    Di Luna, G.A., Flocchini, P., Poloni, F., Santoro, N., Viglietta, G.: The mutual visibility problem for oblivious robots (2014)Google Scholar
  13. 13.
    Di Stefano, G., Navarra, A.: Optimal gathering on infinite grids. In: Felber, P., Garg, V. (eds.) SSS 2014. LNCS, vol. 8756, pp. 211–225. Springer, Cham (2014).  https://doi.org/10.1007/978-3-319-11764-5_15CrossRefGoogle Scholar
  14. 14.
    Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, San Rafael (2012)CrossRefGoogle Scholar
  15. 15.
    Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theoret. Comput. Sci. 337(1–3), 147–168 (2005)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theoret. Comput. Sci. 407(1–3), 412–447 (2008)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Gordon, N., Elor, Y., Bruckstein, A.M.: Gathering multiple robotic agents with crude distance sensing capabilities. In: Dorigo, M., Birattari, M., Blum, C., Clerc, M., Stützle, T., Winfield, A.F.T. (eds.) ANTS 2008. LNCS, vol. 5217, pp. 72–83. Springer, Heidelberg (2008).  https://doi.org/10.1007/978-3-540-87527-7_7CrossRefGoogle Scholar
  18. 18.
    Gordon, N., Wagner, I.A., Bruckstein, A.M.: Gathering multiple robotic a(ge)nts with limited sensing capabilities. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 142–153. Springer, Heidelberg (2004).  https://doi.org/10.1007/978-3-540-28646-2_13CrossRefGoogle Scholar
  19. 19.
    Honorat, A., Potop-Butucaru, M.G., Tixeuil, S.: Gathering fat mobile robots with slim omnidirectional cameras. Theoret. Comput. Sci. 557, 1–27 (2014)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Izumi, T., Kawabata, Y., Kitamura, N.: Toward time-optimal gathering for limited visibility model (2015). https://sites.google.com/site/micromacfrance/abstract-tasuke
  21. 21.
    Izumi, T., Potop-Butucaru, M.G., Tixeuil, S.: Connectivity-preserving scattering of mobile robots with limited visibility. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol. 6366, pp. 319–331. Springer, Heidelberg (2010).  https://doi.org/10.1007/978-3-642-16023-3_27CrossRefGoogle Scholar
  22. 22.
    Katreniak, B.: Convergence with limited visibility by asynchronous mobile robots. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol. 6796, pp. 125–137. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-22212-2_12CrossRefGoogle Scholar
  23. 23.
    Kempkes, B., Kling, P., Meyer auf der Heide, F.: Optimal and competitive runtime bounds for continuous, local gathering of mobile robots. In: Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, pp. 18–26 (2012)Google Scholar
  24. 24.
    Martínez, S.: Practical multiagent rendezvous through modified circumcenter algorithms. Automatica 45(9), 2010–2017 (2009)MathSciNetCrossRefGoogle Scholar
  25. 25.
    Pagli, L., Prencipe, G., Viglietta, G.: Getting close without touching: near-gathering for autonomous mobile robots. Distrib. Comput. 28(5), 333–349 (2015)MathSciNetCrossRefGoogle Scholar
  26. 26.
    Poudel, P., Sharma, G.: Universally optimal gathering under limited visibility. In: Spirakis, P., Tsigas, P. (eds.) SSS 2017. LNCS, vol. 10616, pp. 323–340. Springer, Cham (2017).  https://doi.org/10.1007/978-3-319-69084-1_23CrossRefGoogle Scholar
  27. 27.
    Prencipe, G.: Impossibility of gathering by a set of autonomous mobile robots. Theoret. Comput. Sci. 384(2–3), 222–231 (2007)MathSciNetCrossRefGoogle Scholar
  28. 28.
    Souissi, S., Défago, X., Yamashita, M.: Using eventually consistent compasses to gather memory-less mobile robots with limited visibility. ACM Trans. Auton. Adapt. Syst. 4(1), 9:1–9:27 (2009)CrossRefGoogle Scholar
  29. 29.
    Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 28, 1347–1363 (1999)MathSciNetCrossRefGoogle Scholar
  30. 30.
    Yamauchi, Y., Yamashita, M.: Pattern formation by mobile robots with limited visibility. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 201–212. Springer, Cham (2013).  https://doi.org/10.1007/978-3-319-03578-9_17CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Subhash Bhagat
    • 1
  • Krishnendu Mukhopadhyaya
    • 1
  • Srabani Mukhopadhyaya
    • 2
  1. 1.Indian Statistical Institute, KolkataKolkataIndia
  2. 2.Birla Institute of Technology Mesra, Lalpur Extension CentreRanchiIndia

Personalised recommendations