Discrete-Time Linear Dynamical System Control Using Sparse Inputs With Time-Varying Support
Krishna Praveen V. S. Kondapi, Chandrasekhar Sriram, Geethu Joseph, Chandra R. Murthy

TL;DR
This paper develops algorithms for controlling linear dynamical systems with sparse, time-varying actuators, ensuring controllability and minimizing control energy, while also designing noise-robust sparse controllers with theoretical guarantees.
Contribution
It introduces novel algorithms for sparse actuator scheduling and energy minimization, along with a sparse Kalman filter-based control method with performance bounds.
Findings
Sparse control achieves comparable performance to full control.
Algorithms guarantee controllability with minimal actuators.
Derived bounds on control energy and steady-state MSE.
Abstract
In networked control systems, communication resource constraints often necessitate the use of \emph{sparse} control input vectors. A prototypical problem is how to ensure controllability of a linear dynamical system when only a limited number of actuators (inputs) can be active at each time step. In this work, we first present an algorithm for determining the \emph{sparse actuator schedule}, i.e., the sequence of supports of the input vectors that ensures controllability. Next, we extend the algorithm to minimize the average control energy by simultaneously minimizing the trace of the controllability Gramian, under the sparsity constraints. We derive theoretical guarantees for both algorithms: the first algorithm ensures controllability with a minimal number of control inputs at a given sparsity level; for the second algorithm, we derive an upper bound on the average control energy…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
