| 清洁机器人全覆盖路径规划算法综述． |
| |
| 引用本文： | 刘海,郭小勤,余得贵. 清洁机器人全覆盖路径规划算法综述．[J]. 机电产品开发与创新, 2008, 21(6): 36-38 |
| |
| 作者姓名： | 刘海 郭小勤 余得贵 |
| |
| 作者单位： | 深圳大学,机电与控制工程学院,广东,深圳,518060 |
| |
| 摘 要： | 各种应用型移动机器人的设计是目前研究的焦点，它具有广阔的科研价值和市场前景，而路径规划技术是其中关键技术之一。本文系统总结了当前全覆盖路径规划算法的主要研究成果，并在覆盖效率、算法实现难易等指标方面进行比较剖析，探讨了各种算法的优势和不足。最后，提出进一步研究的方向。
|
| 关 键 词： | 移动机器人 全覆盖路径规划算法 清洁机器人 栅格 子区域 |
Overview of CCPP Algorithms for Mobile Robots |
| |
| LIU Hai,GUO Xiao-Qin,YU De-Gui. Overview of CCPP Algorithms for Mobile Robots[J]. Development & Innovation of Machinery & Electrical Products, 2008, 21(6): 36-38 |
| |
| Authors: | LIU Hai GUO Xiao-Qin YU De-Gui |
| |
| Affiliation: | (College of Mechatronics and Control Engineering, Shenzhen University, Shenzhen Guangdong 518060, China) |
| |
| Abstract: | Many countries are focusing on the research of various kinds of mobile robots because of their rich value on scientific research and wide foreground on market. The path planning algorithm is one of the key technologies used in mobile robot design. In this paper, the main achievements on the algorithm research are summarized, some analysis and comparison is showed in the coverage efficiency and the feasibility to achieve the algorithms, and finally, the further research directions are pointed out. |
| |
| Keywords: | mobile robots complete coverage path planning grids sub-regions |
| 本文献已被 维普 万方数据 等数据库收录！ |
