Research on path planning of autonomous vehicle based on RRT algorithm of Q-learning and obstacle distribution

Abstract

Purpose

The 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/approach

The 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.

Findings

The 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/value

An 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.

Citation

Shang, Y., Liu, F., Qin, P., Guo, Z. and Li, Z. (2023), "Research on path planning of autonomous vehicle based on RRT algorithm of Q-learning and obstacle distribution", Engineering Computations, Vol. 40 No. 5, pp. 1266-1286. https://doi.org/10.1108/EC-11-2022-0672