2020
DOI: 10.1109/tcns.2019.2920590
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic NE Seeking for Multi-Integrator Networked Agents With Disturbance Rejection

Abstract: In this paper, we consider game problems played by (multi)-integrator agents, subject to external disturbances. We propose Nash equilibrium seeking dynamics based on gradientplay, augmented with a dynamic internal-model based component, which is a reduced-order observer of the disturbance. We consider single-, double-and extensions to multi-integrator agents, in a partial-information setting, where agents have only partial knowledge on the others' decisions over a network. The lack of global information is off… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
53
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 103 publications
(53 citation statements)
references
References 41 publications
0
53
0
Order By: Relevance
“…(1) This article formulates a noncooperative game for high-order nonlinear systems, and thereby the considered problem can cover the existing works associated with first-order systems, [16][17][18][19] second-order systems, 22,23 and multiintegrator systems 24 as special cases. Moreover, the focused players are subject to input saturation, input delay and external disturbances, which renders the existing seeking algorithms not applicable to the considered problem.…”
Section: Introductionmentioning
confidence: 99%
See 4 more Smart Citations
“…(1) This article formulates a noncooperative game for high-order nonlinear systems, and thereby the considered problem can cover the existing works associated with first-order systems, [16][17][18][19] second-order systems, 22,23 and multiintegrator systems 24 as special cases. Moreover, the focused players are subject to input saturation, input delay and external disturbances, which renders the existing seeking algorithms not applicable to the considered problem.…”
Section: Introductionmentioning
confidence: 99%
“…The authors of Reference 23 further investigated the Nash equilibrium seeking problem for aggregative games of Euler–Lagrange systems. In Reference 24, Nash equilibrium seeking algorithms were developed based on the gradient play technique for games played by multiintegrator agents subject to external disturbances. The works in References 22‐24 are applicable to address the game problems with second‐ or high‐order dynamics but still have the following limitations.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations