Dual and reduced-order observer based attack-free protocols for consensus of multi-agent systems with Markovian switching topologies

This paper studies the output feedback consensus problem of linear multi-agent systems with Markovian switching topologies. To avoid reconstructing the Markovian switching topologies during designing the observers or adding the state of the observers to the information exchange loop, dual and reduced-order observer based attack-free consensus protocols are proposed, which only utilizes the relative outputs of neighboring agents. It is shown that, under certain mild conditions, a necessary and sufficient condition for the solvability of the mean square consensus problem is that the union of switching topologies has a spanning tree. Finally, numerical examples are given to illustrate the effectiveness of the proposed approaches.

Authors

Institutions

Publication Details

Journal
Systems & Control Letters
Published
2025-05-14
DOI
https://doi.org/10.1016/j.sysconle.2025.106118
Citations
4
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
5.95

Funders

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

Dual and reduced-order observer based attack-free protocols for consensus of multi-agent systems with Markovian switching topologies

Zhao‐Yan Li, Tangan Gao, Bin Zhou
4 citations
Systems & Control Letters
Distributed Control Multi-Agent Systems
5.95
article

Dual and reduced-order observer based attack-free protocols for consensus of multi-agent systems with Markovian switching topologies

Zhao‐Yan Li, Tangan Gao, Bin Zhou
article en
4 citations

Abstract

This paper studies the output feedback consensus problem of linear multi-agent systems with Markovian switching topologies. To avoid reconstructing the Markovian switching topologies during designing the observers or adding the state of the observers to the information exchange loop, dual and reduced-order observer based attack-free consensus protocols are proposed, which only utilizes the relative outputs of neighboring agents. It is shown that, under certain mild conditions, a necessary and sufficient condition for the solvability of the mean square consensus problem is that the union of switching topologies has a spanning tree. Finally, numerical examples are given to illustrate the effectiveness of the proposed approaches.

Systems & Control LettersVol. 202
Harbin Institute of Technology (CN)
National Natural Science Foundation of China, National Science Fund for Distinguished Young Scholars
Reduced inequalities
Openalex Percentile: Top 4%
Distributed Control Multi-Agent Systems
5.95
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.