Journal
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
Volume 66, Issue 2, Pages 924-931Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2020.2989245
Keywords
Controllability; Kalman rank test; linear dynamical systems; Popov-Belevitch-Hautus (PBH) test; sparsity; switched linear systems
Funding
- Intel India Ph.D. fellowship
- MeitY Young Faculty Research Fellowship
Ask authors/readers for more resources
In this article, the controllability of a discrete-time linear dynamical system with sparse control inputs is considered. Algebraic necessary and sufficient conditions for ensuring controllability are derived and can be verified in polynomial time complexity. A generalized Kalman decomposition-like procedure is presented to separate the state-space into subspaces corresponding to sparse-controllable and sparse-uncontrollable parts, providing a theoretical basis for designing networked linear control systems with sparse inputs.
In this article, we consider the controllability of a discrete-time linear dynamical system with sparse control inputs. Sparsity constraints on the input arises naturally in networked systems, where activating each input variable adds to the cost of control. We derive algebraic necessary and sufficient conditions for ensuring controllability of a system with an arbitrary transfer matrix. The derived conditions can be verified in polynomial time complexity, unlike the more traditional Kalman-type rank tests. Further, we characterize the minimum number of input vectors required to satisfy the derived conditions for controllability. Finally, we present a generalized Kalman decomposition-like procedure that separates the state-space into subspaces corresponding to sparse-controllable and sparse-uncontrollable parts. These results form a theoretical basis for designing networked linear control systems with sparse inputs.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available