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

Podrobná bibliografia

Vydané v:	IEEE transactions on control of network systems Ročník 8; číslo 3; s. 1082 - 1092
Hlavní autori:	Huang, Chao, Feng, Gang, Zhang, Hao, Yan, Huaicheng
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Piscataway IEEE 01.09.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!