Optimization Strategy for Merging Sequence of Connected Vehicles Based on Cooperative Game Theory
In order to improve the traffic efficiency of the road bottleneck area,an optimal decision algorithm of connected vehicle merging sequence based on cooperative game is proposed.Firstly,a multi-objective joint cost func-tion including traffic efficiency,fuel consumption and comfort,was constructed and the global minimum revenue strate-gy in the merging area was derived by analyzing the multi-person cooperative game problem;Then,the multi-player cooperative game was decomposed into multiple two player cooperative games,the minimum merging cost of different strategies was predicted,the Pareto efficient solution of the two player game was obtained by using the payoff matrix method,and the optimal merging sequence was determined;Finally,the simulation results based on MATLAB show that the optimized merging sequence can effectively reduce fuel consumption,shorten travel time and improve passen-ger comfort in the merging scenarios of three lanes into one lane.
Intelligent and connected vehicleLane mergingOptimal sequenceLane change decisionCooperative game
NETL
NSTL
万方数据
