Integrated optimization of traffic signal timings and vehicle trajectories considering mandatory lane-changing at isolated intersections

Abstract

Intersections are the predominant bottlenecks in urban areas due to the intricate conflicts among vehicles with different movements. With the advent of connected and automated vehicles (CAVs), it is more effective to reorganize urban traffic in a coordinated manner, and integrate the planning of both the traffic signal timings and vehicle trajectories. Most existing studies in this field assume that all vehicles are in their intended lanes initially, and only optimize the trajectories in the longitudinal dimension for simplicity, which is ideal and unrealistic. Therefore, this paper considers mandatory lane-changing for the integrated optimization of traffic signal timings and vehicle trajectories at isolated intersections. The entire planning horizon is segmented into a series of time-slots, based on which we select phases and plan the trajectories. First, a single-layer mixed integer programming (MIP) model is formulated to obtain global optimal solutions. Nevertheless, for large-scale cases, the MIP model is not applicable due to its computational complexities. Thus, we regulate vehicles into multi-lane platoons that correspond to green phases to reduce the solution space, and propose a beam-search-based platoon formation planning (BPFP) framework for efficient optimization. A beam search procedure is proposed to select phases for each time-slot, which incorporates a vehicle assignment algorithm to design the platoon formation as a subroutine. The two-dimensional vehicle trajectories are subsequently planned according to the platoon formation profiles. Numerical experiments illustrate that BPFP is capable of acquiring near-optimal solutions and considerably outperforms the baselines, while the computation time is within seconds even in over-saturated scenarios.