One-Bit Consensus Control of Multi-Agent Systems With Packet Loss

This letter investigates the one-bit consensus control of multi-agent systems (MASs) with independent and identically distributed and Markovian packet loss. To explore the impact of packet loss on one-bit communication, this letter first quantitatively characterizes the information loss of one-bit communications caused by packet loss, which provides the proportional relationship between one-bit data with and without packet loss in the sense of expectation. Based on quantitative characterizations, a one-bit packet loss consensus algorithm with a packet loss proportional coefficient is proposed to compensate for the information loss, where the coefficient is designed as the reciprocal of the information loss proportion. Furthermore, this letter demonstrates that the proposed algorithm enables the MAS to achieve one-bit consensus in the mean square sense at a rate of O(1/t) with packet loss. Two simulation examples are given to validate the algorithm.

Authors

Institutions

Publication Details

Journal
IEEE Control Systems Letters
Published
2025-01-01
DOI
https://doi.org/10.1109/lcsys.2025.3579411
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

One-Bit Consensus Control of Multi-Agent Systems With Packet Loss

Yanlong Zhao, Ying Wang, Ji‐Feng Zhang, Ruihua An
1 links
IEEE Control Systems Letters
Distributed Control Multi-Agent Systems
article

One-Bit Consensus Control of Multi-Agent Systems With Packet Loss

Yanlong Zhao, Ying Wang, Ji‐Feng Zhang, Ruihua An
article en

Abstract

This letter investigates the one-bit consensus control of multi-agent systems (MASs) with independent and identically distributed and Markovian packet loss. To explore the impact of packet loss on one-bit communication, this letter first quantitatively characterizes the information loss of one-bit communications caused by packet loss, which provides the proportional relationship between one-bit data with and without packet loss in the sense of expectation. Based on quantitative characterizations, a one-bit packet loss consensus algorithm with a packet loss proportional coefficient is proposed to compensate for the information loss, where the coefficient is designed as the reciprocal of the information loss proportion. Furthermore, this letter demonstrates that the proposed algorithm enables the MAS to achieve one-bit consensus in the mean square sense at a rate of O(1/t) with packet loss. Two simulation examples are given to validate the algorithm.

IEEE Control Systems LettersVol. 9
Chinese Academy of Sciences (CN), Academy of Mathematics and Systems Science (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 86%
Distributed Control Multi-Agent Systems
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.