Obstacle Avoidance Trajectory Planning of Manipulator Based on Improved RRT Algorithm

An improved RRT algorithm based on centripetal expansion, target bias and local path optimization is proposed to solve the problems of weak goal orientation, low planning efficiency and long planning path of trajectory planning algorithm for obstacle avoidance and grasping task of manipulator. The algorithm uses the bi-directional centripetal expansion strategy to change the extension decision condition and speed up the convergence of the expansion tree. Then the super-ellipsoid bias method is introduced to increase the target orientation of the sampling points and greatly accelerate the convergence speed. Finally, the expansion tree nodes are optimized by path cost to locally reduce path length. Simulation results show that the improved RRT algorithm has higher operation efficiency, can reduce the path cost to a certain extent, and can perform obstacle avoidance and crawling task more efficiently.

Authors

Institutions

Publication Details

Published
2025-06-27
DOI
https://doi.org/10.1109/iccste65902.2025.11138351
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Obstacle Avoidance Trajectory Planning of Manipulator Based on Improved RRT Algorithm

Tengfei Chen, Bin Yan, Hewei Qu, M Guo et al.
Robotic Path Planning Algorithms
article

Obstacle Avoidance Trajectory Planning of Manipulator Based on Improved RRT Algorithm

Tengfei Chen, Bin Yan, Hewei Qu, M Guo, Penghui Yang, Tingjun Wang, Zhongshuai Zhao
article en

Abstract

An improved RRT algorithm based on centripetal expansion, target bias and local path optimization is proposed to solve the problems of weak goal orientation, low planning efficiency and long planning path of trajectory planning algorithm for obstacle avoidance and grasping task of manipulator. The algorithm uses the bi-directional centripetal expansion strategy to change the extension decision condition and speed up the convergence of the expansion tree. Then the super-ellipsoid bias method is introduced to increase the target orientation of the sampling points and greatly accelerate the convergence speed. Finally, the expansion tree nodes are optimized by path cost to locally reduce path length. Simulation results show that the improved RRT algorithm has higher operation efficiency, can reduce the path cost to a certain extent, and can perform obstacle avoidance and crawling task more efficiently.

Guizhou Electromechanical Research and Design Institute (CN)
Openalex Percentile: Top 77%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Obstacle Avoidance Trajectory Planning of Manipulator Based on Improved RRT Algorithm — Tengfei Chen, Bin Yan, et al. · (2025) | TGRS Research Map | TGRS