.png){kind=icon}
Return
A Double-Layer Adaptive Nash Equilibrium Seeking Algorithm for Euler-Lagrange Systems With Parameter Uncertainty
.png){kind=icon}
PRE
AI
DOI：10.1002/rnc.70423.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article investigates the problem of adaptive distributed Nash equilibrium (NE) seeking in non-cooperative games, where players are modeled as heterogeneous Euler-Lagrange (EL) systems with parameter uncertainty and cannot access the global information about the algebraic connectivity of the interaction graph. Due to the challenges in algorithm design and analysis arising from these general settings, we develop a novel fully distributed algorithm based on tracking control. A scaling parameter is introduced to adaptively adjust the weights of the edges in the communication graph. To avoid infinite growth of adaptive gains, a damping term is incorporated into the adaptation law for the control gains. By input-to-state stability theory, Lyapunov stability theory, and Barbalat's Lemma, it is rigorously proven that the double-layer adaptive algorithm ensures asymptotic convergence of the system to the NE. Finally, a numerical example in the smart grid electricity markets validates the effectiveness of the algorithm.
Keywords:
adaptive control
Euler-Lagrange systems
Nash equilibrium
non-cooperative games
Journal
IF:
3.2
Papers:
7.0K
Citations:
1.4W
Organization
Cited Papers
Adaptive approaches for fully distributed Nash equilibrium seeking in networked games.png)
AUTOMATICA
OAAI
AUTOMATICAIF5.9
OAAIShareSaveShareSaveGeneralized Nash Equilibrium Seeking for Noncooperative Games With Heterogeneous Individual Dynamics
PREAI
ShareSaveNash Equilibrium Seeking for Multicluster Games of Multiple Nonidentical Euler-Lagrange Systems
PREAI
ShareSaveA distributed strategy for games in Euler-Lagrange systems with actuator dead zoneNEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
ShareSaveShareSave
View more