Abstract
The gathering problem of anonymous and oblivious mobile robots is one of fundamental problems in the theoretical mobile robotics. We consider the gathering problem in unoriented and anonymous rings, which requires that all robots gather at a non-predefined node. Since the gathering problem cannot be solved without any additional capability to robots, all the previous works assume some capability of robots, such as accessing the memory on node. In this paper, we focus on the multiplicity capability. This paper presents a deterministic gathering algorithm with local-weak multiplicity, which provides the robot with the information about whether its current node has more than one robot or not. This assumption is strictly weaker than that by previous works. Moreover, we show that our algorithm is asymptotically time-optimal one, that is, the time complexity of our algorithm is O(n), where n is the number of nodes. Interestingly, in spite of assuming the weaker assumption, it achieves significant improvement compared to the previous algorithm, which takes O(kn) time for k robots.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for automonous mobile robots. SIAM Journal of Computing 36(1), 56–82 (2006)
Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Solving the robots gathering problem. In: Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), pp. 1181–1196 (2003)
Flocchini, P., Kranakis, E., Krizanc, D., Sawchuk, C., Santoro, N.: Multiple mobile agents rendezvous in a ring. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 599–608. Springer, Heidelberg (2004)
Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchnorous robots with limited visibility. Theoretical Computer Science 337(1-3), 147–168 (2005)
Fraigniaud, P., Pelec, A.: Deterministic rendezvous in trees with little memory. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 242–256. Springer, Heidelberg (2008)
Gasieniec, L., Kranakis, E., Krizanc, D., Zhang, X.: Optimal memory rendezvous of anonymous mobile agents in a uni-directional ring. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 282–292. Springer, Heidelberg (2006)
Izumi, T., Izumi, T., Kamei, S., Ooshita, F.: Randomized gathering of mobile robots with local-multiplicity detection. In: Guerraoui, R., Petit, F. (eds.) SSS 2009. LNCS, vol. 5873, pp. 384–398. Springer, Heidelberg (2009)
Klasing, R., Kosowski, A., Navarra, A.: Taking advantage of symmetrics: Gathering of asynchronous oblivious robots on a ring. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 446–462. Springer, Heidelberg (2008)
Klasing, R., Markou, E., Pelc, A.: Gathering asynchnorous pblivious mobile robots in a ring. Theoretical Computer Science 390(1), 27–39 (2008)
Kowalski, D., Pelec, A.: Polynomial deterministic rendezvous in arbtrary graphs. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 644–656. Springer, Heidelberg (2004)
Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: Proceedings of the 23th International Conference on Distributed Computing Systems (ICDCS 2003), pp. 592–599 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Izumi, T., Izumi, T., Kamei, S., Ooshita, F. (2010). Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings. In: Patt-Shamir, B., Ekim, T. (eds) Structural Information and Communication Complexity. SIROCCO 2010. Lecture Notes in Computer Science, vol 6058. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13284-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-13284-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13283-4
Online ISBN: 978-3-642-13284-1
eBook Packages: Computer ScienceComputer Science (R0)