An RRT-Dijkstra-Based Path Planning Strategy for Autonomous Vehicles

Abstract

It is challenging to plan paths for autonomous vehicles on half-structured roads because of the vast planning area and complex environmental constraints. This work aims to plan optimized paths with high accuracy and efficiency. A two-step path planning strategy is proposed. The classic planning problem is divided into two simpler planning problems: reduction problems for a vast planning area and solving problems for weighted directed graphs. The original planning area is first reduced using an RRT (Rapidly Exploring Random Tree) based guideline planner. Second, the path planning problem in the smaller planning region is expanded into a weighted directed graph and transformed into a discrete multi-source cost optimization problem, in which a potential energy field based discrete cost assessment function was designed considering obstacles, lanes, vehicle kinematics, and collision avoidance performances, etc. The output path is then obtained by applying a Dijkstra optimizer. Comparative simulations are conducted to assess the effectiveness of the proposed strategy. The results shows that the designed strategy balances efficiency and accuracy with enough planning flexibility and a 22% improvement in real-time performance compared to the classic Lattice planner, without significant loss of accuracy.

Keywords

• autonomous vehicle
• path planning
• RRT-Dijkstra-based strategy