Multi-Cleaning Robots Using Cleaning Distribution Method Based on Map Decomposition in Large Environments

Most cleaning robots have a good cleaning performance for small environments such as houses but require a longer cleaning time due to problems such as slow cleaning progress and low battery capacity, making the robots unsuitable for large environments such as libraries and airports. Cleaning large environments with multiple robots is faster than cleaning them with a single robot. Multi-cleaning robots can utilize several robots to simultaneously clean and share the task of cleaning among the robots. However, as the number of robots increases and the effective distribution of cleaning is not efficient during the cleaning process, the cleaning time will consequently be longer due to the frequent collisions between the robots. Therefore, to shorten the cleaning time, multi-cleaning robots require a coverage path planning that uses an effective cleaning distribution method in the cleaning process. In this paper, a coverage path planning using a cleaning distribution method based on map decomposition is proposed to reduce the cleaning time of multi-cleaning robots. The experimental results demonstrated that the proposed multi-cleaning robots’ coverage path planning could be used in large environments in the presence of several types of obstacles. Furthermore, the cleaning time was found to be shorter than that of the previous methods in the case of multi-cleaning robots.

[1]  Ziping Zhao,et al.  A Multiple Mobile Robots Path planning Algorithm Based on A-star and Dijkstra Algorithm , 2014 .

[2]  Janusz Będkowski.  Mobile Robots - Control Architectures, Bio-Interfacing, Navigation, Multi Robot Motion Planning and Operator Training , 2011 .

[3]  Howie Choset,et al.  Limited communication, multi-robot team based coverage , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[4]  Elon Rimon,et al.  Spiral-STC: an on-line coverage algorithm of grid environments by a mobile robot , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

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

[6]  Aleksis Liekna,et al.  Multi-robot System for Vacuum Cleaning Domain , 2014, PAAMS.

[7]  Antonio Barrientos,et al.  A Multirobot System for Distributed Area Coverage and Signal Searching in Large Outdoor Scenarios * , 2016, J. Field Robotics.

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

[9]  Kamal Kant Bharadwaj,et al.  Multi-robot exploration and terrain coverage in an unknown environment , 2012, Robotics Auton. Syst..

[10]  Maja J. Mataric,et al.  Multi-robot task allocation: analyzing the complexity and optimality of key architectures , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[11]  Israel A. Wagner,et al.  Cooperative Cleaners: A Study in Ant Robotics , 2008, Int. J. Robotics Res..

[12]  Yasuhiro Tsujimura,et al.  Influence of Field Structure on the Multi-Agent Coverage Algorithm on Unknown Fields , 2013, J. Adv. Comput. Intell. Intell. Informatics.

[13]  Hung Manh La,et al.  A Distributed Control Framework of Multiple Unmanned Aerial Vehicles for Dynamic Wildfire Tracking , 2018, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[14]  Ioannis M. Rekleitis,et al.  Distributed coverage with multi-robot system , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[15]  Howie Choset,et al.  Coverage of Known Spaces: The Boustrophedon Cellular Decomposition , 2000, Auton. Robots.

[16]  Ernesto Nunes,et al.  Multi-Robot Auctions for Allocation of Tasks with Temporal Constraints , 2015, AAAI.

[17]  Chaomin Luo,et al.  Complete Coverage Autonomous Underwater Vehicles Path Planning Based on Glasius Bio-Inspired Neural Network Algorithm for Discrete and Centralized Programming , 2019, IEEE Transactions on Cognitive and Developmental Systems.

[18]  Howie Choset,et al.  Sensor-based Coverage of Unknown Environments: Incremental Construction of Morse Decompositions , 2002, Int. J. Robotics Res..

[19]  Koen V. Hindriks,et al.  Altruistic coordination for multi-robot cooperative pathfinding , 2015, Applied Intelligence.

[20]  Enrique Gonzalez,et al.  Multirobot Cooperative Model Applied to Coverage of Unknown Regions , 2011 .

[21]  Enrique González,et al.  BSA: A Complete Coverage Algorithm , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[22]  Shalabh Gupta,et al.  An Online Coverage Path Planning Algorithm for Curvature-Constrained AUVs , 2019, OCEANS 2019 MTS/IEEE SEATTLE.

[23]  J Maharshi,et al.  Comparative Analysis of Search Algorithms , 2018 .

[24]  Maria L. Gini,et al.  Monte Carlo Tree Search with Branch and Bound for Multi-Robot Task Allocation , 2016 .

[25]  Gourav Kumar,et al.  Cluster, Allocate, Cover: An Efficient Approach for Multi-robot Coverage , 2015, 2015 IEEE International Conference on Systems, Man, and Cybernetics.

[26]  Syamsiah Mashohor,et al.  Efficient terrain coverage for deploying wireless sensor nodes on multi-robot system , 2016, Intell. Serv. Robotics.

[27]  Vishnu G. Nair,et al.  GM-VPC: An Algorithm for Multi-robot Coverage of Known Spaces Using Generalized Voronoi Partition , 2019, Robotica.

[28]  Elon Rimon,et al.  Online Coverage of Planar Environments by a Battery Powered Autonomous Mobile Robot , 2016, IEEE Transactions on Automation Science and Engineering.

[29]  Enrique González,et al.  BSA: a coverage algorithm , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[30]  Jae-Jun Kim,et al.  Complete coverage path planning for multi-robots employing flow networks , 2008, 2008 International Conference on Control, Automation and Systems.

[31]  Syamsiah Mashohor,et al.  Deploying clustered wireless sensor network by multi-robot system , 2014, 2014 IEEE International Conference on Control System, Computing and Engineering (ICCSCE 2014).

[32]  Dae-Won Kim,et al.  An effective initialization method for genetic algorithm-based robot path planning using a directed acyclic graph , 2016, Inf. Sci..

[33]  Marc Carreras,et al.  A survey on coverage path planning for robotics , 2013, Robotics Auton. Syst..

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

[35]  Nitin Kamra,et al.  Combinatorial Problems in Multirobot Battery Exchange Systems , 2018, IEEE Transactions on Automation Science and Engineering.

[36]  Enríque González Guerrero,et al.  BSA-CM: A Multi-robot Coverage Algorithm , 2009, 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology.

[37]  Kurt Geihs,et al.  Cooperative Path Planning for Multi-Robot Systems in Dynamic Domains , 2011 .

[38]  Xu Miao,et al.  Scalable Coverage Path Planning for Cleaning Robots Using Rectangular Map Decomposition on Large Environments , 2018, IEEE Access.

[39]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[40]  Hong Liu,et al.  Sensor-based complete coverage path planning in dynamic environment for cleaning robot , 2018, CAAI Trans. Intell. Technol..

[41]  Hoang Huu Viet,et al.  BoB: an online coverage approach for multi-robot systems , 2014, Applied Intelligence.

[42]  Magnus Egerstedt,et al.  Coverage Control for Multirobot Teams With Heterogeneous Sensing Capabilities , 2018, IEEE Robotics and Automation Letters.

[43]  Hoang Huu Viet,et al.  BA*: an online complete coverage algorithm for cleaning robots , 2012, Applied Intelligence.

[44]  Chaomin Luo,et al.  Multi-AUVs cooperative complete coverage path planning based on GBNN algorithm , 2017, 2017 29th Chinese Control And Decision Conference (CCDC).

[45]  Stephen J. Guy,et al.  Stochastic Tree Search with Useful Cycles for patrolling problems , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[46]  Amna Khan,et al.  On Complete Coverage Path Planning Algorithms for Non-holonomic Mobile Robots: Survey and Challenges , 2017, J. Inf. Sci. Eng..

[47]  Ahmed M. Elmogy,et al.  Multi-robot Task Allocation: A Review of the State-of-the-Art , 2015, Advances in Social Media Analysis.

[48]  Metin Ozkan,et al.  A pattern-based genetic algorithm for multi-robot coverage path planning minimizing completion time , 2010, Journal of Intelligent Manufacturing.

[49]  Noam Hazon,et al.  On redundancy, efficiency, and robustness in coverage for multiple robots , 2008, Robotics Auton. Syst..