2D‐Action Asynchronous Cooperative Lane Change Trajectory Planning Method for Connected and Automated Vehicles

Abstract

The ability to change lanes safely, efficiently, and comfortably is an important prerequisite for the application of Connected‐Automated Vehicles (CAVs). Based on the five‐order polynomial trajectory planning for CAVs, the 2D‐Action Asynchronous Lane Change (AALC) trajectory planning model is constructed by further considering the longitudinal and lateral driving action execution time parameters. This is done to improve the applicability of the lane change model and increase the CAV lane change success rate. The continuous collision space algorithm is constructed by determining the continuity condition of collision trajectory parameter solution space through the monotonicity of trajectory curve parameters and collision form classification. AALC trajectory safety judgment is realized through this algorithm. A cooperative lane change trajectory evaluation objective function is constructed, considering multivehicle comfort and efficiency. Finally, the AALC model is solved in the continuous collision space according to the optimal objective function, and the lane change is divided into free, cooperative, and refused according to the optimization. The results indicate that the AALC model achieves the transfer of collision space between lanes through asynchronous process of behavior execution time window, thereby reducing the possibility of vehicle collision. The AALC model reduces the degree of change of cooperative lane change parameters by asynchronous process of behavior, increasing the number of free lane change trajectories by about 17%, effectively reducing the occurrence of lane change refusal, improving the successful rate of lane change, and enhancing the overall evaluation of the lane change. The AALC model realizes the reallocation of collision space between different lanes through asynchronous process, making it more suitable for environments with large differences in vehicle gaps such as ramp merging. The collision‐based trajectory optimization algorithm can quickly obtain the corresponding safety space and optimal trajectory. The maximum calculation time for a single cooperative lane change is 0.073 s, thus enabling real‐time trajectory planning.