Advertisement

Optimal Torus Exploration by Oblivious Robots

  • Stéphane DevismesEmail author
  • Anissa Lamani
  • Franck Petit
  • Sébastien Tixeuil
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9466)

Abstract

We consider autonomous robots that are endowed with motion actuators and visibility sensors. The robots we consider are weak, i.e., they are anonymous, uniform, unable to explicitly communicate, and oblivious (they do not remember any of their past actions). In this paper, we propose an optimal (w.r.t. the number of robots) solution for the terminating exploration of torus-shaped networks by a team of k such robots in the SSYNC model.

In more details, we first show that it is impossible to explore any simple torus of arbitrary size with (strictly) less than four robots, even if the algorithm is probabilistic. If the algorithm is required to be deterministic, four robots are also insufficient. This negative result implies that the only way to obtain an optimal algorithm (w.r.t. the number of robots participating to the algorithm) is to make use of probabilities.

Then, we propose a probabilistic algorithm that uses four robots to explore all simple tori of size \(\ell \times L\), where \(7 \le \ell \le L\). Hence, in such tori, four robots are necessary and sufficient to solve the (probabilistic) terminating exploration. As a torus can be seen as a 2-dimensional ring, our result shows, perhaps surprisingly, that increasing the number of possible symmetries in the network (due to increasing dimensions) does not necessarily come at an extra cost w.r.t. the number of robots that are necessary to solve the problem.

Notes

Acknowledgment

Authors are grateful to François Bonnet for valuable discussions and suggestions.

References

  1. 1.
    Baldoni, R., Bonnet, F., Milani, A., Raynal, M.: Anonymous graph exploration without collision by mobile robots. Inf. Process. Lett. 109(2), 98–103 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    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) CrossRefGoogle Scholar
  3. 3.
    cois Bonnet, F., Défago, X., Petit, F., Potop-Butucaru, M., Tixeuil, S.: Discovering and assessing fine-grained metrics in robot networks protocols. In: 33rd IEEE SRDS Workshops, Workshop on Self-organization in Swarm of Robots, pp. 50–59 (2014)Google Scholar
  4. 4.
    Chalopin, J., Flocchini, P., Mans, B., Santoro, N.: Network exploration by silent and oblivious robots. In: WG, pp. 208–219 (2010)Google Scholar
  5. 5.
    D’Angelo, G., Di Stefano, G., Navarra, A., Nisse, N., Suchan, K.: A unified approach for different tasks on rings in robot-based computing systems. In: IPDPS Workshops, pp. 667–676 (2013)Google Scholar
  6. 6.
    D’Angelo, G., Navarra, A., Nisse, N.: Gathering and exclusive searching on rings under minimal assumptions. In: Chatterjee, M., Cao, J., Kothapalli, K., Rajsbaum, S. (eds.) ICDCN 2014. LNCS, vol. 8314, pp. 149–164. Springer, Heidelberg (2014) CrossRefGoogle Scholar
  7. 7.
    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) CrossRefGoogle Scholar
  8. 8.
    Devismes, S., Petit, F., Tixeuil, S.: Optimal probabilistic ring exploration by semi-synchronous oblivious robots. Theor. Comput. Sci. 498, 10–27 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: Remembering without memory: tree exploration by asynchronous oblivious robots. Theor. Comput. Sci. 411(14–15), 1583–1598 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: Computing without communicating: Ring exploration by asynchronous oblivious robots. Algorithmica 65(3), 562–583 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers (2012)Google Scholar
  12. 12.
    Haba, K., Izumi, T., Katayama, Y., Inuzuka, N., Wada, K.: On gathering problem in a ring for 2n autonomous mobile robots. In: SSS, p. Poster (2008)Google Scholar
  13. 13.
    Klasing, R., Kosowski, A., Navarra, A.: Taking advantage of symmetries: gathering of many asynchronous oblivious robots on a ring. Theor. Comput. Sci. 411(34–36), 3235–3246 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    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) CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Stéphane Devismes
    • 1
    Email author
  • Anissa Lamani
    • 2
  • Franck Petit
    • 3
    • 4
  • Sébastien Tixeuil
    • 3
    • 5
  1. 1.VERIMAG, Université Joseph FourierSaint-martin-d’hèresFrance
  2. 2.Kyushu UniversityFukuokaJapan
  3. 3.LIP6, UPMC Sorbonne UniversitésParisFrance
  4. 4.INRIA, Projet-Team REGALParisFrance
  5. 5.Institut Universitaire de FranceParisFrance

Personalised recommendations