A collision-free transition path planning method for placement robots in complex environments

IF 5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Complex & Intelligent Systems Pub Date : 2024-09-09 DOI:10.1007/s40747-024-01585-y
Yanzhe Wang, Qian Yang, Weiwei Qu
{"title":"A collision-free transition path planning method for placement robots in complex environments","authors":"Yanzhe Wang, Qian Yang, Weiwei Qu","doi":"10.1007/s40747-024-01585-y","DOIUrl":null,"url":null,"abstract":"<p>In Automated Fiber Placement (AFP), the substantial structure of the placement robot, the variable mold shapes, and the limited free space pose significant challenges for planning collision-free robot transitions. The task involves planning a collision-free path within the robot's high-dimensional configuration space. Informed RRT* is a common approach for such problems but often struggles with efficiency and path quality in environments with large informed sampling spaces influenced by obstacles. To address these issues, this paper proposes an improved Informed RRT* algorithm with a Local Knowledge Acceleration sampling strategy (LKA-Informed RRT*), aimed at enhancing planning efficiency and adaptability in complex obstacle settings. An Adaptive Sampling Control (ASC) rate is introduced, measuring the algorithm’s convergence speed, guides the algorithm to switch between informed and local sampling adaptively. The proposed local sampling method uses failure nodes from the exploration process to estimate obstacle distributions, steering sampling toward regions that expedite path convergence. Experimental results show that LKA-Informed RRT* significantly outperforms state-of-the-art algorithms in convergence efficiency and path cost. Compared to the original Informed RRT*, the proposed method reduces planning time by about 60%, substantially boosting efficiency for collision-free transitions in complex environments.</p>","PeriodicalId":10524,"journal":{"name":"Complex & Intelligent Systems","volume":"22 1","pages":""},"PeriodicalIF":5.0000,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complex & Intelligent Systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s40747-024-01585-y","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

In Automated Fiber Placement (AFP), the substantial structure of the placement robot, the variable mold shapes, and the limited free space pose significant challenges for planning collision-free robot transitions. The task involves planning a collision-free path within the robot's high-dimensional configuration space. Informed RRT* is a common approach for such problems but often struggles with efficiency and path quality in environments with large informed sampling spaces influenced by obstacles. To address these issues, this paper proposes an improved Informed RRT* algorithm with a Local Knowledge Acceleration sampling strategy (LKA-Informed RRT*), aimed at enhancing planning efficiency and adaptability in complex obstacle settings. An Adaptive Sampling Control (ASC) rate is introduced, measuring the algorithm’s convergence speed, guides the algorithm to switch between informed and local sampling adaptively. The proposed local sampling method uses failure nodes from the exploration process to estimate obstacle distributions, steering sampling toward regions that expedite path convergence. Experimental results show that LKA-Informed RRT* significantly outperforms state-of-the-art algorithms in convergence efficiency and path cost. Compared to the original Informed RRT*, the proposed method reduces planning time by about 60%, substantially boosting efficiency for collision-free transitions in complex environments.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
复杂环境中放置机器人的无碰撞过渡路径规划方法
在自动纤维铺放(AFP)过程中,铺放机器人的庞大结构、多变的模具形状和有限的自由空间给规划机器人无碰撞过渡带来了巨大挑战。这项任务涉及在机器人的高维配置空间内规划无碰撞路径。知情 RRT* 是解决此类问题的常用方法,但在受障碍物影响的大型知情采样空间环境中,其效率和路径质量往往难以保证。为了解决这些问题,本文提出了一种带有本地知识加速采样策略(LKA-Informed RRT*)的改进型知情 RRT* 算法,旨在提高复杂障碍物环境下的规划效率和适应性。该算法引入了自适应采样控制(ASC)率,用于衡量算法的收敛速度,引导算法在知情采样和局部采样之间自适应切换。所提出的局部采样方法利用探索过程中的故障节点来估计障碍物分布,引导采样向能加快路径收敛的区域进行。实验结果表明,LKA-Informed RRT* 在收敛效率和路径成本方面明显优于最先进的算法。与最初的知情 RRT* 相比,所提出的方法将规划时间缩短了约 60%,大大提高了在复杂环境中进行无碰撞过渡的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Complex & Intelligent Systems
Complex & Intelligent Systems COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-
CiteScore
9.60
自引率
10.30%
发文量
297
期刊介绍: Complex & Intelligent Systems aims to provide a forum for presenting and discussing novel approaches, tools and techniques meant for attaining a cross-fertilization between the broad fields of complex systems, computational simulation, and intelligent analytics and visualization. The transdisciplinary research that the journal focuses on will expand the boundaries of our understanding by investigating the principles and processes that underlie many of the most profound problems facing society today.
期刊最新文献
Large-scale multiobjective competitive swarm optimizer algorithm based on regional multidirectional search Towards fairness-aware multi-objective optimization Low-frequency spectral graph convolution networks with one-hop connections information for personalized tag recommendation A decentralized feedback-based consensus model considering the consistency maintenance and readability of probabilistic linguistic preference relations for large-scale group decision-making A dynamic preference recommendation model based on spatiotemporal knowledge graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1