期刊文献+

智能机械全覆盖路径规划算法综述 被引量:16

Review on Coverage Path Planning Algorithm for Intelligent Machinery
下载PDF
导出
摘要 全覆盖路径规划算法是智能移动机械的核心内容之一,涉及军事、农业、生产制造和民用等多个应用领域,而应用环境包含了空中、地面和水下,因此关于全覆盖路径规划算法的研究具有很高的科研价值;从全覆盖路径规划算法的基本概念、工作条件、应用背景、国内外研究现状等方面对目前主流的规划算法进行了综述;根据工作环境信息是否已知,将其归类为"离线式"和"在线式"两种工作方式,并从覆盖完整程度、工作效率、能耗成本和实现难易程度等方面分析讨论了各种算法的优势与不足之处,并对全覆盖路径规划算法的研究趋势进行了展望。 The coverage path planning algorithm is indispensable to intelligent mobile machines, such as demining robots, autonomous underwater vehicles, plant protection UAVs, automatic painting robots, cleaning robots and some other applications, involving many areas like military, agriculture, manufacturing and civilian, so the algorithm has rich value on scientific research and business market. In this arti- cle, a variety of current mainstream coverage path planning algorithms are described. Based on the working environment information is known or not, coverage path planning algorithms are divided into two types of "off--line" and "on--line". This article introduces off--line algorithms such as trapezoidal decomposition, boustrophedon cellular decomposition, line--sweep--based decomposition method, grid meth od of known spaces and quad--tree method, on--line algorithms such as neural network--based coverage, grid--based coverage using span- ning trees and so on. This article also analyses and compares coverage completeness, efficiency, energy costs and achievement difficulty of each coverage path planning algorithm, advantages and pitfalls of each algorithm are pointed out. The technology development trends of cov- erage path planning algorithm for intelligent machinery are given in this article, multi--intelligent fusion algorithm can compensate for defi- ciencies of single--intelligent one, and it will be the future trend.
出处 《计算机测量与控制》 2016年第10期1-5,53,共6页 Computer Measurement &Control
基金 北京市科技计划资助项目(D151100001215003) 2015年度科技创新基地培育与发展专项项目(Z151100001615016) 北京市自然科学基金资助项目(6164032)
关键词 全覆盖路径规划算法 移动机器人 智能机械 单元分解 栅格法 神经网络 coverage path planning mobile robot intelligent machinery grid method cellular decomposition neural network
  • 相关文献

参考文献50

  • 1Galceran E, Carreras M. A survey on coverage path planning for ro- botics [J]. Robotics & Autonomous Systems, 2013, 61 (12): 1258- 1276. 被引量:1
  • 2宋锦娟,白艳萍.一种改进的蚁群算法及其在TSP中的应用[J].数学的实践与认识,2012,42(18):154-162. 被引量:8
  • 3蔡光跃,董恩清.遗传算法和蚁群算法在求解TSP问题上的对比分析[J].计算机工程与应用,2007,43(10):96-98. 被引量:29
  • 4Arkin E M, Hassin R. Approximation algorithms for the geometric covering salesman problem [J]. Discrete Applied Mathematics, 1994, 55 (3): 197-218. 被引量:1
  • 5Li F, Klette R. An Approximate Algorithm for Solving the Watch- man Route Problem [J]. Lecture Notes in Computer Science, 2008, 4931:189-206. 被引量:1
  • 6Choset H. Coverage for robotics - A survey of recent results [J]. Annals of Mathematics & Artificial Intelligence, 2001, 31 (1-4) : 113 - 126. 被引量:1
  • 7Choset H, Pignon P. Coverage Path Planning: The Boustrophedon Cellular Decomposition [A]. Proceedings of International Confer- ence on Field and Service Robotics [C]. 1997:203 -209. 被引量:1
  • 8Rekleitis I, Ai P N, Rankin E S, et al. Efficient Boustrophedon Multi-Robot Coverage: an algorithmic approach [J]. Annals of Mathematics & Artificial Intelligence, 2008, 52 (2 - 4): 109 - 142. 被引量:1
  • 9Hert S, Tiwari S, Lumelsky V. A Terrain-Covering Algorithm for an AUV [J]. Autonomous Robots,1999, 3(2/3) :91 - 119(29). 被引量:1
  • 10Nieoud J D, Habib M K. The Pemex-B autonomous demining ro- bot: perception and navigation strategies [ A]. Proceedings of 1995 IEEE International Conference on Intelligent Robots and Sys- tems, 1995, 1: 419-424. 被引量:1

二级参考文献140

共引文献219

同被引文献180

引证文献16

二级引证文献129

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部