Research on path planning of robotic arms based on DAPF-RRT algorithm

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. To reduce randomness in the expansion process, the artificial potential field method is integrated to constrain the growth of new nodes by the random sampling function, the target gravitational function and the repulsion function. Finally, the planned path is pruned and smoothed using cubic B-splines to improve redundant points and turns in the path, and reduce the occurrence of shaking during the motion of the robotic arm. In the same environment, the improved algorithm reduces path length by 15.4% and planning time by 49.2%, compared with the RRT-Connect algorithm.

Authors

Institutions

Publication Details

Journal
PLoS ONE
Published
2025-05-15
DOI
https://doi.org/10.1371/journal.pone.0323734
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

Research on path planning of robotic arms based on DAPF-RRT algorithm

Zhenggang Wang, Kunxiang Wang, Fan Yi, Junyang Tang et al.
PLoS ONE
Robotic Path Planning Algorithms
article

Research on path planning of robotic arms based on DAPF-RRT algorithm

Zhenggang Wang, Kunxiang Wang, Fan Yi, Junyang Tang, Xiangrui Ren
article en

Abstract

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. To reduce randomness in the expansion process, the artificial potential field method is integrated to constrain the growth of new nodes by the random sampling function, the target gravitational function and the repulsion function. Finally, the planned path is pruned and smoothed using cubic B-splines to improve redundant points and turns in the path, and reduce the occurrence of shaking during the motion of the robotic arm. In the same environment, the improved algorithm reduces path length by 15.4% and planning time by 49.2%, compared with the RRT-Connect algorithm.

PLoS ONEVol. 20(5)
Anhui Polytechnic University (CN)
Sustainable cities and communities
Openalex Percentile: Top 91%
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.