Cooperative Game Approach to Optimal Merging Sequence and on-Ramp Merging Control of Connected and Automated Vehicles

Vehicle merging is one of the main causes of reduced traffic efficiency, increased risk of collision, and fuel consumption. Connected and automated vehicles (CAVs) can improve traffic efficiency, increase safety, and reduce the negative environmental impacts through effective communication and control. Therefore, to improve the traffic efficiency and reduce the fuel consumption in on-ramp scenarios, this paper addresses the global and optimal coordination of the CAVs in a merging zone. Herein, a cooperative multi-player game-based optimization framework and an algorithm are presented to coordinate vehicles and achieve minimum values for the global pay-off conditions. Fuel consumption, passenger comfort, and travel time within the merging control zone were used as the pay-off conditions. After analyzing the characteristics of the merging control zone and selecting the appropriate control decision duration, multi-player games were decomposed into multiple two-player games. An optimal merging strategy was, thereby, derived from a pay-off matrix, and minimum payoffs were predicted for a number of different potential strategies. The optimal trajectory corresponding to the predicted minimum payoffs was then utilized as the control law to coordinate the vehicles merging. The proposed control scheme derives an optimal merging sequence and an optimal trajectory for each vehicle. The effectiveness of the proposed model is validated through simulation. The proposed controller is compared with two alternative methods to demonstrate its potential to reduce fuel consumption and travel time and to improve passenger comfort and traffic efficiency.