Advertisement

Moving and Computing Models: Robots

  • Paola Flocchini
  • Giuseppe PrencipeEmail author
  • Nicola Santoro
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11340)

Abstract

This chapter provides a map of the current knowledge about the boundaries of Moving and Computing in Continuous Spaces, describing the “models” under which the results known so far have been obtained.

References

  1. 1.
    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).  https://doi.org/10.1007/978-3-642-11659-9_17CrossRefGoogle Scholar
  2. 2.
    Cohen, R., Peleg, D.: Convergence properties of the gravitational algorithm in asynchronous robot systems. SIAM J. Comput. 34, 1516–1528 (2005)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Cohen, R., Peleg, D.: Local spreading algorithms for autonomous robot systems. Theor. Comput. Sci. 399, 71–82 (2008)MathSciNetCrossRefGoogle Scholar
  4. 4.
    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
  5. 5.
    Czyzowicz, J., Gasieniec, L., Pelc, A.: Gathering few fat mobile robots in the plane. Theor. Comput. Sci. 410(6–7), 481–499 (2009)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Das, S., Flocchini, P., Prencipe, G., Santoro, N., Yamashita, M.: The power of lights: synchronizing asynchronous robots using visible bits. In: Proceedings of 32nd IEEE International Conference on Distributed Computing Systems (ICDCS), pp. 506–515 (2012)Google Scholar
  7. 7.
    Das, S., Flocchini, P., Prencipe, G., Santoro, N., Yamashita, M.: Autonomous mobile robots with lights. Theor. Comput. Sci. 609, 171–184 (2016)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Barrameda, E.M., Das, S., Santoro, N.: Deployment of asynchronous robotic sensors in unknown orthogonal environments. In: Fekete, S.P. (ed.) ALGOSENSORS 2008. LNCS, vol. 5389, pp. 125–140. Springer, Heidelberg (2008).  https://doi.org/10.1007/978-3-540-92862-1_11CrossRefGoogle Scholar
  9. 9.
    Défago, X., Gradinariu, M., Messika, S., Raipin-Parvédy, P.: Fault-tolerant and self-stabilizing mobile robots gathering. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 46–60. Springer, Heidelberg (2006).  https://doi.org/10.1007/11864219_4CrossRefGoogle Scholar
  10. 10.
    Dieudonné, Y., Dolev, S., Petit, F., Segal, M.: Deaf, dumb, and chatting asynchronous robots. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol. 5923, pp. 71–85. Springer, Heidelberg (2009).  https://doi.org/10.1007/978-3-642-10877-8_8CrossRefGoogle Scholar
  11. 11.
    Flocchini, P.: Computations by luminous robots, pp. 238–252 (2015)CrossRefGoogle Scholar
  12. 12.
    Flocchini, P., Santoro, N., Viglietta, G., Yamashita, M.: Rendezvous with constant memory. Theor. Comput. Sci. 621, 57–72 (2016)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Ganguli, A., Cortes, J., Bullo, F.: Visibility-based multi-agent deployment in orthogonal environments, pp. 3426–3431 (2007)Google Scholar
  14. 14.
    Hsiang, T.-R., Arkin, E.M., Bender, M.A., Fekete, S.P., Mitchell, J.S.B.: Algorithms for rapidly dispersing robot swarms in unknown environments. In: Boissonnat, J.-D., Burdick, J., Goldberg, K., Hutchinson, S. (eds.) Algorithmic Foundations of Robotics V. STAR, vol. 7, pp. 77–93. Springer, Heidelberg (2004).  https://doi.org/10.1007/978-3-540-45058-0_6CrossRefGoogle Scholar
  15. 15.
    Di Luna, G.A., Flocchini, P., Gan Chaudhuri, S., Santoro, N., Viglietta, G.: Robots with lights: overcoming obstructed visibility without colliding. In: Felber, P., Garg, V. (eds.) SSS 2014. LNCS, vol. 8756, pp. 150–164. Springer, Cham (2014).  https://doi.org/10.1007/978-3-319-11764-5_11CrossRefGoogle Scholar
  16. 16.
    Di Luna, G.A., Flocchini, P., Gan Chauduri, S., Poloni, F., Santoro, N., Viglietta, G.: Mutual visibility by luminous robots without collisions. Inf. Comput. 254, 392–418 (2017)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Sharma, G., Busch, C., Mukhopadhyay, S.: Bounds on mutual visibility algorithms (2015)Google Scholar
  18. 18.
    Sharma, G., Busch, C., Mukhopadhyay, S.: Brief announcement: complete visibility for oblivious robots in linear time. In: 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 325–327 (2017)Google Scholar
  19. 19.
    Sugihara, K., Suzuki, I.: Distributed algorithms for formation of geometric patterns with many mobile robots. J. Robotics Syst. 13, 127–139 (1996)CrossRefGoogle Scholar
  20. 20.
    Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots. In: Proceedings of \(3^{rd}\) International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 313–330 (1996)Google Scholar
  21. 21.
    Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 28(4), 1347–1363 (1999)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Paola Flocchini
    • 1
  • Giuseppe Prencipe
    • 2
    Email author
  • Nicola Santoro
    • 3
  1. 1.University of OttawaOttawaCanada
  2. 2.University of PisaPisaItaly
  3. 3.Carleton UniversityOttawaCanada

Personalised recommendations