JOURNAL ARTICLE

Quantized consensus for linear discrete-time multi-agent systems

Abstract

In this paper, we consider distributed consensus of linear discrete-time agents whose states are transmitted through logarithmic quantizer. A distributed consensus protocol is proposed based on the states and outputs of encoders and decoders. Even though every single agent's system is stabilized, the consensus of whole multi-agent system may still not be achieved. We prove that for some linear discrete-time systems, by selecting the parameters of logarithmic quantizer properly, the asymptotic consensus can be achieved. We also derive the upper bound for the convergence rate of consensus algorithm. A simulation is given to show the feasibility of the proposed consensus protocol.

Keywords:
Consensus Logarithm Protocol (science) Multi-agent system Convergence (economics) Upper and lower bounds Computer science Discrete time and continuous time Rate of convergence Linear system Encoder Consensus algorithm Uniform consensus Control theory (sociology) Mathematics Mathematical optimization Algorithm Artificial intelligence

Metrics

7
Cited By
0.38
FWCI (Field Weighted Citation Impact)
21
Refs
0.64
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Distributed Control Multi-Agent Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications
Neural Networks Stability and Synchronization
Physical Sciences →  Computer Science →  Computer Networks and Communications
Stability and Control of Uncertain Systems
Physical Sciences →  Engineering →  Control and Systems Engineering
© 2026 ScienceGate Book Chapters — All rights reserved.