| Computation of the Distance-Based Bound on Strong Structural Controllability in Networks | |
|---|---|
| Author | |
| Abstract |
In this article, we study the problem of computing a tight lower bound on the dimension of the strong structurally controllable subspace (SSCS) in networks with Laplacian dynamics. The bound is based on a sequence of vectors containing the distances between leaders (nodes with external inputs) and followers (remaining nodes) in the underlying network graph. Such vectors are referred to as the distance-to-leaders vectors.
|
| Year of Publication |
2023
|
| Journal |
IEEE Transactions on Automatic Control
|
| Volume |
68
|
| Number of Pages |
1768-1775
|
| Date Published |
03/2023
|
| ISSN Number |
1558-2523
|
| URL |
https://ieeexplore.ieee.org/document/9738436
|
| DOI |
10.1109/TAC.2022.3160682
|
| Google Scholar | BibTeX | XML | DOI | |