Dynamic NE Seeking for Multi-Integrator Networked Agents with Disturbance Rejection
arXiv:1903.02587 · doi:10.1109/TCNS.2019.2920590
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 gradient-play, 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 offset by each agent maintaining an estimate of the others' states, based on local communication with its neighbours. Each agent has an additional dynamic component that drives its estimates to the consensus subspace. In all cases, we show convergence to the Nash equilibrium irrespective of disturbances. Our proofs leverage input-to-state stability under strong monotonicity of the pseudo-gradient and Lipschitz continuity of the extended pseudo-gradient.
Cited by in corpus (8)
- Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents
- Nash Equilibrium Seeking for General Linear Systems with Disturbance Rejection
- Network games with dynamic players: Stabilization and output convergence to Nash equilibrium
- Distributed Nash Equilibrium Seeking for Monotone Generalized Noncooperative Games by a Regularized Penalty Method
- Sampled-Data Online Feedback Equilibrium Seeking: Stability and Tracking
- Nash Equilibrium Seeking Over Directed Graphs
- Distributed strategy-updating rules for aggregative games of multi-integrator systems with coupled constraints
- Distributed Algorithm for Continuous-type Bayesian Nash Equilibrium in Subnetwork Zero-sum Games