Distributed NE Seeking for Networked Euler‐Lagrange Systems With Constrained Communication

ABSTRACT The paper studies the distributed Nash equilibrium (NE) seeking problem for noncooperative games of networked Euler‐Lagrange systems with unknown parameters. Unlike the existing work based on the tracking method, resorting to a sliding‐mode extended state observer for the estimation of unknown parts in the Euler‐Lagrange system, a distributed algorithm is proposed to seek NE of the game. Moreover, to facilitate the practical applications of the designed continuous‐time algorithm, a local event‐triggered communication scheme is presented to alleviate communication burden. Finally, the formation of networked Euler‐Lagrange systems is taken as an example to verify the proposed algorithm.

Authors

Institutions

Publication Details

Journal
IET Control Theory and Applications
Published
2025-01-01
DOI
https://doi.org/10.1049/cth2.70020
Citations
1
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
1.49

Funders

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

Distributed NE Seeking for Networked Euler‐Lagrange Systems With Constrained Communication

Bingpeng Gao, Xin Cai, Xingzhi Chen, Yuanyuan Xu et al.
1 citations
IET Control Theory and Applications
Distributed Control Multi-Agent Systems
1.49
article

Distributed NE Seeking for Networked Euler‐Lagrange Systems With Constrained Communication

Bingpeng Gao, Xin Cai, Xingzhi Chen, Yuanyuan Xu, Xinyuan Nan
article en
1 citations

Abstract

ABSTRACT The paper studies the distributed Nash equilibrium (NE) seeking problem for noncooperative games of networked Euler‐Lagrange systems with unknown parameters. Unlike the existing work based on the tracking method, resorting to a sliding‐mode extended state observer for the estimation of unknown parts in the Euler‐Lagrange system, a distributed algorithm is proposed to seek NE of the game. Moreover, to facilitate the practical applications of the designed continuous‐time algorithm, a local event‐triggered communication scheme is presented to alleviate communication burden. Finally, the formation of networked Euler‐Lagrange systems is taken as an example to verify the proposed algorithm.

IET Control Theory and ApplicationsVol. 19(1)
Xinjiang Institute of Engineering (CN), Xinjiang University (CN)
Natural Science Foundation of Xinjiang Province, National Natural Science Foundation of China, Natural Science Foundation of Xinjiang
Openalex Percentile: Top 18%
Distributed Control Multi-Agent Systems
1.49
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.

Distributed NE Seeking for Networked Euler‐Lagrange Systems With Constrained Communication — Bingpeng Gao, Xin Cai, et al. · IET Control Theory and Applications (2025) | TGRS Research Map | TGRS