Skip to main content
SpringerLink
Log in

Computation Under Restricted Visibility

  • Chapter
  • First Online:
Distributed Computing by Mobile Entities

Part of the book series: Lecture Notes in Computer Science ((LNTCS,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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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. 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)

    Article  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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_7

    Chapter  Google Scholar 

  5. Bhagat, S., Chaudhuri, S.G., Mukhopadhyaya, K.: Gathering of opaque robots in 3D space, pp. 2:1–2:10 (2018)

    Google Scholar 

  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_4

    Chapter  Google Scholar 

  7. Cohen, R., Peleg, D.: Convergence of autonomous mobile robots with inaccurate sensors and movements. SIAM J. Comput. 38(1), 276–302 (2008)

    Article  MathSciNet  Google Scholar 

  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_15

    Chapter  Google Scholar 

  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. Czyzowicz, J., Gasieniec, L., Pelc, A.: Gathering few fat mobile robots in the plane. Theoret. Comput. Sci. 410(6–7), 481–499 (2009)

    Article  MathSciNet  Google Scholar 

  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. Di Luna, G.A., Flocchini, P., Poloni, F., Santoro, N., Viglietta, G.: The mutual visibility problem for oblivious robots (2014)

    Google Scholar 

  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_15

    Chapter  Google Scholar 

  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)

    Book  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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_7

    Chapter  Google Scholar 

  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_13

    Chapter  Google Scholar 

  19. Honorat, A., Potop-Butucaru, M.G., Tixeuil, S.: Gathering fat mobile robots with slim omnidirectional cameras. Theoret. Comput. Sci. 557, 1–27 (2014)

    Article  MathSciNet  Google Scholar 

  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. 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_27

    Chapter  Google Scholar 

  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_12

    Chapter  Google Scholar 

  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. Martínez, S.: Practical multiagent rendezvous through modified circumcenter algorithms. Automatica 45(9), 2010–2017 (2009)

    Article  MathSciNet  Google Scholar 

  25. Pagli, L., Prencipe, G., Viglietta, G.: Getting close without touching: near-gathering for autonomous mobile robots. Distrib. Comput. 28(5), 333–349 (2015)

    Article  MathSciNet  Google Scholar 

  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_23

    Chapter  Google Scholar 

  27. Prencipe, G.: Impossibility of gathering by a set of autonomous mobile robots. Theoret. Comput. Sci. 384(2–3), 222–231 (2007)

    Article  MathSciNet  Google Scholar 

  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)

    Article  Google Scholar 

  29. Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 28, 1347–1363 (1999)

    Article  MathSciNet  Google Scholar 

  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_17

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Statistical Institute, Kolkata, Kolkata, India

    Subhash Bhagat & Krishnendu Mukhopadhyaya

  2. Birla Institute of Technology Mesra, Lalpur Extension Centre, Ranchi, India

    Srabani Mukhopadhyaya

Authors
  1. Subhash Bhagat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Krishnendu Mukhopadhyaya
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Srabani Mukhopadhyaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Subhash Bhagat .

Editor information

Editors and Affiliations

  1. University of Ottawa, Ottawa, ON, Canada

    Paola Flocchini

  2. University of Pisa, Pisa, Italy

    Giuseppe Prencipe

  3. Carleton University, Ottawa, ON, Canada

    Nicola Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Bhagat, S., Mukhopadhyaya, K., Mukhopadhyaya, S. (2019). Computation Under Restricted Visibility. In: Flocchini, P., Prencipe, G., Santoro, N. (eds) Distributed Computing by Mobile Entities. Lecture Notes in Computer Science(), vol 11340. Springer, Cham. https://doi.org/10.1007/978-3-030-11072-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-11072-7_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-11071-0

  • Online ISBN: 978-3-030-11072-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation