Improvement of the APF-RRT*-Connect Algorithm for Efficient Path Planning in 3D Environments

This paper presents an improved Artificial Potential Field -Rapidly-exploring Random Tree Star-Connect algorithm for three-dimensional environments.The improved method integrates the Artificial Potential Field during path generation to optimize each newly generated node in real-time.This approach reduces the number of node optimization processes, collision detections and optimizes the target nodes in the attractive potential field.Through Matlab simulation, the paper compares the path length and planning time of the traditional Artificial Potential Field -Rapidly-exploring Random Tree Star-Connect algorithm and the improved algorithm.The results indicate that the improved algorithm can find shorter paths in less time and enhances the smoothness of the path.

Authors

Institutions

Publication Details

Journal
Proceedings of International Conference on Artificial Life and Robotics
Published
2025-02-13
DOI
https://doi.org/10.5954/icarob.2025.os3-4
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

Improvement of the APF-RRT*-Connect Algorithm for Efficient Path Planning in 3D Environments

Yiming Wang, Miao Zhang
Proceedings of International Conference on Artificial Life and Robotics
Robotic Path Planning Algorithms
article

Improvement of the APF-RRT*-Connect Algorithm for Efficient Path Planning in 3D Environments

Yiming Wang, Miao Zhang
article en

Abstract

This paper presents an improved Artificial Potential Field -Rapidly-exploring Random Tree Star-Connect algorithm for three-dimensional environments.The improved method integrates the Artificial Potential Field during path generation to optimize each newly generated node in real-time.This approach reduces the number of node optimization processes, collision detections and optimizes the target nodes in the attractive potential field.Through Matlab simulation, the paper compares the path length and planning time of the traditional Artificial Potential Field -Rapidly-exploring Random Tree Star-Connect algorithm and the improved algorithm.The results indicate that the improved algorithm can find shorter paths in less time and enhances the smoothness of the path.

Proceedings of International Conference on Artificial Life and RoboticsVol. 30
Tianjin University of Science and Technology (CN)
Sustainable cities and communities
Openalex Percentile: Top 67%
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.