期刊文献+

基于改进RRT*FN的移动机器人路径规划算法 被引量:11

Mobile Robot Path Planning Algorithm Based on Improved RRT*FN
下载PDF
导出
摘要 针对复杂环境下移动机器人的全局最优路径规划,提出一种基于目标偏置扩展和贝塞尔(Bezier)插值方法的改进RRT*FN路径规划算法.改进算法在未找到初始路径时采用一定概率进行随机点的目标偏置选择,确定初始路径后使用启发式采样方法,使随机采样点围绕初始路径进行迭代选择,提高路径规划的导向性.当改进算法还未找到初始路径时,删除树中远离目标点并且没有子节点的节点;当改进算法找到初始路径时,删除树中远离最优路径且没有子节点的节点,保留高性能节点,提高算法收敛到最优路径的效率.利用贝塞尔(Bezier)插值方法平滑路径.在MATLAB仿真平台和ROS机器人仿真平台分别进行2D和3D的对比实验,结果验证了所提算法的有效性和优越性. Aiming at the global optimal path planning of mobile robots in complex environments,an improved RRT*FN path planning algorithm based on target bias extension and Bezier interpolation method is proposed.The improved algorithm adopts a certain probability to select the target bias of random points when the initial path is not found.After determining the initial path,the heuristic sampling method is used to make random sampling points iteratively select around the initial path,which improves the guidance of path planning.When the improved algorithm has not found the initial path,the nodes far from the target point and no child nodes in the tree are deleted.When the improved algorithm finds the initial path,the nodes far from the optimal path and without child nodes in the tree are deleted,and the high-performance nodes are reserved to improve the efficiency of algorithm convergence to the optimal path.The path is smoothed by Bezier interpolation.2 D and 3 D comparative experiments were carried out on MATLAB simulation platform and ROS robot simulation platform respectively.The effectiveness and superiority of the proposed algorithm are verified.
作者 王海芳 崔阳阳 李鸣飞 李广宇 WANG Hai-fang;CUI Yang-yang;LI Ming-fei;LI Guang-yu(School of Control Engineering,Northeastern University at Qinhuangdao,Qinhuangdao 066004,China)
出处 《东北大学学报(自然科学版)》 EI CAS CSCD 北大核心 2022年第9期1217-1224,1249,共9页 Journal of Northeastern University(Natural Science)
基金 国家自然科学基金资助项目(51905080)。
关键词 快速探索随机树 全局路径规划 目标偏置选择 贝塞尔插值 ROS机器人仿真平台 rapid-exploration random trees global path planning target bias selection Bezier interpolation ROS robot simulation platform
  • 相关文献

参考文献4

二级参考文献20

  • 1唐华斌,王磊,孙增圻.基于随机采样的运动规划综述[J].控制与决策,2005,20(7):721-726. 被引量:10
  • 2张涛,柳重堪,张军.卫星时变拓扑网络最短路径算法研究[J].计算机学报,2006,29(3):371-377. 被引量:24
  • 3Whitworth, C.C.,Duller, A.W.G.,Jones, D.I.,Earp, G.K.Aerial video inspection of overhead power lines. Power Engineering . 2001
  • 4Lavalle SM.Rapidly-exploring random trees: A new tool for path planning. Technical Report TR98-11 . 1998
  • 5Karaman, Sertac,Frazzoli, Emilio.Sampling-based algorithms for optimal motion planning. International Journal of Robotics Research . 2011
  • 6Y. Kuwata,J. Teo,S. Karaman,G. Fiore,J. P. How."Motion planning in complex environments using closed-loop prediction,". AIAA Guidance,Navigation,and Control Conference . 2008
  • 7Olzhas Adjyatov,Huseyin Atakan Varol.Rapidlyexploring random tree based memory efficient motion planning. Proc of 20131EEE International Conference on Mechatronics&Automation; . 2013
  • 8LaValle S M.Planning algorithms. . 2006
  • 9朱大奇,颜明重.移动机器人路径规划技术综述[J].控制与决策,2010,25(7):961-967. 被引量:331
  • 10魏唯,欧阳丹彤,吕帅,冯宇轩.动态不确定环境下多目标路径规划方法[J].计算机学报,2011,34(5):836-846. 被引量:26

共引文献63

同被引文献119

引证文献11

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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