Gathering of Robots on Anonymous Grids without multiplicity detection

Gianlorenzo D'Angelo 1, 2 Gabriele Di Stefano 1 Ralf Klasing 3, 4 Alfredo Navarra 5
2 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
4 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : The paper studies the gathering problem on grid networks. A team of robots placed at different nodes of a grid, have to meet at some node and remain there. Robots operate in Look-Compute-Move cycles; in one cycle, a robot perceives the current configuration in terms of occupied nodes (Look), decides whether to move towards one of its neighbors (Compute), and in the positive case makes the computed move instantaneously (Move). Cycles are performed asynchronously for each robot. The problem has been deeply studied for the case of ring networks. However, the known techniques used on rings cannot be directly extended to grids. Moreover, on rings, another assumption concerning the so-called multiplicity detection capability was required in order to accomplish the gathering task. That is, a robot is able to detect during its Look operation whether a node is empty, or occupied by one robot, or occupied by an undefined number of robots greater than one. In this paper, we provide a full characterization about gatherable configurations for grids. In particular, we show that in this case, the multiplicity detection is not required. Very interestingly, sometimes the problem appears trivial, as it is for the case of grids with both odd sides, while sometimes the involved techniques require new insights with respect to the well-studied ring case. Moreover, our results reveal the importance of a structure like the grid that allows to overcome the multiplicity detection with respect to the ring case.
Type de document :
Communication dans un congrès
19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012), Jun 2012, Reykjavík, Iceland. Springer, 7355, pp.327-338, 2012, Lecture Notes in Computer Science; Structural Information and Communication Complexity. <10.1007/978-3-642-31104-8_28>
Liste complète des métadonnées

https://hal.inria.fr/hal-00728988
Contributeur : Gianlorenzo D'Angelo <>
Soumis le : vendredi 7 septembre 2012 - 11:07:59
Dernière modification le : vendredi 11 septembre 2015 - 01:07:08
Document(s) archivé(s) le : samedi 8 décembre 2012 - 03:40:26

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra. Gathering of Robots on Anonymous Grids without multiplicity detection. 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012), Jun 2012, Reykjavík, Iceland. Springer, 7355, pp.327-338, 2012, Lecture Notes in Computer Science; Structural Information and Communication Complexity. <10.1007/978-3-642-31104-8_28>. <hal-00728988>

Partager

Métriques

Consultations de
la notice

257

Téléchargements du document

173