Obstacle Avoidance Path Planning for Spherical Joint Actuator Based on Improved APF-Bi-RRT* Algorithm

IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Xiwen Guo, Bo Han, Qunjing Wang, Guoli Li, Zhibo Liu, Ao Tan
{"title":"Obstacle Avoidance Path Planning for Spherical Joint Actuator Based on Improved APF-Bi-RRT* Algorithm","authors":"Xiwen Guo,&nbsp;Bo Han,&nbsp;Qunjing Wang,&nbsp;Guoli Li,&nbsp;Zhibo Liu,&nbsp;Ao Tan","doi":"10.1002/cpe.70805","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>To avoid collisions between an end tool driven by a novel spherical joint actuator and surrounding obstacles during operations in static scenarios such as assembly and spraying, which may lead to system malfunctions, this paper proposes a method that integrates an improved artificial potential field (APF) and a dynamic target biasing strategy with the bidirectional rapidly-exploring random tree star (Bi-RRT*) algorithm. This approach, termed the Improved APF-Bi-RRT* algorithm, is combined with a novel collision detection method to achieve efficient path planning. Firstly, collision detection is reframed from analyzing contact between the end tool and obstacles to directly defining the unreachable region of the end point. On this basis, an environment map is reconstructed by leveraging the spherical motion characteristics of the end point, thereby satisfying workspace constraints while reducing the complexity of subsequent obstacle avoidance algorithms. Then, the Bi-RRT* algorithm is applied for path search on this map, and the improved APF and dynamic target biasing strategy are integrated into the search process to minimize redundant nodes and accelerate convergence. Finally, simulation and experimental results demonstrate that the proposed method not only ensures reliable obstacle avoidance for the end tool driven by the spherical joint actuator in static known obstacle environments, but also reduces planning time and path length compared with the RRT*, P-RRT*, Bi-RRT*, and APF-Bi-RRT* algorithms.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"38 12","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2026-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70805","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

To avoid collisions between an end tool driven by a novel spherical joint actuator and surrounding obstacles during operations in static scenarios such as assembly and spraying, which may lead to system malfunctions, this paper proposes a method that integrates an improved artificial potential field (APF) and a dynamic target biasing strategy with the bidirectional rapidly-exploring random tree star (Bi-RRT*) algorithm. This approach, termed the Improved APF-Bi-RRT* algorithm, is combined with a novel collision detection method to achieve efficient path planning. Firstly, collision detection is reframed from analyzing contact between the end tool and obstacles to directly defining the unreachable region of the end point. On this basis, an environment map is reconstructed by leveraging the spherical motion characteristics of the end point, thereby satisfying workspace constraints while reducing the complexity of subsequent obstacle avoidance algorithms. Then, the Bi-RRT* algorithm is applied for path search on this map, and the improved APF and dynamic target biasing strategy are integrated into the search process to minimize redundant nodes and accelerate convergence. Finally, simulation and experimental results demonstrate that the proposed method not only ensures reliable obstacle avoidance for the end tool driven by the spherical joint actuator in static known obstacle environments, but also reduces planning time and path length compared with the RRT*, P-RRT*, Bi-RRT*, and APF-Bi-RRT* algorithms.

基于改进APF-Bi-RRT*算法的球面关节驱动器避障路径规划
为避免在装配、喷涂等静态工况下,由新型球面关节作动器驱动的端刀与周围障碍物发生碰撞而导致系统故障,提出了一种将改进的人工势场(APF)和动态目标偏置策略与双向快速探索随机树形星(Bi-RRT*)算法相结合的方法。该方法被称为改进的APF-Bi-RRT*算法,该算法结合了一种新的碰撞检测方法来实现有效的路径规划。首先,将碰撞检测从分析末端工具与障碍物之间的接触转变为直接定义端点的不可达区域;在此基础上,利用端点的球面运动特征重构环境图,既满足工作空间约束,又降低后续避障算法的复杂度。然后,应用Bi-RRT*算法对该地图进行路径搜索,并将改进的APF和动态目标偏置策略集成到搜索过程中,以减少冗余节点,加快收敛速度。仿真和实验结果表明,与RRT*、P-RRT*、Bi-RRT*和APF-Bi-RRT*算法相比,所提方法不仅能保证在静态已知障碍物环境下球形关节驱动的端刀能够可靠地避障,而且能缩短规划时间和路径长度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书