JOURNAL ARTICLE

Quantized consensus of first-order multi-agent systems under directed communication topologies

Abstract

This paper investigates the sampled-data based consensus problem of first-order multi-agent systems with quantized communication. A deterministic consensus protocol with the logarithmic quantizer proposed in the literature is reinvestigated. A new sufficient condition is derived under which consensus is achieved. It is proved that for any network topology that has a directed spanning tree, consensus is achieved if the quantization accuracy parameter and the sampling period are small enough. A numerical example is given to illustrate the theoretical results.

Keywords:
Network topology Consensus Multi-agent system Quantization (signal processing) Computer science Logarithm Topology (electrical circuits) Spanning tree Protocol (science) Strongly connected component Consensus algorithm Tree (set theory) Mathematics Mathematical optimization Algorithm Artificial intelligence Discrete mathematics Computer network

Metrics

3
Cited By
0.72
FWCI (Field Weighted Citation Impact)
21
Refs
0.75
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
Energy Efficient Wireless Sensor Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
© 2026 ScienceGate Book Chapters — All rights reserved.