A Consensus-Based Generalized Multi-Population Aggregative Game With Application to Charging Coordination of Electric Vehicles

This letter introduces a consensus-based generalized multi-population aggregative game coordination approach with application to electric vehicles charging under transmission line constraints. The algorithm enables agents to seek an equilibrium solution while considering the limited infrastructure capacities that impose coupling constraints among the users. The Nash-seeking algorithm consists of two interrelated iterations. In the upper layer, population coordinators collaborate for a distributed estimation of the coupling aggregate term in the agents’ cost function and the associated Lagrange multiplier of the coupling constraint, transmitting the latest updated values to their population’s agents. In the lower layer, each agent updates its best response based on the most recent information received and communicates it back to its population coordinator. For the case when the agents’ best response mappings are non-expansive, we prove the algorithm’s convergence to the generalized Nash equilibrium point of the game. Simulation results demonstrate the algorithm’s effectiveness in achieving equilibrium in the presence of a coupling constraint.