Tight Upper Bound for the Scrambling Constant of Uniformly Jointly Connected Directed Graphs With Application to Consensus of Multiagent Systems

Chao Huang; Gang Feng; Hao Zhang; Huaicheng Yan

doi:10.1109/TCNS.2021.3074247

Author(s)

Chao Huang
Gang Feng
Hao Zhang
Huaicheng Yan

Related Research Unit(s)

Department of Biomedical Engineering

Detail(s)

Original language	English
Pages (from-to)	1082-1092
Journal / Publication	IEEE Transactions on Control of Network Systems
Volume	8
Issue number	3
Online published	20 Apr 2021
Publication status	Published - Sept 2021

Link(s)

DOI	DOI https://doi.org/10.1109/TCNS.2021.3074247 Final Published version
	Check@CityULib
Link to Scopus	https://www.scopus.com/record/display.uri?eid=2-s2.0-85104625451&origin=recordpage
Permanent Link	https://scholars.cityu.edu.hk/en/publications/publication(bdaf030f-3037-409a-8d3e-9bd8f2a4f571).html

Abstract

In this article, we give upper bounds for the scrambling constant (SC) of the composition of general uniformly jointly connected (UJC) directed graphs. Some bounds are tight as they can be achieved by the UJC complete N-layer graphs. Moreover, this article establishes new and explicit connections between the upper bounds and the number of consecutive graphs needed to composite a neighbor-shared graph. Then, the upper bounds are exploited to find new lower bounds for the convergence rate of consensus protocols over UJC communication graphs. The simulation shows that consensus over UJC complete N-layer graphs may have the slowest convergence rate over all unweighted switching graphs.

Research Area(s)

Consensus protocol, Control systems, Convergence, Directed graphs, Distributed Algorithms/Control, Eigenvalues and eigenfunctions, Networks of Autonomous Agents, scrambling constant, Switches, Upper bound

Citation Format(s)

[ RIS ] [ BibTeX ]

Tight Upper Bound for the Scrambling Constant of Uniformly Jointly Connected Directed Graphs With Application to Consensus of Multiagent Systems. / Huang, Chao; Feng, Gang; Zhang, Hao et al.
In: IEEE Transactions on Control of Network Systems, Vol. 8, No. 3, 09.2021, p. 1082-1092.

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

Huang, C, Feng, G, Zhang, H & Yan, H 2021, 'Tight Upper Bound for the Scrambling Constant of Uniformly Jointly Connected Directed Graphs With Application to Consensus of Multiagent Systems', IEEE Transactions on Control of Network Systems, vol. 8, no. 3, pp. 1082-1092. https://doi.org/10.1109/TCNS.2021.3074247

Huang, C., Feng, G., Zhang, H., & Yan, H. (2021). Tight Upper Bound for the Scrambling Constant of Uniformly Jointly Connected Directed Graphs With Application to Consensus of Multiagent Systems. IEEE Transactions on Control of Network Systems, 8(3), 1082-1092. https://doi.org/10.1109/TCNS.2021.3074247

Huang C, Feng G, Zhang H, Yan H. Tight Upper Bound for the Scrambling Constant of Uniformly Jointly Connected Directed Graphs With Application to Consensus of Multiagent Systems. IEEE Transactions on Control of Network Systems. 2021 Sept;8(3):1082-1092. Epub 2021 Apr 20. doi: 10.1109/TCNS.2021.3074247

Huang, Chao ; Feng, Gang ; Zhang, Hao et al. / Tight Upper Bound for the Scrambling Constant of Uniformly Jointly Connected Directed Graphs With Application to Consensus of Multiagent Systems. In: IEEE Transactions on Control of Network Systems. 2021 ; Vol. 8, No. 3. pp. 1082-1092.