Bipartite Consensus in Networks of Agents With Antagonistic Interactions and Quantization

This brief deals with the consensus problem in a network of agents with cooperative and antagonistic interactions subject to quantization. By employing the techniques from nonsmooth analysis, we prove that all agents can be guaranteed to asymptotically reach bipartite consensus for any logarithmic q...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on circuits and systems. II, Express briefs Vol. 65; no. 12; pp. 2012 - 2016
Main Authors Zhu, Yunru, Li, Sulan, Ma, Jingying, Zheng, Yuanshi
Format Journal Article
LanguageEnglish
Published New York IEEE 01.12.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Asymptotic properties
bipartite consensus
Circuits and systems
Cooperative and antagonistic interactions
finite-time consensus
logarithmic quantizer
Measurement
Network topology
Protocols
Quantization (signal)
Reagents
Simulation
Symmetric matrices
Topology
Online AccessGet full text

Cover

More Information
Summary:This brief deals with the consensus problem in a network of agents with cooperative and antagonistic interactions subject to quantization. By employing the techniques from nonsmooth analysis, we prove that all agents can be guaranteed to asymptotically reach bipartite consensus for any logarithmic quantizer accuracy under connected and structurally balanced topology and the states of all agents asymptotically converge to zero under connected and structurally unbalanced topology. In addition, finite-time bipartite consensus is considered for single-integrator agents with binary quantized information. The simulation results are given to demonstrate the effectiveness of the theoretical results.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1549-7747
1558-3791
DOI:10.1109/TCSII.2018.2811803