Skip to Main content Skip to Navigation
Conference papers

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots

Abstract : 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 possible. We show that the minimum number $\rho(n)$ of robots that can explore a ring of size $n$ is $O(\log n)$ and that $\rho(n)=\Omega(\log n)$ for arbitrarily large $n$. On one hand we give an algorithm that explores the ring starting from any initial configuration, provided that $n$ and $k$ are co-prime, and we show that there always exist such $k$ in $O(\log n)$. On the other hand we show that $\Omega(\log n)$ agents are necessary for arbitrarily large $n$. Notice that, when $k $ and $n$ are not co-prime, the problem is sometimes unsolvable (i.e., there are initial configurations for which the exploration cannot be done). This is the case, e.g., when $k$ divides $n$.
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download
Contributor : David Ilcinkas Connect in order to contact the contributor
Submitted on : Wednesday, November 19, 2008 - 12:08:35 PM
Last modification on : Saturday, June 25, 2022 - 10:30:59 AM
Long-term archiving on: : Monday, June 7, 2010 - 11:06:52 PM


Files produced by the author(s)




Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro. Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. OPODIS 2007, Dec 2007, Pointe à Pitre, Guadeloupe, France. pp.105-118, ⟨10.1007/978-3-540-77096-1_8⟩. ⟨hal-00339884⟩



Record views


Files downloads