A multi-intersection coordinated control algorithm based on game theory and maximal flow

This paper proposes an algorithm to solve multi - intersection coordinated control problem, which combines the maximal flow theory with the game theory and considers both the individual interests of one intersection and the interests of the whole traffic network. The game theory model of signal intersection and the game theory model of 2 intersections coordination are established. And it is proved that the network capacity can be described by maximal flow of the traffic graph. The payoff function of players in a game is improved through combining with the maximal flow. So, the public interests and individual interests are combined in this paper. A method of generating the unique solution from Nash equilibriums is used in this paper. The running logic rule of the control system is given. The results of the simulation experiment show that the algorithm based on game theory and maximal flow reduces the average delay time of vehicles more effectively and it is more stable than Webster method and the game theory without maximal flow method.