Advertisement

Oblivious Robots on Graphs: Exploration

  • David Ilcinkas
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11340)

Abstract

This chapter focuses on the problem of exploring a graph by a team of mobile robots endowed with vision. More precisely, we consider here mobile robots operating under the Look-Compute-Move paradigm in discrete environments modeled as graphs. The goal for these robots is to explore the graph in which they are, that is to visit all vertices of the graph.

Keywords

Oblivious robots Graph exploration Terminating exploration Exclusive perpetual exploration 

References

  1. 1.
    Balabonski, T., Courtieu, P., Pelle, R., Rieg, L., Tixeuil, S.,Urbain, X.: Continuous vs. discrete asynchronous moves: a certified approach for mobile robots. Research report, Sorbonne Université, CNRS, Laboratoire d’Informatique de Paris 6, LIP6, F-75005 Paris, France (2018). See also SSS 2018 proceedings. https://hal.sorbonne-universite.fr/hal-01762962
  2. 2.
    Balabonski, T., Pelle, R., Rieg, L., Tixeuil, S.: A foundational framework for certified impossibility results with mobile robots on graphs. In: Proceedings of the 19th International Conference on Distributed Computing and Networking, ICDCN 2018, pp. 5:1–5:10. ACM, New York (2018). https://doi.acm.org/10.1145/3154273.3154321
  3. 3.
    Baldoni, R., Bonnet, F., Milani, A., Raynal, M.: Anonymous graph exploration without collision by mobile robots. Inf. Process. Lett. 109(2), 98–103 (2008).  https://doi.org/10.1016/j.ipl.2008.08.011MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Baldoni, R., Bonnet, F., Milani, A., Raynal, M.: On the solvability of anonymous partial grids exploration by mobile robots. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 428–445. Springer, Heidelberg (2008).  https://doi.org/10.1007/978-3-540-92221-6_27CrossRefGoogle Scholar
  5. 5.
    Blin, L., Milani, A., Potop-Butucaru, M., Tixeuil, S.: Exclusive perpetual ring exploration without chirality. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 312–327. Springer, Heidelberg (2010).  https://doi.org/10.1007/978-3-642-15763-9_29CrossRefGoogle Scholar
  6. 6.
    Bonnet, F., Defago, X.: Exploration and surveillance in multi-robots networks. In: 2011 Second International Conference on Networking and Computing, pp. 342–344, November 2011.  https://doi.org/10.1109/ICNC.2011.66
  7. 7.
    Bonnet, F., Défago, X., Petit, F., Potop-Butucaru, M., Tixeuil,S.: Discovering and assessing fine-grained metrics in robot networks protocols. In: 2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops, pp. 50–59, October 2014.  https://doi.org/10.1109/SRDSW.2014.34
  8. 8.
    Bonnet, F., Milani, A., Potop-Butucaru, M., Tixeuil, S.: Asynchronous exclusive perpetual grid exploration without sense of direction. In: Fernàndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 251–265. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-25873-2_18CrossRefGoogle Scholar
  9. 9.
    Bérard, B., Lafourcade, P., Millet, L., Potop-Butucaru, M., Thierry-Mieg, Y., Tixeuil, S.: Formal verification of mobile robot protocols. Distrib. Comput. 29(6), 459–487 (2016).  https://doi.org/10.1007/s00446-016-0271-1MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Chalopin, J., Flocchini, P., Mans, B., Santoro, N.: Network exploration by silent and oblivious robots. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 208–219. Springer, Heidelberg (2010).  https://doi.org/10.1007/978-3-642-16926-7_20CrossRefGoogle Scholar
  11. 11.
    Datta, A.K., Lamani, A., Larmore, L.L., Petit, F.: Ring exploration by oblivious agents with local vision. In: 2013 IEEE 33rd International Conference on Distributed Computing Systems, pp. 347–356, July 2013.  https://doi.org/10.1109/ICDCS.2013.55
  12. 12.
    Datta, A.K., Lamani, A., Larmore, L.L., Petit, F.: Enabling ring exploration with myopic oblivious robots. In: 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, pp. 490–499, May 2015.  https://doi.org/10.1109/IPDPSW.2015.137
  13. 13.
    Devismes, S., Lamani, A., Petit, F., Raymond, P., Tixeuil, S.: Optimal grid exploration by asynchronous oblivious robots. In: Richa, A.W., Scheideler, C. (eds.) SSS 2012. LNCS, vol. 7596, pp. 64–76. Springer, Heidelberg (2012).  https://doi.org/10.1007/978-3-642-33536-5_7CrossRefGoogle Scholar
  14. 14.
    Devismes, S., Lamani, A., Petit, F., Tixeuil, S.: Optimal torus exploration by oblivious robots. In: Bouajjani, A., Fauconnier, H. (eds.) NETYS 2015. LNCS, vol. 9466, pp. 183–199. Springer, Cham (2015).  https://doi.org/10.1007/978-3-319-26850-7_13CrossRefGoogle Scholar
  15. 15.
    Devismes, S., Petit, F., Tixeuil, S.: Optimal probabilistic ring exploration by semi-synchronous oblivious robots. Theor. Comput. Sci. 498, 10–27 (2013).  https://doi.org/10.1016/j.tcs.2013.05.031MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Doan, H.T.T., Bonnet, F., Ogata, K.: Model checking of a mobile robots perpetual exploration algorithm. In: Liu, S., Duan, Z., Tian, C., Nagoya, F. (eds.) SOFL+MSVL 2016. LNCS, vol. 10189, pp. 201–219. Springer, Cham (2017).  https://doi.org/10.1007/978-3-319-57708-1_12CrossRefGoogle Scholar
  17. 17.
    D’Angelo, G., Di Stefano, G., Navarra, A., Nisse, N., Suchan, K.: Computing on rings by oblivious robots: a unified approach for different tasks. Algorithmica 72(4), 1055–1096 (2015).  https://doi.org/10.1007/s00453-014-9892-6MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: Remembering without memory: tree exploration by asynchronous oblivious robots. Theor. Comput. Sci. 411(14), 1583–1598 (2010).  https://doi.org/10.1016/j.tcs.2010.01.007MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: How many oblivious robot scan explore a line. Inf. Process. Lett. 111(20), 1027–1031 (2011).  https://doi.org/10.1016/j.ipl.2011.07.018CrossRefzbMATHGoogle Scholar
  20. 20.
    Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: Computing without communicating: ring exploration by asynchronous oblivious robots. Algorithmica 65(3), 562–583 (2013).  https://doi.org/10.1007/s00453-011-9611-5MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Lamani, A., Potop-Butucaru, M.G., Tixeuil, S.: Optimal deterministic ring exploration with oblivious asynchronous robots. In: Patt-Shamir, B., Ekim, T. (eds.) SIROCCO 2010. LNCS, vol. 6058, pp. 183–196. Springer, Heidelberg (2010).  https://doi.org/10.1007/978-3-642-13284-1_15. arXiv:0910.0832 [cs]CrossRefGoogle Scholar
  22. 22.
    Ooshita, F., Tixeuil, S.: Ring exploration with myopic luminous robots [cs], May 2018. See also SSS 2018 proceedings. arXiv:1805.03965
  23. 23.
    Potop-Butucaru, M., Raynal, M., Tixeuil, S.: Distributed computing with mobile robots: an introductory survey. In: 2011 14th International Conference on Network-Based Information Systems, pp. 318–324, September 2011.  https://doi.org/10.1109/NBiS.2011.55

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.CNRS, LaBRI, Univ. BordeauxTalenceFrance

Personalised recommendations