Distributed Robust Seeking of Nash Equilibrium for Networked Games: An Extended State Observer-Based Approach
This article aims to accommodate networked games in which the players' dynamics are subjected to unmodeled and disturbance terms. The unmodeled and disturbance terms are regarded as extended states for which observers are designed to estimate them. Compensating the players' dynamics with t...
Saved in:
Published in | IEEE transactions on cybernetics Vol. 52; no. 3; pp. 1527 - 1538 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
United States
IEEE
01.03.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This article aims to accommodate networked games in which the players' dynamics are subjected to unmodeled and disturbance terms. The unmodeled and disturbance terms are regarded as extended states for which observers are designed to estimate them. Compensating the players' dynamics with the observed values, the control laws are designed to achieve the robust seeking of the Nash equilibrium for networked games. First, we consider the case in which the players' dynamics are subject to time-varying disturbances only. In this case, the seeking strategy is developed by employing a smooth observer based on the proportional-integral (PI) control. By utilizing the designed strategy, we show that the players' actions would converge to a small neighborhood of the Nash equilibrium. Moreover, the ultimate bound can be adjusted to be arbitrarily small by tuning the control gains. Then, we further consider the case in which both an unmodeled term and a disturbance term coexist in the players' dynamics. In this case, we adapt the idea from the robust integral of the sign of the error (RISE) method in the strategy design to achieve the asymptotic seeking of the Nash equilibrium. Both strategies are analytically investigated via the Lyapunov stability analysis. The applications of the proposed methods for a network of velocity-actuated vehicles are discussed. Finally, the effectiveness of the proposed methods is verified via conducting numerical simulations. |
---|---|
Bibliography: | 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.2020.2989755 |