Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2009

Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots

Résumé

We consider a team of $k$ identical, oblivious, asynchronous mobile robots that are able to sense (\emph{i.e.}, view) their environment, yet are unable to communicate, and evolve on a constrained path. Previous results in this weak scenario show that initial symmetry yields high lower bounds when problems are to be solved by \emph{deterministic} robots. In this paper, we initiate research on probabilistic bounds and solutions in this context, and focus on the \emph{exploration} problem of anonymous unoriented rings of any size. It is known that $\Theta(\log n)$ robots are necessary and sufficient to solve the problem with $k$ deterministic robots, provided that $k$ and $n$ are coprime. By contrast, we show that \emph{four} identical probabilistic robots are necessary and sufficient to solve the same problem, also removing the coprime constraint. Our positive results are constructive.
Fichier principal
Vignette du fichier
RR-6838.pdf (268.99 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00360305 , version 1 (10-02-2009)

Identifiants

  • HAL Id : inria-00360305 , version 1
  • ARXIV : 0902.1834

Citer

Stéphane Devismes, Franck Petit, Sébastien Tixeuil. Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots. [Research Report] RR-6838, INRIA. 2009, pp.29. ⟨inria-00360305⟩
413 Consultations
169 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More