A Dynamic Lane-Changing Trajectory Planning Algorithm for Intelligent Connected Vehicles Based on Modified Driving Risk Field Model

Abstract

A dynamic LC trajectory planning algorithm based on the modified driving risk field is proposed to address the issue of dynamic changes during the lane-changing (LC) process. First, a modified driving risk field (MDRF) model is constructed for LC scenarios. Then, according to the state of the target vehicle and discrete sampling points, a series of LC candidate trajectories were generated based on the quintic polynomial. After eliminating candidate trajectories that do not meet the constraints, the MDRF was utilized as a safety evaluation function. Additionally, comfort and smoothness evaluation functions were combined to evaluate candidate LC trajectories in order to obtain the optimal LC reference trajectory. Then, this paper proposes a dynamic LC trajectory planning algorithm, addressing the challenges of complex traffic scenarios and dynamic changes in adjacent vehicle states. Utilizing the optimal reference trajectory as a basis, a dynamic segmented algorithm is applied to the x–t and y–x curves, constructing an optimized objective function that considers the MDRF. Under multiple constraints, including the continuity and smoothness of the lateral and longitudinal trajectories, the penalty function approach is employed to solve the optimization objective function, yielding the optimal LC trajectory adapted to real-time changes in the traffic state. Finally, the proposed dynamic LC trajectory planning algorithm was validated under four different scenarios by using MATLAB 2023b. The simulation results indicate the safety, continuity, and dynamic feasibility of the proposed algorithm. Moreover, it demonstrates strong adaptability and flexibility in challenging dynamic LC scenarios.

Keywords

• lane-changing trajectory
• modified driving risk field
• quintic polynomial
• dynamic planning