Advertisement

Compacting and Grouping Mobile Agents on Dynamic Rings

  • Shantanu DasEmail author
  • Giuseppe Di Luna
  • Linda Pagli
  • Giuseppe Prencipe
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11436)

Abstract

We consider computations by a distributed team of autonomous mobile agents that move on an unoriented dynamic ring network. In particular, we consider 1-interval connected dynamic rings (i.e. at any time, at most one of the edges might be missing). The agents move according to a Look-Compute-Move life cycle, under a synchronous scheduler. The agents may be homogenous (thus identical and monochromatic) or they may be heterogenous (distinct agents have distinct colors from a set of \(c \ge 1\) colors). For monochromatic agents starting from any dispersed configuration we want the agents to form a compact segment, where agents occupy a continuous part of the ring and no two agents are on the same node – we call this the Compact Configuration Problem. In the case of multiple colors (\(c>1\)), agents of the same color are required to occupy continuous segments, such that agents having the same color are all grouped together, while agents of distinct colors are separated. These formation problems are different from the classical and well studied problem of Gathering all agents at a node, since unlike the gathering problem, we do not allow collisions (each node may host at most one agent of a color).

We study these two problems and determine the necessary conditions for solving the problems. For all solvable cases, we provide algorithms for both the monochromatic and the colored version of the compact configuration problem, allowing for at most one intersection between the colored segments (which cannot be avoided in a dynamic ring). All our algorithms work even for the simplest model where agents have no persistent memory, no communication capabilities and do not agree on a common orientation. To the best of our knowledge this is the first work on the compaction problem in any type of dynamic network.

References

  1. 1.
    Agarwalla, A., Augustine, J., Moses, W.K., Madhav, S., Sridhar, A.K.: Deterministic dispersion of mobile robots in dynamic rings. In: Proceedings of 19th International Conference on Distributed Computing and Networking (ICDCN), pp. 19:1–19:4 (2018)Google Scholar
  2. 2.
    Biely, M., Robinson, P., Schmid, U., Schwarz, M., Winkler, K.: Gracefully degrading consensus and k-set agreement in directed dynamic networks. In: 2nd International Conference on Networked Systems (NETSYS), pp. 109–124 (2015)Google Scholar
  3. 3.
    Bournat, M., Dubois, S., Petit, F.: Gracefully degrading gathering in dynamic rings. In: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pp. 349–364 (2018)Google Scholar
  4. 4.
    Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. 27(5), 387–408 (2012)CrossRefGoogle Scholar
  5. 5.
    Das, S., Di Luna, G.A., Gasieniec, L.: Patrolling on dynamic ring networks. In: 45th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), pp. 150–163 (2019)Google Scholar
  6. 6.
    Di Luna, G., Baldoni, R.: Brief announcement: investigating the cost of anonymity on dynamic networks. In: 34th Symposium on Principles of Distributed Computing (PODC), pp. 339–341 (2015)Google Scholar
  7. 7.
    Di Luna, G., Dobrev, S., Flocchini, P., Santoro, N.: Live exploration of dynamic rings. In: 36th IEEE International Conference on Distributed Computing Systems (ICDCS), pp. 570–579 (2016)Google Scholar
  8. 8.
    Di Luna, G., Flocchini, P., Pagli, L., Prencipe, G., Santoro, N., Viglietta, G.: Gathering in dynamic rings. Theor. Comput. Sci. (2018, in press)Google Scholar
  9. 9.
    Flocchini, P., Enriques, A.M., Pagli, L., Prencipe, G., Santoro, N.: Point-of-failure shortest-path rerouting: computing the optimal swap edges distributively. IEICE Trans. Inf. Syst. E89–D(6), 700–708 (2006)CrossRefGoogle Scholar
  10. 10.
    Flocchini, P., Pagli, L., Prencipe, G., Santoro, N., Widmayer, P.: Computing all the best swap edges distributively. J. Parallel Distrib. Comput. 68(7), 976–983 (2008)CrossRefGoogle Scholar
  11. 11.
    Haeupler, B., Kuhn, F.: Lower bounds on information dissemination in dynamic networks. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 166–180. Springer, Heidelberg (2012).  https://doi.org/10.1007/978-3-642-33651-5_12CrossRefGoogle Scholar
  12. 12.
    Ilcinkas, D., Klasing, R., Wade, A.M.: Exploration of constantly connected dynamic graphs based on cactuses. In: Halldórsson, M.M. (ed.) SIROCCO 2014. LNCS, vol. 8576, pp. 250–262. Springer, Cham (2014).  https://doi.org/10.1007/978-3-319-09620-9_20CrossRefGoogle Scholar
  13. 13.
    Ilcinkas, D., Wade, A.M.: Exploration of the T-interval-connected dynamic graphs: the case of the ring. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 13–23. Springer, Cham (2013).  https://doi.org/10.1007/978-3-319-03578-9_2CrossRefGoogle Scholar
  14. 14.
    Jadbabaie, A., Lin, J., Morse, A.S.: Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans. Autom. Control 48(6), 988–1001 (2003)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: 42th Symposium on Theory of Computing (STOC), pp. 513–522 (2010)Google Scholar
  16. 16.
    Kuhn, F., Oshman, R.: Dynamic networks: models and algorithms. SIGACT News 42(1), 82–96 (2011)CrossRefGoogle Scholar
  17. 17.
    Liu, Z., Yamauchi, Y., Kijima, S., Yamashita, M.: Team assembling problem for asynchronous heterogeneous mobile robots. Theor. Comput. Sci. 721, 27–41 (2018)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Pagli, L., Prencipe, G., Viglietta, G.: Getting close without touching: near-gathering for autonomous mobile robots. Distrib. Comput. 28(5), 333–349 (2015)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Ren, W., Beard, R.W.: Consensus seeking in multi-agent systems under dynamically changing interaction topologies. IEEE. Trans. Autom. Control 50(5), 655–661 (2005)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Shantanu Das
    • 1
    Email author
  • Giuseppe Di Luna
    • 2
  • Linda Pagli
    • 3
  • Giuseppe Prencipe
    • 3
  1. 1.Aix-Marseille University, CNRS, LISMarseilleFrance
  2. 2.CINIRomeItaly
  3. 3.Department of Computer ScienceUniversità di PisaPisaItaly

Personalised recommendations