Graph Controllability Classes for the Laplacian Leader-Follower Dynamics
From MaRDI portal
Publication:2982707
DOI10.1109/TAC.2014.2381435zbMath1360.93085MaRDI QIDQ2982707
Bahman Gharesifard, Cesar O. Aguilar
Publication date: 16 May 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Related Items (22)
Partial strong structural controllability ⋮ Controllability of multi-agent systems with directed and weighted signed networks ⋮ Controllability of the multi-agent system modeled by the threshold graph with one repeated degree ⋮ Controllability of NEPSes of graphs ⋮ Almost equitable partitions and new necessary conditions for network controllability ⋮ The robust minimal controllability problem ⋮ Constructing a controllable graph under edge constraints ⋮ On a Conjecture of Godsil Concerning Controllable Random Graphs ⋮ Unified understanding and new results of controllability model of multi‐agent systems ⋮ On the selection of leaders for the controllability of multi-agent networks ⋮ SUSTAINABILITY NARROWNESS ⋮ Net Laplacian controllability for joins of signed graphs ⋮ Communicability cosine distance: similarity and symmetry in graphs/networks ⋮ Laplacian controllability for graphs obtained by some standard products ⋮ Networks with diagonal controllability Gramian: analysis, graphical conditions, and design algorithms ⋮ Stabilization of bilinear sparse matrix control systems using periodic inputs ⋮ Laplacian controllability classes for threshold graphs ⋮ Structural controllability of networked relative coupling systems ⋮ Rethinking structural balance in signed social networks ⋮ Block-based minimum input design for the structural controllability of complex networks ⋮ Eigenvectors and controllability of non-Hermitian random matrices and directed graphs ⋮ Characterizing controllable subspace and herdability of signed weighted networks via graph partition
This page was built for publication: Graph Controllability Classes for the Laplacian Leader-Follower Dynamics
