Research on 3D Trajectory Planning Based on the IAPF-CRRT* Algorithm

In order to solve the problems of RRT* algorithm, such as large sampling randomness, low search efficiency, and great impact on the quality of search trajectory due to the limited number of iterations, a RRT*-Connect algorithm combining improved artificial potential field (IAPF-CRRT* algorithm) was proposed to realize trajectory planning in complex three-dimensional environment. In the direction of point expansion, improved gravitational and repulsive fields were introduced to guide the point expansion process and limit the randomness of the expansion. In this study, a dynamic step length selection method was proposed for the random tree point step length, and whether the current point was in the repulsive field was discussed, so that different expansion step length could be determined. The results showed that compared with RRT* algorithm, the designed IAPF-CRRT* algorithm had less planning time, shorter trajectory length, higher point utilization rate, which had significantly improved the planning efficiency.

Authors

Institutions

Publication Details

Published
2025-03-14
DOI
https://doi.org/10.1109/itoec63606.2025.10968012
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
1.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on 3D Trajectory Planning Based on the IAPF-CRRT* Algorithm

Yongshan Liu, Zijun Wang
1 citations
Robotic Path Planning Algorithms
1.28
article

Research on 3D Trajectory Planning Based on the IAPF-CRRT* Algorithm

Yongshan Liu, Zijun Wang
article en
1 citations

Abstract

In order to solve the problems of RRT* algorithm, such as large sampling randomness, low search efficiency, and great impact on the quality of search trajectory due to the limited number of iterations, a RRT*-Connect algorithm combining improved artificial potential field (IAPF-CRRT* algorithm) was proposed to realize trajectory planning in complex three-dimensional environment. In the direction of point expansion, improved gravitational and repulsive fields were introduced to guide the point expansion process and limit the randomness of the expansion. In this study, a dynamic step length selection method was proposed for the random tree point step length, and whether the current point was in the repulsive field was discussed, so that different expansion step length could be determined. The results showed that compared with RRT* algorithm, the designed IAPF-CRRT* algorithm had less planning time, shorter trajectory length, higher point utilization rate, which had significantly improved the planning efficiency.

Beijing Institute of Technology (CN)
Sustainable cities and communities
Openalex Percentile: Top 21%
Robotic Path Planning Algorithms
1.28
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.