Controllability of Kronecker product networks

• Autores: Yuning Hao, Qingyun Wang, Zhisheng Duan, Guanrong Chen
• Localización: Automatica: A journal of IFAC the International Federation of Automatic Control, ISSN 0005-1098, Nº. 110, 2019
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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.