基于合作博弈的网联车辆合流序列优化策略

Optimization Strategy for Merging Sequence of Connected Vehicles Based on Cooperative Game Theory

为提升道路合流区交通通行效率,提出了一种基于合作博弈的网联车辆合流序列优化决策算法。首先,构建包含油耗、舒适度的多优化目标联合成本函数,通过分析多人合作博弈问题推导出合流区全局最小成本策略;然后,将多车合作博弈分解为多个两车合作博弈,预测不同策略的最小合流成本,利用成本矩阵法求得两车博弈的帕累托有效解,确定最优合流序列;最后,在三车道合并至一车道合流场景下,MATLAB仿真结果表明,上述优化合流序列能有效降低油耗,缩短出行时间,提高乘客的舒适性。

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 function including traffic efficiency,fuel consumption and comfort,was constructed and the global minimum revenue strategy 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 passenger comfort in the merging scenarios of three lanes into one lane.