Paper Info
Title
Leader-Following Discrete-Time Bipartite Consensus On Signed Networks
Abstract
Distributed averaging has applications in a wide range of distributed algorithms. Previous studies are mostly concentrated on the networks with only non-negative weighted edges. This paper examines the leader-following discrete-time bipartite consensus problem under signed networks, namely, both positively and negatively weighted edges are allowed. It is shown that the absolute value of the steady-state of the agents is upper and lower bounded by the largest and the smallest absolute value of external input, respectively. Specifically, for structurally balanced networks, it is shown that the absolute value of the bipartite consensus converges to the absolute value of the external input. Furthermore, a quantitative characterization of the bipartite consensus on structurally balanced networks is provided according to the sign pattern of the influence exerted by external input. Simulation results are finally provided to demonstrate the theoretical results.
Year
DOI
Venue
2019
10.1109/ICCA.2019.8899929
2019 IEEE 15TH INTERNATIONAL CONFERENCE ON CONTROL AND AUTOMATION (ICCA)
Field
DocType
ISSN
Consensus,Discrete mathematics,Control theory,Absolute value,Bipartite graph,Distributed algorithm,Engineering,Discrete time and continuous time,Bounded function
Conference
1948-3449
Citations 
PageRank 
References 
0
0.34
0
Authors
6
Name
Order
Citations
PageRank
Lulu Pan121.03
Haibin Shao200.68
Yu-Geng Xi317815.94
Dewei Li4122.87
Shibei Xue501.01
Shuai Jia6265.14