Controllability of Kronecker product networks

From MaRDI portal
Publication:2280986



Abstract: A necessary and sufficient condition is derived for the controllability of Kronecker product networks, where the factor networks are general directed graphs. The condition explicitly illustrates how the controllability of the factor networks affects the controllability of the composite network. For the special case where at least one factor network is diagonalizable, an easily-verifiable condition is explicitly expressed. Furthermore, the controllability of higher-dimensional multi-agent systems is revisited, revealing that some controllability criterion reported in the literature does not hold. Consequently, a modified necessary and sufficient condition is established. The effectiveness of the new conditions is demonstrated through several examples.




Cites work









This page was built for publication: Controllability of Kronecker product networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2280986)