Structural Controllability Recovery via the Minimum-edge Addition
Shuo Zhang, Stephen Dirk Bjørn Wolthusen · 2019
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, so that the final graph 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.