Publication

Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs

Monshizadeh, N., Zhang, S. & Camlibel, M. K., Sep-2014, In : IEEE Transactions on Automatic Control. 59, 9, p. 2562-2567 6 p.

Research output: Contribution to journalArticleAcademicpeer-review

Copy link to clipboard

Documents

  • Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs

    Final publisher's version, 249 KB, PDF document

    Request copy

DOI

In this technical note, controllability of systems defined on graphs is discussed. We consider the problem of controllability of the network for a family of matrices carrying the structure of an underlying directed graph. A one-to-one correspondence between the set of leaders rendering the network controllable and zero forcing sets is established. To illustrate the proposed results, special cases including path, cycle, and complete graphs are discussed. Moreover, as shown for graphs with a tree structure, the proposed results of the present technical note together with the existing results on the zero forcing sets lead to a minimal leader selection scheme in particular cases.

Original languageEnglish
Pages (from-to)2562-2567
Number of pages6
JournalIEEE Transactions on Automatic Control
Volume59
Issue number9
Publication statusPublished - Sep-2014

    Keywords

  • Controllability, structural controllability, complex networks, zero forcing sets, NETWORKS

ID: 15772834