Combined coverage path planning for autonomous cleaning robots in unstructured environments

Complete coverage path planning is a key problem for autonomous cleaning robots, which concerns not only the cleaning efficiency but also the adaptability to unstructured environments. But the diversity of environments and limited perception ability of the robot make the problem still unsolved. In this paper, a novel strategy of combined coverage path planning is proposed, which combines the random path planning and local complete coverage path planning. The random planning lets the robot run straight until an obstacle is encountered. After turning a random angle, the robot continues the straight run. This mode is easy to implement and can provide the robot with the flexibility to environments. And local complete coverage path planning works out a comb-like path depending on dead reckoning. The comb-like path can cover every part in a relative small area. All these functions are just based on general hardware: ultrasonic sensors, infrared sensors, incremental encoders, DC motors, vacuum, etc. Finally the experiment shows that this strategy can work efficiently and robustly in common family environments.

[1]  Shiqiang Zhu,et al.  Sensory navigation of autonomous cleaning robots , 2004, Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).

[2]  Wolfram Burgard,et al.  Active Markov localization for mobile robots , 1998, Robotics Auton. Syst..

[3]  Wu Qing.  A Study on Markov Localization for Mobile Robots , 2003 .

[4]  Chaomin Luo,et al.  Real-time area-covering operations with obstacle avoidance for cleaning robots , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[5]  M. I. Ribeiro,et al.  Complete coverage path planning and guidance for cleaning robots , 1997, ISIE '97 Proceeding of the IEEE International Symposium on Industrial Electronics.

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

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

[8]  Yili Fu,et al.  Fuzzy logic based mobile robot area filling with vision system for indoor environments , 1999, Proceedings 1999 IEEE International Symposium on Computational Intelligence in Robotics and Automation. CIRA'99 (Cat. No.99EX375).

[9]  Kamal K. Gupta,et al.  Simultaneous path planning and free space exploration with skin sensor , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[10]  Li Zhang,et al.  Line segment based map building and localization using 2D laser rangefinder , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

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

[12]  David W. Murray,et al.  Simultaneous Localization and Map-Building Using Active Vision , 2002, IEEE Trans. Pattern Anal. Mach. Intell..