Research on path smoothing optimisation based on improved RRT-Connect algorithm and third-order Bezier curve

平滑的 运动规划 任意角度路径规划 数学优化 算法 路径(计算) 最短路径问题 Dijkstra算法 计算机科学 计算 还原(数学) 避障 贪婪算法 数学 图形 人工智能 机器人 移动机器人 理论计算机科学 计算机视觉 程序设计语言 几何学
作者
Zhu’An Zheng,Shuangjian Xie,Zimo Ye,Xiangyu Zheng,YU Zhi-wei
出处
期刊:Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science [SAGE Publishing]
卷期号:239 (7): 2544-2561 被引量:3
标识
DOI:10.1177/09544062241305524
摘要

Aiming at the deficiencies of the original RRT-Connect path planning algorithm in dealing with obstacle avoidance, planning efficiency and path smoothing in static environments, an improved path optimisation method is proposed by fusing the RRT-Connect path planning algorithm with the greedy search strategy and using a third-order Bezier curve for path smoothing. Firstly, a greedy algorithm is added to the path planning process of the original RRT-Connect algorithm to guide the search direction, so as to make the path search more goal oriented, reduce the time of path planning and improve the efficiency. Secondly, the generated paths are smoothed with third-order Bezier curves to ensure the generation of smooth paths with continuous curvature and improve the quality of the planned paths. Finally, the improved RRT-Connect smoothing optimisation algorithm is simulated with the original RRT-Connect, A* and Dijkstra algorithms in different simulation environments to check the performance of the optimised algorithm. The results show that the success rate of obstacle avoidance in planning paths of the optimised algorithms are all 100%, and compared with the original RRT-Connect algorithm, the improved RRT-Connect smoothing optimisation algorithm has an overall reduction of 12.02% in planning path length, an overall reduction of 40.22% in computation time and an overall improvement of 69.15% in path smoothness. Compared to the A* algorithm, which is based on the graph search shortest path planning algorithm and takes the shortest time, there is an overall reduction of 62.46% in computation time. The improved RRT-Connect smoothing optimisation algorithm has shorter path planning lengths, smoother paths and shortest computation time in different simulation environments. Meanwhile, the stability of the optimisation algorithm is effectively improved in different environments and different running times.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
无极微光的应助被lyn123采纳,获得20
刚刚
ubless607发布了新的文献求助10
刚刚
科研通AI2S的应助被科研通管家采纳,获得10
1秒前
大个的应助被科研通管家采纳,获得10
1秒前
bkagyin的应助被科研通管家采纳,获得10
1秒前
rainbow发布了新的文献求助10
1秒前
1秒前
orixero的应助被科研通管家采纳,获得10
2秒前
完美世界的应助被科研通管家采纳,获得10
2秒前
英俊的铭的应助被科研通管家采纳,获得10
2秒前
旧辞发布了新的文献求助10
2秒前
英俊的铭的应助被科研通管家采纳,获得10
2秒前
2秒前
搜集达人的应助被科研通管家采纳,获得10
2秒前
2秒前
科目三的应助被贪吃的懒羊羊采纳,获得10
2秒前
Lucas的应助被科研通管家采纳,获得10
2秒前
orixero的应助被科研通管家采纳,获得10
2秒前
浅唱夏末完成签到,获得积分10
2秒前
ding的应助被科研通管家采纳,获得10
2秒前
木由柚子发布了新的文献求助10
3秒前
脑洞疼的应助被科研通管家采纳,获得10
3秒前
3秒前
fantasy的应助被科研通管家采纳,获得10
3秒前
爆米花的应助被科研通管家采纳,获得30
3秒前
lisbattery完成签到,获得积分10
3秒前
3秒前
Haj1mi发布了新的文献求助10
3秒前
所所的应助被科研通管家采纳,获得10
3秒前
sufu_jony的应助被科研通管家采纳,获得10
3秒前
3秒前
慕青的应助被科研通管家采纳,获得10
3秒前
CipherSage的应助被科研通管家采纳,获得10
4秒前
wy.he的应助被车访枫采纳,获得10
4秒前
科目三的应助被科研通管家采纳,获得10
4秒前
李爱国的应助被科研通管家采纳,获得10
4秒前
彭于晏的应助被科研通管家采纳,获得10
4秒前
乐乐的应助被科研通管家采纳,获得10
4秒前
4秒前
4秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
八旗制度の研究 600
高分子基功能界面水蒸发材料与应用研究 500
外场增强的水汽发电研究 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8187572
求助须知:如何正确求助?哪些是违规求助? 9575676
关于积分的说明 21842241
捐赠科研通 7785368
什么是DOI,文献DOI怎么找? 3435022
关于科研通互助平台的介绍 2559428
邀请新用户注册赠送积分活动 2481917