Smooth joint motion planning for redundant fiber placement manipulator based on improved RRT*

IF 9.1 1区 计算机科学 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
{"title":"Smooth joint motion planning for redundant fiber placement manipulator based on improved RRT*","authors":"","doi":"10.1016/j.rcim.2024.102851","DOIUrl":null,"url":null,"abstract":"<div><p>In automated fiber placement (AFP), addressing the continuous motion planning challenge of redundant layup manipulators in complex environments, this paper proposes an offline redundancy optimization algorithm based on improved RRT* (Rapidly-exploring Random Trees). This algorithm maximizes the utilization of kinematic redundancy to derive smooth joint trajectories devoid of collisions and singularities. Firstly, the algorithm entails constructing a search map by eliminating joint configurations that violate constraints, and subsequently planning and optimizing the joint path by minimizing a multi-objective cost under the map constraint. Furthermore, several strategies are introduced to enhance RRT* for redundancy optimization. These strategies include a piecewise Gaussian sampling strategy (PGSS) to guide efficient tree growth within complex channels and enable joint sampling constrained by task coordinates. Additionally, the improved Steering and Local Optimization method are proposed to plan joint motion while considering intermediate task sequences. The effectiveness of the proposed algorithm is demonstrated in handling complex motion planning scenarios, such as layup involving complex path curves or dense obstacles. Experimental results validate the algorithm's capability to find feasible collision-free and singularity-free paths in relevant scenarios, provided such paths exist. Moreover, trajectory smoothness is optimized with increasing iterations.</p></div>","PeriodicalId":21452,"journal":{"name":"Robotics and Computer-integrated Manufacturing","volume":null,"pages":null},"PeriodicalIF":9.1000,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Robotics and Computer-integrated Manufacturing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0736584524001388","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

In automated fiber placement (AFP), addressing the continuous motion planning challenge of redundant layup manipulators in complex environments, this paper proposes an offline redundancy optimization algorithm based on improved RRT* (Rapidly-exploring Random Trees). This algorithm maximizes the utilization of kinematic redundancy to derive smooth joint trajectories devoid of collisions and singularities. Firstly, the algorithm entails constructing a search map by eliminating joint configurations that violate constraints, and subsequently planning and optimizing the joint path by minimizing a multi-objective cost under the map constraint. Furthermore, several strategies are introduced to enhance RRT* for redundancy optimization. These strategies include a piecewise Gaussian sampling strategy (PGSS) to guide efficient tree growth within complex channels and enable joint sampling constrained by task coordinates. Additionally, the improved Steering and Local Optimization method are proposed to plan joint motion while considering intermediate task sequences. The effectiveness of the proposed algorithm is demonstrated in handling complex motion planning scenarios, such as layup involving complex path curves or dense obstacles. Experimental results validate the algorithm's capability to find feasible collision-free and singularity-free paths in relevant scenarios, provided such paths exist. Moreover, trajectory smoothness is optimized with increasing iterations.

基于改进 RRT* 的冗余光纤放置机械手平滑关节运动规划
在自动纤维铺放(AFP)中,为了解决冗余铺放机械手在复杂环境中的连续运动规划难题,本文提出了一种基于改进的 RRT*(快速探索随机树)的离线冗余优化算法。该算法最大限度地利用了运动学冗余,从而得出没有碰撞和奇点的平滑关节轨迹。首先,该算法需要通过消除违反约束条件的关节配置来构建搜索图,然后在搜索图约束条件下通过最小化多目标成本来规划和优化关节路径。此外,还引入了几种策略来增强 RRT* 的冗余优化能力。这些策略包括片断高斯采样策略(PGSS),用于指导复杂通道内树的有效生长,并实现受任务坐标约束的联合采样。此外,还提出了改进的转向和局部优化方法,以便在考虑中间任务序列的同时规划联合运动。在处理复杂的运动规划场景(如涉及复杂路径曲线或密集障碍物的铺设)时,演示了所提算法的有效性。实验结果验证了该算法在相关场景中找到可行的无碰撞和无奇异点路径的能力,前提是存在此类路径。此外,随着迭代次数的增加,轨迹平滑度也得到了优化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Robotics and Computer-integrated Manufacturing
Robotics and Computer-integrated Manufacturing 工程技术-工程:制造
CiteScore
24.10
自引率
13.50%
发文量
160
审稿时长
50 days
期刊介绍: The journal, Robotics and Computer-Integrated Manufacturing, focuses on sharing research applications that contribute to the development of new or enhanced robotics, manufacturing technologies, and innovative manufacturing strategies that are relevant to industry. Papers that combine theory and experimental validation are preferred, while review papers on current robotics and manufacturing issues are also considered. However, papers on traditional machining processes, modeling and simulation, supply chain management, and resource optimization are generally not within the scope of the journal, as there are more appropriate journals for these topics. Similarly, papers that are overly theoretical or mathematical will be directed to other suitable journals. The journal welcomes original papers in areas such as industrial robotics, human-robot collaboration in manufacturing, cloud-based manufacturing, cyber-physical production systems, big data analytics in manufacturing, smart mechatronics, machine learning, adaptive and sustainable manufacturing, and other fields involving unique manufacturing technologies.
×
引用
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学术官方微信