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, Bo Han, Qunjing Wang, Guoli Li, Zhibo Liu, 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.
期刊介绍:
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.