Path Planning of Parallel Robots Based on RRT*-APF Algorithm

Aiming at the path planning problem of high-speed parallel robots in high-density material sorting scenarios, this paper proposes a hybrid path planning method, which combines the Rapid Exploration Random Tree Star (RRT*) algorithm and the improved Artificial Potential Field (APF) method. By adjusting the weights of attractive and repulsive forces in the artificial potential field method, the intelligent strategy switching between the grasping phase and the evacuation phase is realized, which effectively improves the search efficiency. Simulation experiments show that compared with the traditional RRT algorithm, the RRT*-APF algorithm reduces the total path length by 10.6%, the maximum curvature by 97.8%, and the search time by 72.6%, which significantly improves the path optimization effect and the motion stability. The research results provide a new solution for efficient path planning of multi-degree-of-freedom robots in complex environments.

Authors

Institutions

Publication Details

Published
2025-08-03
DOI
https://doi.org/10.1109/icma65362.2025.11120612
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Path Planning of Parallel Robots Based on RRT*-APF Algorithm

Huixin Sun, Yi Jia, Bin Li, Qi Liu et al.
Robotic Path Planning Algorithms
article

Path Planning of Parallel Robots Based on RRT*-APF Algorithm

Huixin Sun, Yi Jia, Bin Li, Qi Liu, Yunpeng Zhang, Hongze Yu
article en

Abstract

Aiming at the path planning problem of high-speed parallel robots in high-density material sorting scenarios, this paper proposes a hybrid path planning method, which combines the Rapid Exploration Random Tree Star (RRT*) algorithm and the improved Artificial Potential Field (APF) method. By adjusting the weights of attractive and repulsive forces in the artificial potential field method, the intelligent strategy switching between the grasping phase and the evacuation phase is realized, which effectively improves the search efficiency. Simulation experiments show that compared with the traditional RRT algorithm, the RRT*-APF algorithm reduces the total path length by 10.6%, the maximum curvature by 97.8%, and the search time by 72.6%, which significantly improves the path optimization effect and the motion stability. The research results provide a new solution for efficient path planning of multi-degree-of-freedom robots in complex environments.

Tianjin University of Technology (CN)
National Natural Science Foundation of China, Natural Science Foundation of Tianjin City
Openalex Percentile: Top 79%
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.