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

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 <inline-formula><tex-math notation="LaTeX">N</tex-math>...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on control of network systems Ročník 8; číslo 3; s. 1082 - 1092
Hlavní autoři: Huang, Chao, Feng, Gang, Zhang, Hao, Yan, Huaicheng
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 01.09.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Consensus protocol
Control systems
Convergence
Directed graphs
Distributed algorithms/control
Eigenvalues and eigenfunctions
Graph theory
Graphs
Lower bounds
Multiagent systems
networks of autonomous agents
scrambling constant (SC)
Switches
Upper bound
Upper bounds
ISSN:2325-5870, 2372-2533
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 <inline-formula><tex-math notation="LaTeX">N</tex-math></inline-formula>-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 <inline-formula><tex-math notation="LaTeX">N</tex-math></inline-formula>-layer graphs may have the slowest convergence rate over all unweighted switching graphs.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2325-5870
2372-2533
DOI:10.1109/TCNS.2021.3074247