Skip to main content
SpringerLink
Log in

Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

The paper presents general results about the gathering problem on graphs. A team of robots placed at the vertices of a graph, have to meet at some vertex and remain there. Robots operate in Look–Compute–Move cycles; in one cycle, a robot perceives the current configuration in terms of robots disposal (Look), decides whether to move towards one of its neighbors (Compute), and in the positive case makes the computed move (Move). Cycles are performed asynchronously for each robot. So far, the goal has been to provide feasible resolution algorithms with respect to different assumptions about the capabilities of the robots as well as the topology of the underlying graph. In this paper, we are interested in studying the quality of the resolution algorithms in terms of the minimum number of asynchronous moves performed by the robots to accomplish the gathering task. We provide results for general graphs that suggest resolution techniques and provide feasibility properties. Then, we apply the obtained theory on specific topologies like trees and rings. The resulting algorithms for trees and rings are then compared with the existing ones, hence showing how the old solutions can be far apart from the optimum.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Aho, A., Hopcroft, J., Ullman, J.: Data Structures and Algorithms. Addison Wesley, Boston (1983)

    MATH  Google Scholar 

  2. Bajaj, C.: The algebraic degree of geometric optimization problems. Discrete Comput. Geom. 3(1), 177-191 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bouzid, Z., Das, S., Tixeuil, S.: Gathering of mobile robots tolerating multiple crash faults. In: Proceedings of the The 33rd IEEE International Conference on Distributed Computing Systems (ICDCS) (2013)

  4. Buss, S.: Alogtime algorithms for tree isomorphism, comparison, and canonization. In: Kurt, Gödel Colloquium, volume 1289 of Lecture Notes in Computer Science, pp. 18-33. Springer (1997)

  5. Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: gathering. SIAM J. Comput. 41(4), 829-879 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cockayne, E.J., Melzak, Z.A.: Euclidean constructibility in graph-minimization problems. Math. Mag. 42(4), 206-208 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  7. D’Angelo, G., Di Stefano, G., Klasing, R., Navarra, A.: Gathering of robots on anonymous grids and trees without multiplicity detection. Theor. Comput. Sci. 610, 158-168 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  8. D’Angelo, G., Di Stefano, G., Navarra, A.: Search Theory: A Game Theoretic Perspective–Chapter 13: Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model. Springer, Berlin (2013)

    MATH  Google Scholar 

  9. D’Angelo, G., Di Stefano, G., Navarra, A.: Gathering on rings under the look-compute-move model. Distrib. Comput. 27(4), 255-285 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  10. D’Angelo, G., Di Stefano, G., Navarra, A.: Gathering six oblivious robots on anonymous symmetric rings. J. Discrete Algorithms 26, 16-27 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  11. 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 4(72), 1055-1096 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  12. D’Angelo, G., Navarra, A., Nisse, N.: A unified approach for gathering and exclusive searching on rings under weak assumptions. Distrib. Comput. (2016). doi:10.1007/s00446-016-0274-y

    MATH  Google Scholar 

  13. Devismes, S., Lamani, A., Petit, F., Raymond, P., Tixeuil, S.: Optimal grid exploration by asynchronous oblivious robots. In: Proceedings of the 14th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pp. 64-76 (2012)

  14. Di Stefano, G., Montanari, P., Navarra, A.: About ungatherability of oblivious and asynchronous robots on anonymous rings. In Proceedings of the 26th International Workshop on Combinatorial Algorithms (IWOCA’15), volume 9538 of Lecture Notes in Computer Science, pp. 136-147. Springer, (2016)

  15. Di Stefano, G., Navarra, A.: Gathering of oblivious robots on infinite grids with minimum traveled distance. Inf. Comput. to appear

  16. Di Stefano, G., Navarra, A.: Optimal gathering of oblivious robots in anonymous graphs. In: Proceedings of the 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO), volume 8179 of Lecture Notes in Computer Science, pp. 213-224 (2013)

  17. Eiselt, H.A., Marianov, V. (Eds.). Foundations of Location Analysis, volume 155 of International Series in Operations Research and Management Science. Springer, Berln (2011)

  18. Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by oblivious mobile robots. Synth. Lect. Distrib. Comput. Theory 3(2), 1-185 (2012)

    Article  MATH  Google Scholar 

  19. Kamei, S., Lamani, A., Ooshita, F., Tixeuil, S.: Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection. In: Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS), vol. 7464, pp. 542-553. Springer, Berlin (2012)

  20. Klasing, R., Kosowski, A., Navarra, A.: Taking advantage of symmetries: gathering of many asynchronous oblivious robots on a ring. Theor. Comput. Sci. 411, 3235-3246 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  21. Klasing, R., Markou, E., Pelc, A.: Gathering asynchronous oblivious mobile robots in a ring. Theor. Comput. Sci. 390, 27-39 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  22. Kranakis, E., Krizanc, D., Markou, E.: The mobile agent rendezvous problem in the ring. Synth. Lect. Distrib. Comput. Theory 1(1), 1-122 (2010)

    Article  Google Scholar 

  23. Kupitz, Y., Martini, H.: Geometric aspects of the generalized Fermat-Torricelli problem. Number 6 in Intuitive Geometry. Bolyai Society Math Studies (1997)

  24. Pelc, A.: Deterministic rendezvous in networks: a comprehensive survey. Networks 59(3), 331-347 (2012)

    Article  MathSciNet  Google Scholar 

  25. Prencipe, G.: Impossibility of gathering by a set of autonomous mobile robots. Theor. Comput. Sci. 384, 222-231 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  26. Santoro, N.: Design and Analysis of Distributed Algorithms. Wiley, Hoboken (2007)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria e Scienze dell’Informazione e Matematica, Università degli Studi dell’Aquila, Via Vetoio, 1, 6700, L’Aquila, Italy

    Gabriele Di Stefano

  2. Dipartimento di Matematica e Informatica, Università degli Studi di Perugia, Via Vanvitelli, 1, 06123, Perugia, Italy

    Alfredo Navarra

Authors
  1. Gabriele Di Stefano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alfredo Navarra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alfredo Navarra.

Additional information

Work partially supported by the European project “Geospatial based Environment for Optimisation Systems Addressing Fire Emergencies” (GEO-SAFE), Contract No. H2020-691161

Preliminary results concerning this paper appeared in Proceedings of the 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO) [16].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Di Stefano, G., Navarra, A. Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings. Distrib. Comput. 30, 75–86 (2017). https://doi.org/10.1007/s00446-016-0278-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-016-0278-7

Keywords

Search

Navigation