Robust Distributed Nash Equilibrium Seeking Subject to Communication Constraints

In this article, we address the robust distributed Nash equilibrium seeking problem of <inline-formula><tex-math notation="LaTeX">N</tex-math></inline-formula>-player games under switching networks and communication delays. The salient feature of this work is that t...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on automatic control Ročník 70; číslo 3; s. 1941 - 1948
Hlavní autori: Liu, Lupeng, Lu, Maobin, Wang, Shimin, Deng, Fang, Chen, Jie
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.03.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
ISSN:0018-9286, 1558-2523
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this article, we address the robust distributed Nash equilibrium seeking problem of <inline-formula><tex-math notation="LaTeX">N</tex-math></inline-formula>-player games under switching networks and communication delays. The salient feature of this work is that the switching communication networks can be uniformly strongly connected, and the communication delays are allowed to be arbitrarily unknown, time-varying and bounded. To solve the problem, we construct a distributed estimator for each player to estimate all players' strategies through unreliable communication networks. Based on the gradient play technique, we design a distributed Nash equilibrium seeking law. Then, we obtain the closed-loop system, which is an interconnected system of a nonlinear subsystem and a linear time-delay subsystem. By constructing the Lyapunov-Krasovskii functional, and designing the controller parameter in the sense of the small gain theorem, we achieve robust Nash equilibrium seeking asymptotically in spite of unreliable communication networks. Finally, we illustrate our proposed approach by its application to practical motion control of mobile robots with an experiment.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2024.3476195