A Separation Theorem for Joint Sensor and Actuator Scheduling with Guaranteed Performance Bounds

We study the problem of jointly designing a sparse sensor and actuator schedule for linear dynamical systems while guaranteeing a control/estimation performance that approximates the fully sensed/actuated setting. We further prove a separation principle, showing that the problem can be decomposed into finding sensor and actuator schedules separately. However, it is shown that this problem cannot be efficiently solved or approximated in polynomial, or even quasi-polynomial time for time-invariant sensor/actuator schedules; instead, we develop deterministic polynomial-time algorithms for a time-varying sensor/actuator schedule with guaranteed approximation bounds. Our main result is to provide a polynomial-time joint actuator and sensor schedule that on average selects only a constant number of sensors and actuators at each time step, irrespective of the dimension of the system. The key idea is to sparsify the controllability and observability Gramians while providing approximation guarantees for Hankel singular values. This idea is inspired by recent results in theoretical computer science literature on sparsification.

[1]  Alexander Olshevsky,et al.  Minimal Controllability Problems , 2013, IEEE Transactions on Control of Network Systems.

[2]  David Moxey,et al.  Glycolytic Oscillations and Limits on Robust Efficiency , 2011 .

[3]  Milad Siami,et al.  Limitations and Tradeoffs in Minimum Input Selection Problems , 2018, 2018 Annual American Control Conference (ACC).

[4]  B. Moore.  Principal component analysis in linear systems: Controllability, observability, and model reduction , 1981 .

[5]  George J. Pappas,et al.  Minimal Actuator Placement With Bounds on Control Effort , 2014, IEEE Transactions on Control of Network Systems.

[6]  Alexander Olshevsky,et al.  Minimum input selection for structural controllability , 2014, 2015 American Control Conference (ACC).

[7]  Michael Athans,et al.  1972 IFAC congress paper: On the determination of optimal costly measurement strategies for linear stochastic systems , 1972 .

[8]  Javad Lavaei,et al.  Convex Relaxation for Optimal Distributed Control Problems , 2014, IEEE Transactions on Automatic Control.

[9]  Milad Siami,et al.  Network Abstraction With Guaranteed Performance Bounds , 2018, IEEE Transactions on Automatic Control.

[10]  D. Spielman,et al.  Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem , 2013, 1306.3969.

[11]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[12]  M. Athans.  On the Determination of Optimal Costly Measurement Strategies for Linear Stochastic Systems , 1972 .

[13]  Ibrahem E Atawi.  An Advance Distributed Control Design for Wide-Area Power System Stability , 2013 .

[14]  Jorge Cortés,et al.  Time-invariant versus time-varying actuator scheduling in complex networks , 2017, 2017 American Control Conference (ACC).

[15]  Milad Siami,et al.  Structural Analysis and Optimal Design of Distributed System Throttlers , 2017, IEEE Transactions on Automatic Control.

[16]  George J. Pappas,et al.  Sensing-Constrained LQG Control , 2017, 2018 Annual American Control Conference (ACC).

[17]  Andrey V. Savkin,et al.  A framework for optimal actuator/sensor selection in a control system , 2019, Int. J. Control.

[18]  Shaunak Dattaprasad Bopardikar,et al.  Sensor Selection via Randomized Sampling , 2017, ArXiv.

[19]  John Lygeros,et al.  On Submodularity and Controllability in Complex Dynamical Networks , 2014, IEEE Transactions on Control of Network Systems.

[20]  H. Weber,et al.  Analysis and optimization of certain qualities of controllability and observability for linear dynamical systems , 1972 .

[21]  Francesco Bullo,et al.  Controllability Metrics, Limitations and Algorithms for Complex Networks , 2013, IEEE Transactions on Control of Network Systems.

[22]  Vikas Singh,et al.  Experimental Design on a Budget for Sparse Linear Models and Applications , 2016, ICML.

[23]  Michael Frankfurter,et al.  Control And Optimization Methods For Electric Smart Grids , 2016 .

[24]  Yuanzhi Li,et al.  Near-Optimal Design of Experiments via Regret Minimization , 2017, ICML.

[25]  Milad Siami,et al.  Deterministic and Randomized Actuator Scheduling With Guaranteed Performance Bounds , 2018, IEEE Transactions on Automatic Control.

[26]  Jorge Cortes,et al.  Heterogeneity of central nodes explains the benefits of time-varying control scheduling in complex dynamical networks , 2019, J. Complex Networks.

[27]  Athanasios C. Antoulas,et al.  Approximation of Large-Scale Dynamical Systems , 2005, Advances in Design and Control.

[28]  Zhipeng Liu,et al.  Minimal input selection for robust control , 2017, 2017 IEEE 56th Annual Conference on Decision and Control (CDC).

[29]  Tyler H. Summers,et al.  Algorithms for Joint Sensor and Control Nodes Selection in Dynamic Networks , 2018, Autom..

[30]  K. Glover.  Model Reduction: A Tutorial on Hankel-Norm Methods and Lower Bounds on L 2 Errors , 1987 .

[31]  Soummya Kar,et al.  The robust minimal controllability problem , 2017, Autom..

[32]  Milad Siami,et al.  A Separation Principle for Joint Sensor and Actuator Scheduling with Guaranteed Performance Bounds , 2019, 2019 IEEE 58th Conference on Decision and Control (CDC).

[33]  Venkat Chandrasekaran,et al.  Regularization for Design , 2014, IEEE Transactions on Automatic Control.

[34]  Christos Boutsidis,et al.  Near Optimal Column-Based Matrix Reconstruction , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[35]  Mehran Mesbahi,et al.  What Can Systems Theory of Networks Offer to Biology? , 2012, PLoS Comput. Biol..

[36]  Albert-László Barabási,et al.  Control Principles of Complex Networks , 2015, ArXiv.

[37]  Magnus Egerstedt,et al.  Graph Distances and Controllability of Networks , 2016, IEEE Transactions on Automatic Control.

[38]  Soummya Kar,et al.  On the complexity of the constrained input selection problem for structural linear systems , 2014, Autom..

[39]  George J. Pappas,et al.  Minimal Reachability is Hard To Approximate , 2019, IEEE Transactions on Automatic Control.

[40]  M. di Bernardo,et al.  How to Turn a Genetic Circuit into a Synthetic Tunable Oscillator, or a Bistable Switch , 2009, PloS one.

[41]  Michael A. Demetriou,et al.  Optimal actuator/sensor location for active noise regulator and tracking control problems , 2000 .

[42]  Shapour Azarm,et al.  Optimal actuator placement for linear systems with limited number of actuators , 2017, 2017 American Control Conference (ACC).