Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Opaque Robots with Common Chirality - Université Clermont Auvergne Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Opaque Robots with Common Chirality

Résumé

We consider swarms of luminous myopic opaque robots that run in synchronous Look-Compute-Move cycles. These robots have no global compass, but agree on a common chirality. In this context, we propose optimal solutions to the perpetual exploration of a finite grid. Precisely, we investigate optimality in terms of the visibility range, number of robots, and number of colors. In more detail, under the optimal visibility range one, we give an algorithm which is optimal w.r.t. both the number of robots and colors: it uses two robots and three colors. Under visibility two, we design two algorithms: the first one uses three robots with an optimal number of colors (i.e., one), the second one achieves the best trade-off between the number of robots and colors, i.e., it uses two robots and two colors.
Fichier principal
Vignette du fichier
BDL21.pdf (543.28 Ko) Télécharger le fichier
ICDCN2021-video.mp4 (72.79 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03130277 , version 1 (03-02-2021)

Licence

Paternité - Pas d'utilisation commerciale - Pas de modification

Identifiants

  • HAL Id : hal-03130277 , version 1

Citer

Quentin Bramas, Pascal Lafourcade, Stéphane Devismes. Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Opaque Robots with Common Chirality. International Conference on Distributed Computing and Networking, 2021, Nara, Japan. ⟨hal-03130277⟩
200 Consultations
297 Téléchargements

Partager

Gmail Facebook X LinkedIn More