A Minimalist Algorithm for Multirobot Continuous Coverage

This paper describes an algorithm, which has been specifically designed to solve the problem of multirobot-controlled frequency coverage (MRCFC), in which a team of robots are requested to repeatedly visit a set of predefined locations of the environment according to a specified frequency distribution. The algorithm has low requirements in terms of computational power, does not require inter-robot communication, and can even be implemented on memoryless robots. Moreover, it has proven to be statistically complete as well as easily implementable on real, marketable robot swarms for real-world applications.

[1]  Simeon C. Ntafos,et al.  Watchman Routes Under Limited Visibility , 1991, Comput. Geom..

[2]  Richard E. Korf,et al.  Real-Time Heuristic Search , 1990, Artif. Intell..

[3]  Peter Stone,et al.  A multi-robot system for continuous area sweeping tasks , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[4]  Marco Baglietto,et al.  Multi-Robot Uniform Frequency Coverage of Significant Locations in the Environment , 2008, DARS.

[5]  Charles R. Johnson,et al.  Perron eigenvectors and the symmetric transportation polytope , 1991 .

[6]  Esther M. Arkin,et al.  Angewandte Mathematik Und Informatik Universit at Zu K Oln Approximation Algorithms for Lawn Mowing and Milling Ss Andor P.fekete Center for Parallel Computing Universitt at Zu Kk Oln D{50923 Kk Oln Germany Approximation Algorithms for Lawn Mowing and Milling , 2022 .

[7]  Gaurav S. Sukhatme,et al.  The Analysis of an Efficient Algorithm for Robot Coverage and Exploration based on Sensor Network Deployment , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[8]  Shuzhi Sam Ge,et al.  Complete Multi-Robot Coverage of Unknown Environments with Minimum Repeated Coverage , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[9]  Eiichi Yoshida,et al.  Cooperative sweeping by multiple mobile robots , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[10]  Bernhard Nebel,et al.  RFID Technology-based Exploration and SLAM for Search And Rescue , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[11]  Leonidas J. Guibas,et al.  A Visibility-Based Pursuit-Evasion Problem , 1999, Int. J. Comput. Geom. Appl..

[12]  Elon Rimon,et al.  Competitive on-line coverage of grid environments by a mobile robot , 2003, Comput. Geom..

[13]  Wesley H. Huang.  Optimal line-sweep-based decompositions for coverage algorithms , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[14]  Steven M. LaValle,et al.  Visibility-Based Pursuit-Evasion in an Unknown Planar Environment , 2004, Int. J. Robotics Res..

[15]  Noam Hazon,et al.  Towards robust on-line multi-robot coverage , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[16]  Enar Reilent,et al.  RFID-based Communications for a Self-Organising Robot Swarm , 2008, 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems.

[17]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[18]  Chaomin Luo,et al.  Real-time path planning with deadlock avoidance of multiple cleaning robots , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[19]  Howie Choset,et al.  Coverage Path Planning: The Boustrophedon Cellular Decomposition , 1998 .

[20]  Elon Rimon,et al.  Spanning-tree based coverage of continuous areas by a mobile robot , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[21]  Christina M.L. Kelton.  Estimation of Time-Independent Markov Processes with Aggregate Data: A Comparison of Techniques , 1981 .

[22]  Lynne E. Parker,et al.  Behavioral control for multi-robot perimeter patrol: A Finite State Automata approach , 2009, 2009 IEEE International Conference on Robotics and Automation.

[23]  Ralph L. Hollis,et al.  Distributed coverage of rectilinear environments , 2000 .

[24]  Wei Min Tao,et al.  A decentralized approach for cooperative sweeping by multiple mobile robots , 1998, Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190).

[25]  Michael A. Bender,et al.  The power of a pebble: exploring and mapping directed graphs , 1998, STOC '98.

[26]  Stephen P. Boyd,et al.  Fastest Mixing Markov Chain on a Graph , 2004, SIAM Rev..

[27]  J. Röning,et al.  An Experimental Environment for Optimal Spatial Sampling in a Multi-Robot System , 2008 .

[28]  Jacques Wainer,et al.  Probabilistic Multiagent Patrolling , 2008, SBIA.

[29]  Noa Agmon,et al.  Multi-robot area patrol under frequency constraints , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[30]  Masafumi Yamashita,et al.  Searching for a Mobile Intruder in a Polygonal Region , 1992, SIAM J. Comput..

[31]  Alan F. Karr.  Markov chains and processes with a prescribed invariant measure , 1978 .

[32]  Howie Choset,et al.  Efficient Boustrophedon Multi-Robot Coverage: an algorithmic approach , 2008, Annals of Mathematics and Artificial Intelligence.

[33]  Bernhard Nebel,et al.  RFID-Based Exploration for Large Robot Teams , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[34]  E. C. Macrae.  Estimation of Time-Varying Markov Processes with Aggregate Data , 1977 .

[35]  Agathoniki Trigoni,et al.  Robot-assisted discovery of evacuation routes in emergency scenarios , 2008, 2008 IEEE International Conference on Robotics and Automation.

[36]  Yoshihiko Kimuro,et al.  A Supervised Learning Approach to Robot Localization Using a Short-Range RFID Sensor , 2007, IEICE Trans. Inf. Syst..

[37]  Nak Young Chong,et al.  RFID-based mobile robot guidance to a stationary target , 2007 .

[38]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[39]  Abraham Berman,et al.  More on Extremal Positive Semidefinite Doubly Stochastic Matrices , 1992 .

[40]  Reid G. Simmons,et al.  Easy and Hard Testbeds for Real-Time Search Algorithms , 1996, AAAI/IAAI, Vol. 1.

[41]  Alexis Drogoul,et al.  Multi-agent Patrolling: An Empirical Analysis of Alternative Architectures , 2002, MABS.

[42]  Amir Pirzadeh,et al.  A unified solution to coverage and search in explored and unexplored terrains using indirect control , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[43]  Sonal Jain,et al.  Multi-robot forest coverage , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[44]  Oliver C. Ibe,et al.  Markov processes for stochastic modeling , 2008 .

[45]  Sarit Kraus,et al.  Multi-robot perimeter patrol in adversarial settings , 2008, 2008 IEEE International Conference on Robotics and Automation.

[46]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[47]  Gunter Bolch,et al.  Queueing Networks and Markov Chains , 2005 .

[48]  Israel A. Wagner,et al.  Distributed covering by ant-robots using evaporating traces , 1999, IEEE Trans. Robotics Autom..

[49]  T. D. Parsons,et al.  Pursuit-evasion in a graph , 1978 .

[50]  Michael Jenkin,et al.  Robotic exploration as graph construction , 1991, IEEE Trans. Robotics Autom..

[51]  Sven Koenig,et al.  Trail-laying robots for robust terrain coverage , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[52]  Nicola Basilico,et al.  Finding the optimal strategies for robotic patrolling with adversaries in topologically-represented environments , 2009, 2009 IEEE International Conference on Robotics and Automation.

[53]  Xiaotie Deng,et al.  Competitive robot mapping with homogeneous markers , 1996, IEEE Trans. Robotics Autom..

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

[55]  Sampath Kannan,et al.  Randomized pursuit-evasion in a polygonal environment , 2005, IEEE Transactions on Robotics.

[56]  Jun Ota,et al.  Exploration-path generation of multiple mobile robots using reaction-diffusion equation on a graph , 2003, Proceedings 2003 IEEE International Symposium on Computational Intelligence in Robotics and Automation. Computational Intelligence in Robotics and Automation for the New Millennium (Cat. No.03EX694).

[57]  Tucker R. Balch,et al.  Avoiding the past: a simple but effective strategy for reactive navigation , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[58]  Steven M. LaValle,et al.  Visibility-based pursuit-evasion: the case of curved environments , 2001, IEEE Trans. Robotics Autom..

[59]  Wolfram Burgard,et al.  Mapping and localization with RFID technology , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[60]  Franco Zambonelli,et al.  Pervasive pheromone-based interaction with RFID tags , 2007, TAAS.

[61]  S. Pierce,et al.  Extremal positive semidefinite doubly stochastic matrices , 1991 .

[62]  Israel A. Wagner,et al.  Efficiently searching a graph by a smell-oriented vertex process , 2004, Annals of Mathematics and Artificial Intelligence.

[63]  V. Climenhaga.  Markov chains and mixing times , 2013 .