Search Results

Connected and automated vehicles (CAVs) can improve traffic efficiency and reduce fuel consumption. This paper proposes a cooperative game approach to merging sequence and optimal trajectory planning of CAVs at unsignalized intersections. The trajectory of the vehicles in the control zone is optimized by the Pontryagin minimum principle. The vehicle's travel time, fuel consumption, and passenger comfort are considered to construct the joint cost function, completing the optimal trajectory planning to minimize the joint cost function. Analyzing the different states between neighboring CAVs at the intersection to calculate the minimum safety interval. The cooperative game approach to merging sequence aims to minimize the global cost and the merging sequence of CAVs is dynamically adjusted according to the gaming result. The multi-player games are decomposed into two-player games, to realize the goal of the minimal global cost and improve the calculation efficiency.

In contemporary trajectory planning research, it is common to rely on point-mass model for trajectory planning. However, this often leads to the generation of trajectories that do not adhere to the vehicle dynamics, thereby increasing the complexity of trajectory tracking control. This paper proposes a local trajectory planning algorithm that combines sampling and sequential quadratic optimization, considering the vehicle dynamics model. Initially, the vehicle trajectory is characterized by utilizing vehicle dynamic control variables, including the front wheel angle and the longitudinal speed. Next, a cluster of sampling points for the anticipated point corresponding to the current vehicle position is obtained through a sampling algorithm based on the vehicle's current state. Then, the trajectory planning problem between these two points is modeled as a sequential quadratic optimization problem.