The Internet Archive has a preservation copy of this work in our general collections.
The file type is
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 ringsarXiv:0902.1834v1 fatcat:32xmhg35avgebe26iorsnioazq