系统仿真学报 ›› 2025, Vol. 37 ›› Issue (10): 2643-2651.doi: 10.16182/j.issn1004731x.joss.24-0545

• 论文 • 上一篇    

采用RRT*算法和椭圆先验的机械臂约束规划研究

杨震, 苏丽, 成治雨   

  1. 哈尔滨工程大学 智能科学与工程学院,黑龙江 哈尔滨 150001
  • 收稿日期:2024-05-21 修回日期:2024-07-23 出版日期:2025-10-20 发布日期:2025-10-21
  • 通讯作者: 苏丽
  • 第一作者简介:杨震(1984-),女,讲师,博士,研究方向为系统辨识、机器人路径规划。
  • 基金资助:
    国家自然科学基金面上项目(62173103)

Research on Constrained Programming of Manipulator Using RRT* Algorithm and Ellipse Prior

Yang Zhen, Su Li, Cheng Zhiyu   

  1. College of Intelligent Systems Science and Engineering, Harbin Engineering University, Harbin 150001, China
  • Received:2024-05-21 Revised:2024-07-23 Online:2025-10-20 Published:2025-10-21
  • Contact: Su Li

摘要:

对约束规划问题中应用均匀采样策略的传统RRT*算法存在采样点非精确转向引导以及非必要的节点代价比较导致增加额外时间成本的问题,提出一种利用投影采样点启发式函数代价进行采样点椭圆先验判断的改进RRT*算法。基于椭圆先验判断采样点是否能够优化路径,缩短了规划时间。使用测地线进一步对投影采样点的当前代价进行预估。仿真结果表明:改进后的RRT*算法规划的路径相较于传统RRT*算法时间代价平均减少了73.27%,相较于将椭圆先验直接引入的RRT*算法路径代价平均减少4.49%。

关键词: 机械臂, 采样点, 约束规划, RRT*, 椭圆先验, 测地线, 时间代价, 路径代价

Abstract:

There are problems in the traditional RRT* algorithm using a uniform sampling strategy applied in constrained programming problems, such as inaccurate turning guidance of sampling points and unnecessary node cost comparisons, which lead to an increase in additional time costs. To address these issues, an improved RRT* algorithm was proposed. This algorithm leveraged a heuristic function cost of the projected sampling points to make an ellipse prior judgment on the sampling points. Based on the ellipse prior, the sampling points were judged to determine whether they could optimize the path and shorten the programming time. The geodesics were used to further estimate the current cost of the projected sampling points. Simulation results show that the planned path by the improved RRT* algorithm has an average time cost reduction of 73.27% compared to that by the traditional RRT* algorithm and an average path cost reduction of 4.49% compared to the RRT* algorithm that directly incorporates the ellipse prior.

Key words: manipulator, sampling point, constraint programming, RRT*, ellipse prior, geodesic, time cost, path cost

中图分类号: