Subscribe
Issue No.04 - April (2013 vol.24)
pp: 716-723
Taisuke Izumi , Nagoya Institute of Technology, Nagoya
Tomoko Izumi , Ritsumeikan University, Kusatsu
Sayaka Kamei , Hiroshima University, Hiroshima
Fukuhito Ooshita , Osaka University, Osaka
ABSTRACT
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.
INDEX TERMS
randomized algorithm, Distributed algorithm, autonomous mobile robots, gathering problem
CITATION
Taisuke Izumi, Tomoko Izumi, Sayaka Kamei, Fukuhito Ooshita, "Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots", IEEE Transactions on Parallel & Distributed Systems, vol.24, no. 4, pp. 716-723, April 2013, doi:10.1109/TPDS.2012.212
REFERENCES
 [1] N. Agmon and D. Peleg, "Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots," SIAM J. Computing, vol. 36, no. 1, pp. 56-82, 2006. [2] H. Ando, Y. Oasa, I. Suzuki, and M. Yamashita, "Distributed Memoryless Point Convergence Algorithm for Mobile Robots with Limited Visibility," IEEE Trans. Robotics and Automation, vol. 15, no. 5, pp. 818-828, Oct. 1999. [3] Z. Bouzid, M.G. Potop-Butucaru, and S. Tixeuil, "Optimal Byzantine-Resilient Convergence in Uni-Dimensional Robot Networks," Theoretical Computer Science, vol. 411, nos. 34-36, pp. 3154-3168, 2010. [4] M. Cieliebak, P. Flocchini, G. Prencipe, and N. Santoro, "Solving the Robots Gathering Problem," Proc. 30th Int'l Colloquium on Automata, Languages and Programming (ICALP), pp. 1181-1196, 2003. [5] J. Clement, X. Défago, M. Gradinariu, T. Izumi, and S. Messika, "The Cost of Probabilistic Agreement in Oblivious Robot Networks," Information Processing Letters, vol. 110, no. 11, pp. 431-438, 2010. [6] R. Cohen and D. Peleg, "Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements," SIAM J. Computing, vol. 38, no. 1, pp. 276-302, 2008. [7] J. Czyzowicz, L. Gasieniec, and A. Pelc, "Gathering Few Fat Mobile Robots in the Plane," Theoretical Computer Science, vol. 410, nos. 6-7, pp. 481-499, 2009. [8] X. Défago, M. Gradinariu, S. Messika, and P.R. Parvédy, "Fault-Tolerant and Self-Stabilizing Mobile Robots Gathering," Proc. 20th Int'l Symp. Distribute Computing (DISC), pp. 46-60, 2006. [9] X. Défago and S. Souissi, "Non-Uniform Circle Formation Algorithm for Oblivious Mobile Robots with Convergence toward Uniformity," Theoretical Computer Science, vol. 396, nos. 1-3, pp. 97-112, 2008. [10] Y. Dieudonné and F. Petit, "Swing Words to Make Circle Formation Quiescent," Proc. 14th Int'l Colloquium Structural Information and Comm. Complexity (SIROCCO), pp. 166-179, 2007. [11] Y. Dieudonné and F. Petit, "Squaring the Circle with Weak Mobile Robots," Proc. 19th Int'l Symp. Algorithms and Computation (ISAAC), pp. 354-365, 2008. [12] Y. Dieudonné and F. Petit, "Self-Stabilizing Deterministic Gathering," Proc. Fifth Int'l Workshop Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS), pp. 230-241, 2009. [13] P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer, "Gathering of Asynchronous Robots with Limited Visibility," Theoretical Computer Science, vol. 337, nos. 1-3, pp. 147-168, 2005. [14] N. Inuzuka, Y. Tomida, T. Izumi, Y. Katayama, and K. Wada, "Gathering Problem of Two Asynchronous Mobile Robots with Semi-Dynamic Compasses," Proc. 15th Int'l Colloquium Structural Information and Comm. Complexity (SIROCCO), pp. 5-19, 2008. [15] T. Izumi, Z. Bouzid, S. Tixeuil, and K. Wada, "The BG-Simulation for Byzantine Mobile Robots," Proc. 25th Int'l Symp. Distributed Computing (DISC), pp. 330-331, 2011. [16] T. Izumi, Y. Katayama, N. Inuzuka, and K. Wada, "Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result," Proc. 21st Int'l Symp. Distributed Computing (DISC), pp. 298-312, 2007. [17] Y. Katayama, Y. Tomida, H. Imazu, N. Inuzuka, and K. Wada, "Dynamic Compass Models and Gathering Algorithm for Autonomous Mobile Robots," Proc. 14th Int'l Colloquium Structural Information and Comm. Complexity (SIROCCO), pp. 274-288, 2007. [18] G. Prencipe, "CORDA: Distributed Coordination of a Set of Autonomous Mobile Robots," Proc. Fourth European Research Seminar on Advances in Distributed Systems (ESRADS), 2001. [19] G. Prencipe, "Distributed Coordination of a Set of Autonomous Mobile Robots," PhD thesis, Univ. of Pisa, 2002. [20] G. Prencipe, "Impossibility of Gathering by a Set of Autonomous Mobile Robots," Theoretical Computer Science, vol. 384, nos. 2-3, pp. 222-231, 2007. [21] S. Souissi, X. Défago, and M. Yamashita, "Gathering Asynchronous Mobile Robots with Inaccurate Compasses," Proc. 10th Int'l Conf. Principles of Distributed Systems (OPODIS), pp. 333-349, 2006. [22] S. Souissi, X. Défago, and M. Yamashita, "Using Eventually Consistent Compasses to Gather Memory-Less Mobile Robots with Limited Visibility," ACM Trans. Autonomous Adaptive and Adaptive Systems, vol. 4, no. 1,article 9, 2009. [23] I. Suzuki and M. Yamashita, "Distributed Anonymous Mobile Robots: Formation of Geometric Patterns," SIAM J. Computing, vol. 28, no. 4, pp. 1347-1363, 1999. [24] K. Yamamoto, T. Izumi, Y. Katayama, N. Inuzuka, and K. Wada, "Convergence of Mobile Robots with Uniformly-Inaccurate Sensors," Proc. 16th Int'l Colloquium Structural Information and Comm. Complexity (SIROCCO), pp. 309-322, 2009. [25] M. Yamashita, S. Souissi, and X. Défago, "Gathering two Stateless Mobile Robots Using Very Inaccurate Compasses in Finite Time," Proc. First Int'l Conf. Robot Comm. and Coordination (ROBOCOMM), p. 48, 2007. [26] M. Yamashita and I. Suzuki, "Characterizing Geometric Patterns Formable by Oblivious Anonymous Mobile Robots," Theoretical Computer Science, vol. 411, nos. 26-28, pp. 2433-2453, 2010.