Issue No. 04 - April (2013 vol. 24)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2012.212
Taisuke Izumi , Nagoya Institute of Technology, Nagoya
Tomoko Izumi , Ritsumeikan University, Kusatsu
Sayaka Kamei , Hiroshima University, Hiroshima
Fukuhito Ooshita , Osaka University, Osaka
We consider the problem of gathering $(n)$ anonymous and oblivious mobile robots, which requires that all robots meet in finite time at a nonpredefined point. While the gathering problem cannot be solved deterministically without assuming any additional capabilities for the robots, randomized approaches easily allow it to be solvable. However, the randomized solutions currently known have a time complexity that is exponential in $(n)$ with no additional assumption. This fact yields the following two questions: Is it possible to construct a randomized gathering algorithm with polynomial expected time? If it is not possible, what is the minimal additional assumption necessary to obtain such an algorithm? In this paper, we address these questions from the aspect of multiplicity-detection capabilities. We newly introduce two weaker variants of multiplicity detection, called local-strong and local-weak multiplicity, and investigate whether those capabilities permit a gathering algorithm with polynomial expected time or not. The contribution of this paper is to show that any algorithm only assuming local-weak multiplicity detection takes exponential number of rounds in expectation. On the other hand, we can obtain a constant-round gathering algorithm using local-strong multiplicity detection. These results imply that the two models of multiplicity detection are significantly different in terms of their computational power. Interestingly, these differences disappear if we take one more assumption that all robots are scattered (i.e., no two robots stay at the same location) initially. We can obtain a gathering algorithm that takes a constant number of rounds in expectation, assuming local-weak multiplicity detection and scattered initial configurations.
randomized algorithm, Distributed algorithm, autonomous mobile robots, gathering problem
T. Izumi, T. Izumi, S. Kamei and F. Ooshita, "Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots," in IEEE Transactions on Parallel & Distributed Systems, vol. 24, no. , pp. 716-723, 2013.