Position discovery for a system of bouncing robots

A collection of n anonymous mobile robots is deployed on a unit-perimeter ring or a unit-length line segment. Every robot starts moving at constant speed, and bounces each time it meets any other robot or segment endpoint, changing its walk direction. We study the problem of position discovery, in which the task of each robot is to detect the presence and the initial positions of all other robots. The robots cannot communicate or perceive information about the environment in any way other than by bouncing nor they have control over their walks which are determined by their initial positions and their starting directions. Each robot has a clock allowing it to observe the times of its bounces. We give complete characterizations of all initial configurations for both the ring and the segment in which no position detection algorithm exists and we design optimal position detection algorithms for all feasible configurations.

[1]  Alfred M. Bruckstein,et al.  Uniform multi-agent deployment on a ring , 2011, Theor. Comput. Sci..

[2]  Masafumi Yamashita,et al.  Distributed memoryless point convergence algorithm for mobile robots with limited visibility , 1999, IEEE Trans. Robotics Autom..

[3]  Wolfram Burgard,et al.  A Probabilistic Approach to Collaborative Multi-Robot Localization , 2000, Auton. Robots.

[4]  Nicola Santoro,et al.  Gathering of Asynchronous Oblivious Robots with Limited Visibility , 2001, STACS.

[5]  Stergios I. Roumeliotis,et al.  Performance analysis of multirobot Cooperative localization , 2006, IEEE Transactions on Robotics.

[6]  Edsger W. Dijkstra,et al.  Selected Writings on Computing: A personal Perspective , 1982, Texts and Monographs in Computer Science.

[7]  Stergios I. Roumeliotis,et al.  Distributed multirobot localization , 2002, IEEE Trans. Robotics Autom..

[8]  Geoffrey A. Hollinger,et al.  Efficient Multi-robot Search for a Moving Target , 2009, Int. J. Robotics Res..

[9]  Masafumi Yamashita,et al.  Characterizing geometric patterns formable by oblivious anonymous mobile robots , 2010, Theor. Comput. Sci..

[10]  Matthew R. Walter,et al.  Consistent cooperative localization , 2009, 2009 IEEE International Conference on Robotics and Automation.

[11]  Ichiro Suzuki,et al.  Distributed algorithms for formation of geometric patterns with many mobile robots , 1996, J. Field Robotics.

[12]  Reuven Cohen,et al.  Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems , 2005, SIAM J. Comput..

[13]  Keith Yu Kit Leung,et al.  Decentralized Localization of Sparsely-Communicating Robot Networks: A Centralized-Equivalent Approach , 2010, IEEE Transactions on Robotics.

[14]  Ryo Kurazume,et al.  An Experimental Study of a Cooperative Positioning System , 2000, Auton. Robots.

[15]  Reuven Cohen,et al.  Local spreading algorithms for autonomous robot systems , 2008, Theor. Comput. Sci..

[16]  Leszek Gasieniec,et al.  Observe and Remain Silent (Communication-Less Agent Location Discovery) , 2012, MFCS.

[17]  David Peleg,et al.  Distributed algorithms for partitioning a swarm of autonomous mobile robots , 2009, Theor. Comput. Sci..

[18]  István Á. Harmati,et al.  Robot team coordination for target tracking using fuzzy logic controller in game theoretic framework , 2009, Robotics Auton. Syst..

[19]  Nicola Santoro,et al.  Self-deployment of mobile sensors on a ring , 2008, Theor. Comput. Sci..

[20]  Nicola Santoro,et al.  On the computational power of oblivious robots: forming a series of geometric patterns , 2010, PODC '10.

[21]  Boleslaw K. Szymanski,et al.  Efficient and inefficient ant coverage methods , 2001, Annals of Mathematics and Artificial Intelligence.

[22]  Paola Flocchini.  Uniform Covering of Rings and Lines by Memoryless Mobile Sensors , 2016, Encyclopedia of Algorithms.

[23]  Jurek Czyzowicz,et al.  Information Spreading by Mobile Particles on a Line , 2015, SIROCCO.

[24]  Nicola Santoro,et al.  Gathering of asynchronous robots with limited visibility , 2005, Theor. Comput. Sci..

[25]  Nicola Santoro,et al.  Arbitrary pattern formation by asynchronous, anonymous, oblivious robots , 2008, Theor. Comput. Sci..

[26]  Yaniv Altshuler,et al.  Multi-agent Cooperative Cleaning of Expanding Domains , 2011, Int. J. Robotics Res..

[27]  Michael J. Fischer,et al.  Computation in networks of passively mobile finite-state sensors , 2004, PODC '04.

[28]  Sebastian Thrun,et al.  Robotic mapping: a survey , 2003 .

[29]  David Eisenstat,et al.  Stably computable predicates are semilinear , 2006, PODC '06.

[30]  Sven Koenig,et al.  Building Terrain-Covering Ant Robots: A Feasibility Study , 2004, Auton. Robots.

[31]  Ryo Kurazume,et al.  Cooperative positioning with multiple robots , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[32]  Sarit Kraus,et al.  Coalition formation with uncertain heterogeneous information , 2003, AAMAS '03.

[33]  Boleslaw K. Szymanski,et al.  E cient and ine cient ant coverage methods , 2001 .

[34]  Yaniv Altshuler,et al.  Static and expanding grid coverage with ant robots: Complexity results , 2011, Theor. Comput. Sci..

[35]  Jurek Czyzowicz,et al.  Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds , 2011, ESA.

[36]  Masafumi Yamashita,et al.  Distributed Anonymous Mobile Robots: Formation of Geometric Patterns , 1999, SIAM J. Comput..