|Computation of the Distance-Based Bound on Strong Structural Controllability in Networks|
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||
IEEE Transactions on Automatic Control
|Number of Pages||
|Google Scholar | BibTeX | XML | DOI|