Exclusive perpetual ring exploration without chirality - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2010

Exclusive perpetual ring exploration without chirality

Abstract

In this paper, we study the exclusive perpetual exploration problem with mobile anonymous and oblivious robots in a discrete space. Our results hold for the most generic settings: robots are asynchronous and are not given any sense of direction, so the left and right sense (\emph{i.e.} chirality) is decided by the adversary that schedules robots for execution, and may change between invocations of a particular robots (as robots are oblivious). We investigate both the minimal and the maximal number of robots that are necessary and sufficient to solve the exclusive perpetual exploration problem. On the minimal side, we prove that three deterministic robots are necessary and sufficient, provided that the size $n$ of the ring is at least $10$, and show that no protocol with three robots can exclusively perpetually explore a ring of size less than $10$. On the maximal side, we prove that $k=n-5$ robots are necessary and sufficient to exclusively perpetually explore a ring of size $n$ when $n$ is co-prime with $k$.
Fichier principal
Vignette du fichier
perpetual-last.pdf (186.95 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00464206 , version 1 (16-03-2010)

Identifiers

  • HAL Id : inria-00464206 , version 1

Cite

Lélia Blin, Alessia Milani, Maria Potop-Butucaru, Sébastien Tixeuil. Exclusive perpetual ring exploration without chirality. [Research Report] Université d'Evry Val d'Essonne. 2010, pp.17. ⟨inria-00464206⟩
261 View
234 Download

Share

Gmail Facebook X LinkedIn More