Stand Up Indulgent Gathering - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2023

Stand Up Indulgent Gathering

Résumé

We consider a swarm of mobile robots evolving in a bidimensional Euclidean space. We study a variant of the crash-tolerant gathering problem: if no robot crashes, robots have to meet at the same arbitrary location, not known beforehand, in finite time; if one or several robots crash at the same location, the remaining correct robots gather at the crash location to rescue them. Motivated by impossibility results in the semi-synchronous setting, we present the first solution to the problem for the fully synchronous setting that operates in the vanilla Look-Compute-Move model with no additional hypotheses: robots are oblivious, disoriented, have no multiplicity detection capacity, and may start from arbitrary positions (including those with multiplicity points). We furthermore show that robots gather in a time that is proportional to the initial maximum distance between robots.
Fichier principal
Vignette du fichier
Stand Up Indulgent Gathering.pdf (457.42 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03975261 , version 1 (06-02-2023)

Licence

Copyright (Tous droits réservés)

Identifiants

Citer

Quentin Bramas, Anissa Lamani, Sébastien Tixeuil. Stand Up Indulgent Gathering. Theoretical Computer Science, 2023, 939, pp.63-77. ⟨10.1016/j.tcs.2022.10.015⟩. ⟨hal-03975261⟩
71 Consultations
70 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More