Distributed Data-Driven Nash Equilibrium Seeking in Linear Multi-Agent Systems with External Disturbances

This paper investigates distributed Nash equilibrium (NE) seeking in linear multi-agent network games, where agents with unknown dynamics interact over weakly connected directed graphs under external disturbances. By reformulating the NE seeking problem as a cooperative output regulation problem, we develop a data-driven control framework that embeds the internal model principle to achieve disturbance rejection and eliminate steady-state errors. Closed-loop stability and convergence to the unique NE are proven under standard assumptions on stabilizability, detectability, and data richness. Numerical experiments with a mobile robot network demonstrate the method's effectiveness in achieving output NE seeking under noisy measurements and external disturbances.

Authors

Institutions

Publication Details

Published
2025-06-30
DOI
https://doi.org/10.1109/icca65672.2025.11129711
Primary Topic
Adaptive Dynamic Programming Control
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distributed Data-Driven Nash Equilibrium Seeking in Linear Multi-Agent Systems with External Disturbances

Jian Sun, Wenjie Liu, Zhihong Peng, Yifei Li et al.
Adaptive Dynamic Programming Control
article

Distributed Data-Driven Nash Equilibrium Seeking in Linear Multi-Agent Systems with External Disturbances

Jian Sun, Wenjie Liu, Zhihong Peng, Yifei Li, Gang Wang, Linqi Wang
article en

Abstract

This paper investigates distributed Nash equilibrium (NE) seeking in linear multi-agent network games, where agents with unknown dynamics interact over weakly connected directed graphs under external disturbances. By reformulating the NE seeking problem as a cooperative output regulation problem, we develop a data-driven control framework that embeds the internal model principle to achieve disturbance rejection and eliminate steady-state errors. Closed-loop stability and convergence to the unique NE are proven under standard assumptions on stabilizability, detectability, and data richness. Numerical experiments with a mobile robot network demonstrate the method's effectiveness in achieving output NE seeking under noisy measurements and external disturbances.

Beijing Institute of Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 76%
Adaptive Dynamic Programming Control
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.