基于改进 RRT 算法的双臂避障运动规划

Machines Pub Date : 2024-07-12 DOI:10.3390/machines12070472
Zhe Dong, Binrui Zhong, Jiahuan He, Zhao Gao
{"title":"基于改进 RRT 算法的双臂避障运动规划","authors":"Zhe Dong, Binrui Zhong, Jiahuan He, Zhao Gao","doi":"10.3390/machines12070472","DOIUrl":null,"url":null,"abstract":"This paper proposes a solution for the cooperative obstacle avoidance path planning problem in dual manipulator arms using an improved Rapidly Exploring Random Tree (RRT) algorithm. The dual manipulator arms are categorized into a main arm and a secondary arm. Initially, the obstacle avoidance path for the master arm is planned in the presence of static obstacles. Subsequently, the poses of the master arm during its movement are treated as dynamic obstacles for planning the obstacle avoidance path for the slave arm. A cost function incorporating a fast convergence policy is introduced. Additionally, adaptive weights between distance cost and variation cost are innovatively integrated into the cost function, along with increased weights for each joint, enhancing the algorithm’s effectiveness and feasibility in practical scenarios. The smoothness of the planned paths is improved through the introduction of interpolation functions. The improved algorithm is numerically modeled and simulated in MATLAB. The verification results demonstrate that the improved RRT algorithm proposed in this paper is both feasible and more efficient.","PeriodicalId":509264,"journal":{"name":"Machines","volume":"49 3","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dual-Arm Obstacle Avoidance Motion Planning Based on Improved RRT Algorithm\",\"authors\":\"Zhe Dong, Binrui Zhong, Jiahuan He, Zhao Gao\",\"doi\":\"10.3390/machines12070472\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a solution for the cooperative obstacle avoidance path planning problem in dual manipulator arms using an improved Rapidly Exploring Random Tree (RRT) algorithm. The dual manipulator arms are categorized into a main arm and a secondary arm. Initially, the obstacle avoidance path for the master arm is planned in the presence of static obstacles. Subsequently, the poses of the master arm during its movement are treated as dynamic obstacles for planning the obstacle avoidance path for the slave arm. A cost function incorporating a fast convergence policy is introduced. Additionally, adaptive weights between distance cost and variation cost are innovatively integrated into the cost function, along with increased weights for each joint, enhancing the algorithm’s effectiveness and feasibility in practical scenarios. The smoothness of the planned paths is improved through the introduction of interpolation functions. The improved algorithm is numerically modeled and simulated in MATLAB. The verification results demonstrate that the improved RRT algorithm proposed in this paper is both feasible and more efficient.\",\"PeriodicalId\":509264,\"journal\":{\"name\":\"Machines\",\"volume\":\"49 3\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Machines\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3390/machines12070472\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Machines","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/machines12070472","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文采用改进的快速探索随机树(RRT)算法,提出了双机械臂协同避障路径规划问题的解决方案。双机械臂分为主机械臂和副机械臂。首先,在存在静态障碍物的情况下规划主机械臂的避障路径。随后,主机械臂在运动过程中的姿势被视为动态障碍物,用于规划副机械臂的避障路径。引入了一个包含快速收敛策略的成本函数。此外,成本函数中还创新性地加入了距离成本和变化成本之间的自适应权重,并增加了每个关节的权重,从而提高了算法在实际场景中的有效性和可行性。通过引入插值函数,改进了规划路径的平滑性。改进算法在 MATLAB 中进行了数值建模和仿真。验证结果表明,本文提出的改进 RRT 算法既可行又更高效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dual-Arm Obstacle Avoidance Motion Planning Based on Improved RRT Algorithm
This paper proposes a solution for the cooperative obstacle avoidance path planning problem in dual manipulator arms using an improved Rapidly Exploring Random Tree (RRT) algorithm. The dual manipulator arms are categorized into a main arm and a secondary arm. Initially, the obstacle avoidance path for the master arm is planned in the presence of static obstacles. Subsequently, the poses of the master arm during its movement are treated as dynamic obstacles for planning the obstacle avoidance path for the slave arm. A cost function incorporating a fast convergence policy is introduced. Additionally, adaptive weights between distance cost and variation cost are innovatively integrated into the cost function, along with increased weights for each joint, enhancing the algorithm’s effectiveness and feasibility in practical scenarios. The smoothness of the planned paths is improved through the introduction of interpolation functions. The improved algorithm is numerically modeled and simulated in MATLAB. The verification results demonstrate that the improved RRT algorithm proposed in this paper is both feasible and more efficient.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信