Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots

Stéphane Devismes
Franck Petit
  • Fonction : Auteur
  • PersonId : 778299
  • IdRef : 050783238
Sébastien Tixeuil

Résumé

We consider a team of k identical, oblivious, asynchronous mobile robots that are able to sense (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 deterministic robots. In this paper, we initiate research on probabilistic bounds and solutions in this context, and focus on the 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 four identical probabilistic robots are necessary and sufficient to solve the same problem, also removing the coprime constraint. Our positive results are constructive.

Dates et versions

hal-01295189 , version 1 (30-03-2016)

Identifiants

Citer

Stéphane Devismes, Franck Petit, Sébastien Tixeuil. Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots. Sirocco 2009, May 2009, Piran, Slovenia. pp.195-208, ⟨10.1007/978-3-642-11476-2_16⟩. ⟨hal-01295189⟩
72 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More