Distributed Algorithm Design for Aggregative Games of Euler-Lagrange Systems and Its Application to Smart Grids

The aggregative games are addressed in this article, in which there are coupling constraints among decisions and the players have Euler-Lagrange (EL) dynamics. On the strength of gradient descent, state feedback, and dynamic average consensus, two distributed algorithms are developed to seek the var...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on cybernetics Ročník 52; číslo 8; s. 8315 - 8325
Hlavný autor: Deng, Zhenhua
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: United States IEEE 01.08.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
ISSN:2168-2267, 2168-2275, 2168-2275
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The aggregative games are addressed in this article, in which there are coupling constraints among decisions and the players have Euler-Lagrange (EL) dynamics. On the strength of gradient descent, state feedback, and dynamic average consensus, two distributed algorithms are developed to seek the variational generalized Nash equilibrium (GNE) of the game. This article analyzes the convergence of two algorithms by utilizing singular perturbation analysis and variational analysis. The two algorithms exponentially and asymptotically converge to the variational GNE of the game, respectively. Moreover, the results are applied to the electricity market games of smart grids. By the algorithms, turbine-generator systems can seek the variational GNE of electricity markets autonomously. Finally, simulation examples verify the methods.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2168-2267
2168-2275
2168-2275
DOI:10.1109/TCYB.2021.3049462