Research on Collision Avoidance Path Planning of Dual Manipulator Robot Based on Fusion Algorithm

Chenyang Sun, Xiangjun Liu, Runjie Shen
{"title":"Research on Collision Avoidance Path Planning of Dual Manipulator Robot Based on Fusion Algorithm","authors":"Chenyang Sun, Xiangjun Liu, Runjie Shen","doi":"10.1109/ICARCE55724.2022.10046590","DOIUrl":null,"url":null,"abstract":"When a dual manipulator robot performs handling operations in a complex space, it is important to plan a collision avoidance path to the target point quickly and accurately. In order to solve the problems of local minimum and high sampling randomness of traditional path planning algorithms, a new fusion algorithm is proposed for global path planning of a dual manipulator robot. First, an improved artificial potential field (IAPF) method is mentioned for path planning in the start and target point areas. Then, for the local minimum problem, an improved RRT algorithm (IRRT) based on the ε-greedy sampling target biasing strategy and repeated iterative update strategy is fused to reduce the randomness of random tree growth, and explore an optimal path that grows toward the target as much as possible for jumping out of the local minimum area. The URDF model file of the dual manipulator robot is created, and simulation experiments of path planning are conducted based on the Rviz visualization tool under Ros system, which proves the effectiveness of the fusion algorithm.","PeriodicalId":416305,"journal":{"name":"2022 International Conference on Automation, Robotics and Computer Engineering (ICARCE)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Automation, Robotics and Computer Engineering (ICARCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICARCE55724.2022.10046590","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

When a dual manipulator robot performs handling operations in a complex space, it is important to plan a collision avoidance path to the target point quickly and accurately. In order to solve the problems of local minimum and high sampling randomness of traditional path planning algorithms, a new fusion algorithm is proposed for global path planning of a dual manipulator robot. First, an improved artificial potential field (IAPF) method is mentioned for path planning in the start and target point areas. Then, for the local minimum problem, an improved RRT algorithm (IRRT) based on the ε-greedy sampling target biasing strategy and repeated iterative update strategy is fused to reduce the randomness of random tree growth, and explore an optimal path that grows toward the target as much as possible for jumping out of the local minimum area. The URDF model file of the dual manipulator robot is created, and simulation experiments of path planning are conducted based on the Rviz visualization tool under Ros system, which proves the effectiveness of the fusion algorithm.
基于融合算法的双机械手避碰路径规划研究
双机械手机器人在复杂空间中进行搬运作业时,快速准确地规划到目标点的避碰路径是十分重要的。针对传统路径规划算法存在的局部最小值和高采样随机性问题,提出了一种新的双机械手机器人全局路径规划融合算法。首先,提出了一种改进的人工势场(IAPF)方法,用于起始点和目标点区域的路径规划。然后,针对局部最小问题,将基于ε-贪心采样目标偏置策略和重复迭代更新策略的改进RRT算法(IRRT)融合在一起,降低随机树生长的随机性,探索一条尽可能向目标生长的最优路径,以跳出局部最小区域。建立了双机械手机器人的URDF模型文件,并在Ros系统下基于Rviz可视化工具进行了路径规划仿真实验,验证了融合算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信