Abstract
Identifying a set of inputs is a way to recover structural controllability of a structurally uncontrollable system, but it is meaningless if recovery needs more number of inputs than that of actually valid ones. Given a structurally uncontrollable system with given inputs, we recover its structural controllability. By graph-theoretical conditions of a structurally controllable system, we add a minimum set of edges into a digraph that represents the given system via its one maximum matching, so that the final digraph represents a structurally controllable system. Compared with the existing edge-addition method, for the worst-case execution time, our minimum edge-addition can be done in more efficient polynomial time.
| Original language | English |
|---|---|
| Pages | 1-6 |
| Number of pages | 6 |
| Publication status | Published - 29 Aug 2019 |
| Event | 2019 AMERICAN CONTROL CONFERENCE - PHILADELPHIA, United States Duration: 10 Jul 2019 → 12 Jul 2019 |
Conference
| Conference | 2019 AMERICAN CONTROL CONFERENCE |
|---|---|
| Country/Territory | United States |
| City | PHILADELPHIA |
| Period | 10/07/19 → 12/07/19 |
Keywords
- Structural Controllability
- Edge Addition
- Optimization
- Maximum Matching