A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
2012
Algorithmica
We consider the problem of exploring an anonymous unoriented ring by a team of k identical, oblivious, asynchronous mobile robots that can view the environment but cannot communicate. This weak scenario is standard when the spatial universe in which the robots operate is the two-dimentional plane, but (with one exception) has not been investigated before. We indeed show that, although the lack of these capabilities renders the problems considerably more difficult, ring exploration is still
doi:10.1007/s00453-011-9611-5
fatcat:k3zj2vsdtjedzddojdyry4g6xa