Journal
ENGINEERING COMPUTATIONS
Volume 40, Issue 5, Pages 1266-1286Publisher
EMERALD GROUP PUBLISHING LTD
DOI: 10.1108/EC-11-2022-0672
Keywords
Autonomous vehicle; Local path planning; Q-learning; Gaussian distribution; Obstacle density; Dynamic step size; Bidirectional pruning
Ask authors/readers for more resources
The purpose of this research is to develop a dynamic step path planning algorithm for autonomous vehicles based on the RRT algorithm combined with Q-learning and the Gaussian distribution of obstacles. The authors divide the path planning issue into three key steps, which include accelerating tree expansion, removing invalid nodes through bidirectional pruning, and smoothing the predicted pathways using B-splines. Simulation results demonstrate that the proposed algorithm can provide a smooth and safe route for self-driving vehicles.
PurposeThe goal of this research is to develop a dynamic step path planning algorithm based on the rapidly exploring random tree (RRT) algorithm that combines Q-learning with the Gaussian distribution of obstacles. A route for autonomous vehicles may be swiftly created using this algorithm.Design/methodology/approachThe path planning issue is divided into three key steps by the authors. First, the tree expansion is sped up by the dynamic step size using a combination of Q-learning and the Gaussian distribution of obstacles. The invalid nodes are then removed from the initially created pathways using bidirectional pruning. B-splines are then employed to smooth the predicted pathways.FindingsThe algorithm is validated using simulations on straight and curved highways, respectively. The results show that the approach can provide a smooth, safe route that complies with vehicle motion laws.Originality/valueAn improved RRT algorithm based on Q-learning and obstacle Gaussian distribution (QGD-RRT) is proposed for the path planning of self-driving vehicles. Unlike previous methods, the authors use Q-learning to steer the tree's development direction. After that, the step size is dynamically altered following the density of the obstacle distribution to produce the initial path rapidly and cut down on planning time even further. In the aim to provide a smooth and secure path that complies with the vehicle kinematic and dynamical restrictions, the path is lastly optimized using an enhanced bidirectional pruning technique.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available