Stand-Up Indulgent Gathering on Rings - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

Stand-Up Indulgent Gathering on Rings

Résumé

We consider a collection of K>=2 robots that evolve in a ring-shaped network without common orientation, and address a variant of the crash-tolerant gathering problem called the Stand-Up Indulgent Gathering (SUIG): given a collection of robots, if no robot crashes, robots have to meet at the same arbitrary location, not known beforehand, in finite time; if one robot or more robots crash on the same location, the remaining correct robots gather at the location of the crashed robots. We aim at characterizing the solvability of the SUIG problem without multiplicity detection capability.

Dates et versions

hal-04622895 , version 1 (24-06-2024)

Identifiants

Citer

Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil. Stand-Up Indulgent Gathering on Rings. International Colloquium on Structural Information and Communication Complexity (SIROCCO 2024), May 2024, Vietri sul Mare, Italy. pp.119-137, ⟨10.1007/978-3-031-60603-8_7⟩. ⟨hal-04622895⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More