首页|基于二次转角约束的改进RRT路径规划算法研究

基于二次转角约束的改进RRT路径规划算法研究

扫码查看
针对快速随机搜索树(RRT)算法存在节点扩展冗余、生成路径不满足车辆转角条件等问题,提出一种改进的二次转角约束RRT算法。首先,在传统RRT算法基础上对采样空间进行裁剪,引入目标导向策略减少采样时间;然后采用车辆膨胀处理和直线方法检测障碍物,并引入第一次转角约束得到粗解路径;接着对粗解路径建立二次转角约束并进行优化处理,获取优化路径后拟合,并进行仿真验证。结果表明,相比于引入目标导向策略的RRT算法,所提出的算法路径最大曲率降低了 34。33%,平均曲率降低47。36%,扩展节点数降低47。62%,路径距离降低7。76%,规划时间缩短14。98%。
Research on Improved RRT Path Planning Algorithm Based on Two-Time Steer Angel Constraint
Aiming at the problems that the Rapid-exploration Random Tree(RRT)algorithm is easy to lead to node expansion redundancy and the generated path does not meet the vehicle rotation angle constraint,an improved secondary rotation angle constraint RRT algorithm is proposed.Based on the traditional RRT algorithm,the sampling space is first cut,and the target offset strategy is introduced to reduce the sampling time.Then,the vehicle expansion processing and the straight line method are used to detect the obstacle collision,and the first rotation angle constraint is introduced to obtain the coarse solution path.Then,the secondary angle constraint optimization processing is established for the rough solution path,and the vehicle optimization path is obtained and fitted,and the simulation verification is carried out.The results show that compared with the biased RRT algorithm with the goal-oriented strategy,the maximum curvature of the path is reduced by 34.33%,the average curvature is reduced by 47.36%,the number of extended nodes is reduced by 47.62%,the path distance is reduced by 7.76%,and the planning time is reduced by 14.98%.

Improved RRT algorithmSteering angle constrainPath planningPath curvaturePath smoothness

鲍家定、钟国安、马果、徐海军、景晖

展开 >

桂林电子科技大学,桂林 541004

柳州五菱汽车工业有限公司,柳州 545007

改进RRT算法 转向角度约束 路径规划 路径曲率 路径平滑性

国家自然科学基金项目广西创新驱动重大专项项目广西创新驱动重大专项项目

52262052桂科AA22372桂科AA23062003

2024

汽车技术
中国汽车工程学会 长春汽车研究所

汽车技术

CSTPCD北大核心
影响因子:0.522
ISSN:1000-3703
年,卷(期):2024.(6)