Ao Tan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ao Tan has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Congcong Ren
School of Vehicle and Traffic Engineering, Henan University of Science and Technology, Luoyang 471000, China
1 shared publication - Wei Zhao
School of Vehicle and Traffic Engineering, Henan University of Science and Technology, Luoyang 471003, China
1 shared publication
Latest Publications
- Open Access
- 14 October 2024
- Published by MDPI AG in Electronics
- Vol. 13 (20) , 4047
An Innovative Path Planning Algorithm for Complex Obstacle Environments with Adaptive Obstacle Density Adjustment: AODA-PF-RRT*
To address the limitations of low node utilization and inadequate adaptability in complex environments encountered by Rapidly-exploring Random Tree (RRT) algorithms during the expansion phase, this study presents an enhanced path planning algorithm—AODA-PF-RRT* (Adaptive Obstacle Density Adjustment-PF-RRT*). The proposed algorithm implements a random extension strategy for nodes that fail collision detection, thereby improving node efficiency. Furthermore, it dynamically partitions the area surrounding sampling points and calculates local obstacle density in real time. By leveraging this density information, the algorithm flexibly adjusts both the number of expansion points and the dichotomy threshold, significantly enhancing its responsiveness to environmental changes. We rigorously demonstrate the algorithm’s probabilistic completeness and asymptotic optimality. Simulation and benchmarking results demonstrate that the AODA-PF-RRT* algorithm not only generates smooth and high-quality paths compared to existing algorithms but also maintains low computational costs in complex environments, showcasing exceptional stability and robustness.
- 14 October 2024
- Published by MDPI AG in Electronics
- Vol. 13 (20) , 4047
Open AccessAn Innovative Path Planning Algorithm for Complex Obstacle Environments with Adaptive Obstacle Density Adjustment: AODA-PF-RRT*
To address the limitations of low node utilization and inadequate adaptability in complex environments encountered by Rapidly-exploring Random Tree (RRT) algorithms during the expansion phase, this study presents an enhanced path planning algorithm—AODA-PF-RRT* (Adaptive Obstacle Density Adjustment-PF-RRT*). The proposed algorithm implements a random extension strategy for nodes that fail collision detection, thereby improving node efficiency. Furthermore, it dynamically partitions the area surrounding sampling points and calculates local obstacle density in real time. By leveraging this density information, the algorithm flexibly adjusts both the number of expansion points and the dichotomy threshold, significantly enhancing its responsiveness to environmental changes. We rigorously demonstrate the algorithm’s probabilistic completeness and asymptotic optimality. Simulation and benchmarking results demonstrate that the AODA-PF-RRT* algorithm not only generates smooth and high-quality paths compared to existing algorithms but also maintains low computational costs in complex environments, showcasing exceptional stability and robustness.