| 基于对比优化的RRT路径规划改进算法 |
| |
| 引用本文： | 冯林,贾菁辉.基于对比优化的RRT路径规划改进算法[J].计算机工程与应用,2011,47(3):210-213. |
| |
| 作者姓名： | 冯林 贾菁辉 |
| |
| 作者单位： | 大连理工大学计算机科学与工程系,辽宁大连,116023 |
| |
| 基金项目： | 国家自然科学基金，辽宁省自然科学基金 |
| |
| 摘 要： | 针对动态环境下机器人RRT路径规划算法缺乏稳定性和偏离最优解的问题,提出一种基于对比优化的RRT路径规划改进算法。算法在新一周期的环境下,通过对上一周期路径树进行剪枝和重新规划得到一条稳定的路径,同时利用基本RRT算法规划出一条新路径,通过对比两条路径得到较优解。仿真和真实机器人实验结果均表明,改进的算法提高了动态复杂环境下RRT路径规划的稳定性,并保证了规划的路径逼近最优解。
|
| 关 键 词： | 路径规划 扩展随机树 动态环境 |
| 收稿时间： | 2009-9-8 |
| 修稿时间： | 2009-11-9
|
Improved algorithm of RRT path planning based on comparison optimization |
| |
| FENG Lin,JIA Jinghui.Improved algorithm of RRT path planning based on comparison optimization[J].Computer Engineering and Applications,2011,47(3):210-213. |
| |
| Authors: | FENG Lin JIA Jinghui |
| |
| Affiliation: | FENG Lin,JIA Jinghui |
| |
| Abstract: | Because the basic Rapidly-exploring Random Tree（RRT）path planning is unstable and not optimal in dynamic environment,an improved algorithm of robots RRT path planning based on comparison optimization is proposed.In each circle,a stable path can be obtained by trimming and replanning the tree in last circle,and a new path can be planned via the basic RRT method.Comparing these two paths,the optimal one can be found.From the results of simulations and experiments on mobile robots,it concludes that this algorithm can improve the stability of RRT path planning in dynamic environment,and ensures that the path is almost optimal. |
| |
| Keywords: | path planning Rapidly-exploring Random Tree（RRT） dynamic environment |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
