Abstract
The on-ramp merging in multi-lane highway scenarios presents challenges due to the complexity of coordinating vehicles’ merging and lane-changing behaviors, while ensuring safety and optimizing traffic flow. However, there are few studies that have addressed the merging problem of ramp vehicles and the cooperative lane-change problem of mainline vehicles within a unified framework and proposed corresponding optimization strategies. To tackle this issue, this study adopts a cyber-physical integration perspective and proposes a graph-based solution approach. First, the information of vehicle groups in the physical plane is mapped to the cyber plane, and a dynamic conflict graph is introduced in the cyber space to describe the conflict relationships among vehicle groups. Subsequently, graph decomposition and search strategies are employed to obtain the optimal solution, including the set of mainline vehicles changing lanes, passing sequences for each route, and corresponding trajectories. Finally, the proposed dynamic conflict graph-based algorithm is validated through simulations in continuous traffic with various densities, and its performance is compared with the default algorithm in SUMO. The results demonstrate the effectiveness of the proposed approach in improving vehicle safety and traffic efficiency, particularly in high traffic density scenarios, providing valuable insights for future research in multi-lane merging strategies.
