A computationally efficient complete area coverage algorithm for intelligent mobile robot navigation

Complete area coverage navigation (CAC) requires a special type of robot path planning, where the robots should visit every point of the state workspace. CAC is an essential issue for cleaning robots and many other robotic applications. Real-time complete area coverage path planning is desirable for efficient performance in many applications. In this paper, a novel vertical cell-decomposition (VCD) with convex hull (VCD-CH) approach is proposed for real-time CAC navigation of autonomous mobile robots. In this model, a vertical cell-decomposition (VCD) methodology and a spanning-tree based approach with convex hull are effectively integrated to plan a complete area coverage motion for autonomous mobile robot navigation. The computational complexity of this method with minimum trajectory length planned by a cleaning robot in the complete area coverage navigation with rectangle obstacles in the Euclidean space is O(n log n). The performance analysis, computational validation and comparison studies demonstrate that the proposal model is computational efficient, complete and robust.

[1]  Chee-Keng Yap,et al.  Algorithmic and geometric aspects of robotics , 1987 .

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

[3]  Tae-Yong Kuc,et al.  A search and coverage algorithm for mobile robot , 2011, 2011 8th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI).

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

[5]  Hans P. Moravec,et al.  High resolution maps from wide angle sonar , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[6]  Anthony Stentz,et al.  First results in vision-based crop line tracking , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[7]  Ju Yong Park,et al.  A study on the cleaning algorithm for autonomous mobile robot under the unknown environment , 1997, Proceedings 6th IEEE International Workshop on Robot and Human Communication. RO-MAN'97 SENDAI.

[8]  Howie Choset,et al.  Complete sensor-based coverage with extended-range detectors: a hierarchical decomposition in terms of critical points and Voronoi diagrams , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

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

[10]  Douglas W. Gage,et al.  Randomized search strategies with imperfect sensors , 1994, Other Conferences.

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

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

[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]  Richard Pawson,et al.  Robot control system for window cleaning , 1994, Proceedings of 1994 American Control Conference - ACC '94.

[15]  Chaomin Luo,et al.  A solution to vicinity problem of obstacles in complete coverage path planning , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[16]  Makoto Yamada,et al.  Cleaning robot control , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

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

[18]  Anthony Stentz,et al.  Vision-based perception for an automated harvester , 1997, Proceedings of the 1997 IEEE/RSJ International Conference on Intelligent Robot and Systems. Innovative Robotics for Real-World Applications. IROS '97.

[19]  Noa Agmon,et al.  Constructing spanning trees for efficient multi-robot coverage , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

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

[22]  Howie Choset,et al.  Sensor-based planning: exact cellular decompositions in terms of critical points , 2001, SPIE Optics East.

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

[24]  Jin Bae Park,et al.  Complete coverage navigation of clean robot based on triangular cell map , 2001, ISIE 2001. 2001 IEEE International Symposium on Industrial Electronics Proceedings (Cat. No.01TH8570).

[25]  Chee-Keng Yap,et al.  A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.

[26]  Gisbert Lawitzky.  A Navigation System for Cleaning Robots , 2000, Auton. Robots.