Localized Data-Driven Consensus Control

This article considers a localized data-driven consensus problem for leader–follower multiagent systems with unknown discrete-time agent dynamics, where each follower computes its local control gain using only their locally collected state and input data. Both noiseless and noisy data-driven protocols are presented to achieve leader–follower consensus, by addressing the challenge of the heterogeneity in control gains caused by the localized data sampling and distinct parameters of agents. The design of these data-driven consensus protocols involves low-dimensional linear matrix inequalities. In addition, the results are extended to the case where only the leader's data are collected and exploited. The effectiveness of the proposed methods is illustrated via simulation examples.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Automatic Control
Published
2025-02-18
DOI
https://doi.org/10.1109/tac.2025.3543472
Citations
4
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
4.46

Funders

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

Localized Data-Driven Consensus Control

Junjie Jiao, Zeze Chang, Zhongkui Li
4 citations
IEEE Transactions on Automatic Control
Distributed Control Multi-Agent Systems
4.46
article

Localized Data-Driven Consensus Control

Junjie Jiao, Zeze Chang, Zhongkui Li
article en
4 citations

Abstract

This article considers a localized data-driven consensus problem for leader–follower multiagent systems with unknown discrete-time agent dynamics, where each follower computes its local control gain using only their locally collected state and input data. Both noiseless and noisy data-driven protocols are presented to achieve leader–follower consensus, by addressing the challenge of the heterogeneity in control gains caused by the localized data sampling and distinct parameters of agents. The design of these data-driven consensus protocols involves low-dimensional linear matrix inequalities. In addition, the results are extended to the case where only the leader's data are collected and exploited. The effectiveness of the proposed methods is illustrated via simulation examples.

IEEE Transactions on Automatic ControlVol. 70(9)
Peking University (CN), Technical University of Munich (DE)
National Natural Science Foundation of China
Openalex Percentile: Top 6%
Distributed Control Multi-Agent Systems
4.46
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.