Online complete coverage path planning using two-way proximity search

This paper presents an efficient online approach for complete coverage path planning of mobile robots in an unknown workspace based on online boustrophedon motion and an optimized backtracking mechanism. The presented approach first performs a single continuous boustrophedon motion until a critical point is reached. In order to completely cover the environment, next starting point is decided by using the accumulated knowledge of the environment map. An efficient backtracking technique based on proposed Two-way Proximity Search algorithm is used to plan a path from the critical point to the new starting point. Simulation results show the efficiency of proposed backtracking approach with improved total coverage time, coverage path length and memory requirements.

[1]  Ivan Petrović,et al.  Complete Coverage D* Algorithm for Path Planning of a Floor-Cleaning Mobile Robot , 2011 .

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

[3]  Miri Weiss-Cohen,et al.  Lawn Mowing System for Known Areas , 2008, 2008 International Conference on Computational Intelligence for Modelling Control & Automation.

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

[5]  Marc Carreras,et al.  Efficient seabed coverage path planning for ASVs and AUVs , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[6]  Salah Sukkarieh,et al.  3D smooth path planning for a UAV in cluttered natural environments , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[7]  Min-Ji Bae,et al.  Path tracking control coverage of a mining robot based on exhaustive path planning with exact cell decomposition , 2014, 2014 14th International Conference on Control, Automation and Systems (ICCAS 2014).

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

[9]  Giorgio C. Buttazzo,et al.  Energy-Aware Coverage Path Planning of UAVs , 2015, 2015 IEEE International Conference on Autonomous Robot Systems and Competitions.

[10]  Simon X. Yang,et al.  A Rolling Method for Complete Coverage Path Planning in Uncertain Environments , 2004, 2004 IEEE International Conference on Robotics and Biomimetics.

[11]  Marten Waanders.  Coverage Path Planning for Mobile Cleaning Robots , 2011 .

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

[13]  Junfei Qiao,et al.  Path planning algorithm based on sub-region for agricultural robot , 2010, 2010 2nd International Asia Conference on Informatics in Control, Automation and Robotics (CAR 2010).

[14]  Alexander Zelinsky,et al.  Planning Paths of Complete Coverage of an Unstructured Environment by a Mobile Robot , 2007 .

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

[16]  K. K. Bharadwaj,et al.  Spanning tree based terrain coverage by multi robots in unknown environments , 2008, 2008 Annual IEEE India Conference.

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

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

[19]  Anthony Stentz,et al.  Optimal and efficient path planning for partially-known environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[20]  Mario F. M. Campos,et al.  Multi-robot 3D coverage path planning for First Responders teams , 2016, 2016 IEEE International Conference on Automation Science and Engineering (CASE).

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

[22]  C. M. Witkowski.  A Parallel Processor Algorithm for Robot Route Planning , 1983, IJCAI.

[23]  Claus G. Sørensen,et al.  An Optimized Field Coverage Planning Approach for Navigation of Agricultural Robots in Fields Involving Obstacle Areas , 2013 .

[24]  Xin Yu,et al.  Coverage path planning based on a multiple sweep line decomposition , 2015, IECON 2015 - 41st Annual Conference of the IEEE Industrial Electronics Society.

[25]  Shiqiang Zhu,et al.  Combined coverage path planning for autonomous cleaning robots in unstructured environments , 2008, 2008 7th World Congress on Intelligent Control and Automation.

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

[27]  Simon Parsons,et al.  Principles of Robot Motion: Theory, Algorithms and Implementations by Howie Choset, Kevin M. Lynch, Seth Hutchinson, George Kantor, Wolfram Burgard, Lydia E. Kavraki and Sebastian Thrun, 603 pp., $60.00, ISBN 0-262-033275 , 2007, The Knowledge Engineering Review.

[28]  Ibrahim A. Hameed,et al.  Driving Angle and Track Sequence Optimization for Operational Path Planning Using Genetic Algorithms , 2011 .

[29]  Soon-Geul Lee,et al.  Time-efficient and complete coverage path planning based on flow networks for multi-robots , 2013 .

[30]  Benjamin J. Southwell,et al.  Human Object Recognition Using Colour and Depth Information from an RGB-D Kinect Sensor , 2013 .

[31]  Jian Jin,et al.  Optimal Coverage Path Planning for Arable Farming on 2D Surfaces , 2010 .

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

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

[34]  Jin-Wook Kim,et al.  Path planning algorithm to minimize an overlapped path and turning number for an underwater mining robot , 2015, 2015 15th International Conference on Control, Automation and Systems (ICCAS).

[35]  Ivan Petrovic,et al.  Complete coverage path planning of mobile robots for humanitarian demining , 2012, Ind. Robot.

[36]  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.

[37]  Yang Li,et al.  Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm , 2012, EMEIT 2012.