Improved RRT*-Connect Manipulator Path Planning in a Multi-Obstacle Narrow Environment.

Sensors (Basel)

National Engineering Laboratory for Big Data System Computing Technology, Shenzhen University, Shenzhen 518000, China.

Published: April 2025


Category Ranking

98%

Total Visits

921

Avg Visit Duration

2 minutes

Citations

20

Article Abstract

This paper proposes an improved RRT*-Connect algorithm (IRRT*-Connect) for robotic arm path planning in narrow environments with multiple obstacles. A heuristic sampling strategy is adopted with the integration of the ellipsoidal subset sampling and goal-biased sampling strategies, which can continuously compress the sampling space to enhance the sampling efficiency. During the node expansion process, an adaptive step-size method is introduced to dynamically adjust the step size based on the obstacle information, while a node rejection strategy is used to accelerate the search process so as to generate a near-optimal collision-free path. A pruning optimization strategy is also proposed to eliminate the redundant nodes from the path. Furthermore, a cubic non-uniform B-spline interpolation algorithm is applied to smooth the generated path. Finally, simulation experiments of the IRRT*-Connect algorithm are conducted in Python and ROS, and physical experiments are performed on a UR5 robotic arm. By comparing with the existing algorithms, it is demonstrated that the proposed method can achieve shorter planning times and lower path costs of the manipulator operation.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC12030666PMC
http://dx.doi.org/10.3390/s25082364DOI Listing

Publication Analysis

Top Keywords

improved rrt*-connect
8
path planning
8
robotic arm
8
path
6
sampling
5
rrt*-connect manipulator
4
manipulator path
4
planning multi-obstacle
4
multi-obstacle narrow
4
narrow environment
4

Similar Publications

Aiming at the challenge of trajectory planning for a continuum manipulator in the confined spaces of gas-insulated switchgear (GIS) chambers during intelligent operation and maintenance of power equipment, this paper proposes a configuration space (C-space) obstacle-avoidance planning method based on an improved RRT-Connect algorithm. By constructing a virtual joint-space obstacle map, the collision-avoidance problem in Cartesian space is transformed into a joint-space path search problem, significantly reducing the computational burden of frequent inverse kinematics solutions inherent in traditional methods. Compared to the RRT-Connect algorithm, improvements in node expansion strategies and greedy optimization mechanisms effectively minimize redundant nodes and enhance path generation efficiency: the number of iterations is reduced by 68% and convergence speed is improved by 35%.

View Article and Find Full Text PDF

In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. To solve the problem of scattered sampling points in the RRT-Connect algorithm, a goal-biased strategy is introduced. To address the problem of slow expansion caused by using fixed step sizes, a dynamic step size strategy is introduced to dynamically adjust the step size.

View Article and Find Full Text PDF

This paper addresses the path planning problem in high-dimensional complex environments and proposes an improved FRRT*-Connect algorithm to enhance the efficiency, precision, and robustness of path generation. The algorithm first introduces a goal-directed attractive force control mechanism, integrating artificial potential field methods to guide the tree expansion more effectively toward the goal, thereby reducing redundant sampling and significantly improving convergence speed. Secondly, an adaptive step-size strategy is proposed, dynamically adjusting the tree expansion step size based on the complexity of the environment, which enhances the algorithm's adaptability in narrow passages and complex topological structures, effectively avoiding local minima.

View Article and Find Full Text PDF

In view of the large randomness, redundant path nodes, and low search efficiency of RRT-connect in a complex obstacle environment, this study intends to develop a path-planning method combining RRT-connect and Informed RRT*. First, to solve the problem of large sampling randomness, the Informed RRT* algorithm is combined to adopt a simpler rectangle and limit the sampling range to the rectangle. Second, for the poor quality of the search path, the dynamic step size is used for growth extension, the reverse greedy algorithm is used to delete redundant nodes, the spline curve is used to smooth the path such that the position meets the cubic spline curve and the speed meets the quadratic spline curve, and the final path is optimized.

View Article and Find Full Text PDF

Improved RRT*-Connect Manipulator Path Planning in a Multi-Obstacle Narrow Environment.

Sensors (Basel)

April 2025

National Engineering Laboratory for Big Data System Computing Technology, Shenzhen University, Shenzhen 518000, China.

This paper proposes an improved RRT*-Connect algorithm (IRRT*-Connect) for robotic arm path planning in narrow environments with multiple obstacles. A heuristic sampling strategy is adopted with the integration of the ellipsoidal subset sampling and goal-biased sampling strategies, which can continuously compress the sampling space to enhance the sampling efficiency. During the node expansion process, an adaptive step-size method is introduced to dynamically adjust the step size based on the obstacle information, while a node rejection strategy is used to accelerate the search process so as to generate a near-optimal collision-free path.

View Article and Find Full Text PDF