非同期で無記憶なロボット群による確率的リング探索の最適化
Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots
通信も記憶もできない非同期ロボットによるリング探索問題を確率的に解き、4台の同一ロボットで十分かつ必要であることを示した論文。
著者: Stéphane Devismes, Franck Petit, Sébastien Tixeuil
分類: cs.DS, cs.CC, cs.DC, cs.RO
原文アブストラクト
We consider a team of $k$ identical, oblivious, asynchronous mobile robots that are able to sense (\emph{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 \emph{deterministic} robots. In this paper, we initiate research on probabilistic bounds and solutions in this context, and focus on the \emph{exploration} problem of anonymous unoriented rings of any size. It is known that $\Theta(\log n)$ 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 \emph{four} identical probabilistic robots are necessary and sufficient to solve the same problem, also removing the coprime constraint. Our positive results are constructive.
