A Consensus-Based Generalized Multi-Population Aggregative Game with Application to Charging Coordination of Electric Vehicles
This paper 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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
The Use of Symmetry for Models with Variable-size Variables
This paper presents a universal representation of symmetric (permutation-invariant) functions with multidimensional variable-size variables. These representations help justify approximation methods that aggregate informa…
MMEGeneralized Stochastic Dynamic Aggregative Game for Demand-Side Management in Microgrids with Shared Battery
In this paper, we focus on modeling and analysis of demand-side management in a microgrid where agents utilize grid energy and a shared battery charged by renewable energy sources. We model the problem as a generalized s…
ManagementTracking-based distributed equilibrium seeking for aggregative games
We propose fully-distributed algorithms for Nash equilibrium seeking in aggregative games over networks. We first consider the case where local constraints are present and we design an algorithm combining, for each agent…
Local Aggregative Games
Aggregative games provide a rich abstraction to model strategic multi-agent interactions. We focus on learning local aggregative games, where the payoff of each player is a function of its own action and the aggregate be…
The Best of Both Worlds in Network Population Games: Reaching Consensus and Convergence to Equilibrium
Reaching consensus and convergence to equilibrium are two major challenges of multi-agent systems. Although each has attracted significant attention, relatively few studies address both challenges at the same time. This …