Back to Search
Start Over
Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots.
- Source :
- Structural Information & Communication Complexity (9783642114755); 2010, p195-208, 14p
- Publication Year :
- 2010
-
Abstract
- We consider a team of k identical, oblivious, semi-synchronous 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 Θ(logn) 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISBNs :
- 9783642114755
- Database :
- Complementary Index
- Journal :
- Structural Information & Communication Complexity (9783642114755)
- Publication Type :
- Book
- Accession number :
- 76743646
- Full Text :
- https://doi.org/10.1007/978-3-642-11476-2_16