BA*: an online complete coverage algorithm for cleaning robots

This paper presents a novel approach to solve the online complete coverage task of autonomous cleaning robots in unknown workspaces based on the boustrophedon motions and the A* search algorithm (BA*). In this approach, the robot performs a single boustrophedon motion to cover an unvisited region until it reaches a critical point. To continue covering the next unvisited region, the robot wisely detects backtracking points based on its accumulated knowledge, determines the best backtracking point as the starting point of the next boustrophedon motion, and applies an intelligent backtracking mechanism based on the proposed A* search with smoothed path on tiling so as to reach the starting point with the shortest collision-free path. The robot achieves complete coverage when no backtracking point is detected. Computer simulations and experiments in real workspaces prove that our proposed BA* is efficient for the complete coverage task of cleaning robots.

[1]  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).

[2]  S.X. Yang,et al.  A neural network approach to complete coverage path planning , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[3]  Wang Xingsong,et al.  Complete Coverage Path Planning Based on Ant Colony Algorithm , 2008, 2008 15th International Conference on Mechatronics and Machine Vision in Practice.

[4]  Richard E. Korf,et al.  Time complexity of iterative-deepening-A* , 2001, Artif. Intell..

[5]  Marcel Tresanchez,et al.  Modeling floor-cleaning coverage performances of some domestic mobile robots in a reduced scenario , 2010, Robotics Auton. Syst..

[6]  Howie Choset,et al.  Morse Decompositions for Coverage Tasks , 2002, Int. J. Robotics Res..

[7]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[8]  Lúcia Valéria Ramos de Arruda,et al.  Autonomous navigation system using Event Driven-Fuzzy Cognitive Maps , 2011, Applied Intelligence.

[9]  Peter Yap,et al.  Grid-Based Path-Finding , 2002, Canadian Conference on AI.

[10]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[11]  Ioannis M. Rekleitis,et al.  Optimal coverage of a known arbitrary environment , 2010, 2010 IEEE International Conference on Robotics and Automation.

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

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

[14]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[15]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

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

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

[18]  Jordi Palacín,et al.  Measuring Coverage Performances of a Floor Cleaning Mobile Robot Using a Vision System , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[19]  Jin Bae Park,et al.  Complete coverage navigation of cleaning robots using triangular-cell-based map , 2004, IEEE Transactions on Industrial Electronics.

[20]  Michael R. M. Jenkin,et al.  Computational principles of mobile robotics , 2000 .

[21]  Sylvia C. Wong,et al.  Qualitative Topological Coverage of Unknown Environments by Mobile Robots , 2006 .

[22]  Sven Koenig,et al.  Terrain coverage with ant robots: a simulation study , 2001, AGENTS '01.

[23]  Adi Botea,et al.  Near Optimal Hierarchical Path-Finding , 2004, J. Game Dev..

[24]  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).

[25]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[26]  Ariel Felner,et al.  Theta*: Any-Angle Path Planning on Grids , 2007, AAAI.

[27]  Chaomin Luo,et al.  A Bioinspired Neural Network for Real-Time Concurrent Map Building and Complete Coverage Robot Navigation in Unknown Environments , 2008, IEEE Transactions on Neural Networks.