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.
| Original language | English |
|---|---|
| Pages (from-to) | 1082-1092 |
| Journal | IEEE Transactions on Control of Network Systems |
| Volume | 8 |
| Issue number | 3 |
| Online published | 20 Apr 2021 |
| DOIs | |
| Publication status | Published - Sept 2021 |
Research Keywords
- Consensus protocol
- Control systems
- Convergence
- Directed graphs
- Distributed Algorithms/Control
- Eigenvalues and eigenfunctions
- Networks of Autonomous Agents
- scrambling constant
- Switches
- Upper bound
Fingerprint
Dive into the research topics of 'Tight Upper Bound for the Scrambling Constant of Uniformly Jointly Connected Directed Graphs With Application to Consensus of Multiagent Systems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver