A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots
[chapter]
2010
Lecture Notes in Computer Science
We consider the problem of exploring an anonymous unoriented ring of size n by k identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the ability to sense their environment and take decisions based on their local view. Previous works in this weak scenario prove that k must not divide n for a deterministic solution to exist. Also, it is known that the minimum number of robots (either deterministic or probabilistic) to explore a ring of size n is 4. An upper
doi:10.1007/978-3-642-13284-1_15
fatcat:mqo77pcm65b65mkirow2uny3ue