Abstract
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 language | English |
|---|---|
| Pages (from-to) | 2562-2567 |
| Number of pages | 6 |
| Journal | IEEE Transactions on Automatic Control |
| Volume | 59 |
| Issue number | 9 |
| DOIs | |
| Publication status | Published - Sept-2014 |
Keywords
- Controllability
- structural controllability
- complex networks
- zero forcing sets
- NETWORKS