A randomized approach to sensor placement with observability assurance

Abstract Given a linear dynamical system, we provide a probabilistic treatment to the classic problem of placing sensors in a set of candidate locations such that the observability Gramian of the resulting placement is sufficiently non-singular. Our contributions are as follows: First, we present a randomized algorithm that samples the sensor locations with replacement as per a specified distribution. Second, we derive a high probability bound on two measures of non-singularity, viz. the minimum eigenvalue and the trace of the inverse of the observability Gramian of the resulting placement, relative to that of placing one sensor at every location. Our analysis yields upper and lower bounds on any eigenvalue-based metric used in sensor placement and characterizes the tradeoff between the number of samples required by the algorithm and the two measures of the observability Gramian. We supplement the claims with insightful numerical studies and comparisons with multiple competing approaches.

[1]  Marc M. J. van de Wal,et al.  A review of methods for input/output selection , 2001, Autom..

[2]  Derek A. Paley,et al.  Observability-based Optimization of Coordinated Sampling Trajectories for Recursive Estimation of a Strong, Spatially Varying Flowfield , 2013, J. Intell. Robotic Syst..

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

[4]  Petros Drineas,et al.  Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication , 2006, SIAM J. Comput..

[5]  Radha Poovendran,et al.  Maximizing the Smallest Eigenvalue of a Symmetric Matrix: A Submodular Optimization Approach , 2017, Autom..

[6]  Mathukumalli Vidyasagar,et al.  Statistical learning theory and randomized algorithms for control , 1998 .

[7]  Joel A. Tropp,et al.  User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..

[8]  Victor M. Preciado,et al.  Controllability Gramian spectra of random networks , 2016, 2016 American Control Conference (ACC).

[9]  R. Tempo,et al.  Randomized Algorithms for Analysis and Control of Uncertain Systems , 2004 .

[10]  Joel A. Tropp,et al.  An Introduction to Matrix Concentration Inequalities , 2015, Found. Trends Mach. Learn..

[11]  Xiaobo Tan,et al.  Randomized Sensor Selection for Nonlinear Systems With Application to Target Localization , 2019, IEEE Robotics and Automation Letters.

[12]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[13]  R. Tempo,et al.  Probabilistic robustness analysis: explicit bounds for the minimum number of samples , 1997 .

[14]  M. Wicks,et al.  Sums of Matrix-Valued Random Variables , 2014 .

[15]  Maryam Kamgarpour,et al.  Performance guarantees for greedy maximization of non-submodular controllability metrics , 2017, 2019 18th European Control Conference (ECC).

[16]  Stephen P. Boyd,et al.  Sensor Selection via Convex Optimization , 2009, IEEE Transactions on Signal Processing.

[17]  Stephen L. Smith,et al.  Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems , 2015, Autom..

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

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

[20]  Soummya Kar,et al.  Minimum cost input/output design for large-scale linear structural systems , 2014, Autom..

[21]  Giuseppe Carlo Calafiore,et al.  The scenario approach to robust control design , 2006, IEEE Transactions on Automatic Control.

[22]  George J. Pappas,et al.  Sensor placement for optimal Kalman filtering: Fundamental limits, submodularity, and algorithms , 2015, 2016 American Control Conference (ACC).

[23]  Shreyas Sundaram,et al.  Sensor selection for Kalman filtering of linear dynamical systems: Complexity, limitations and greedy algorithms , 2017, Autom..

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

[25]  Gaurav Gupta,et al.  Approximate Submodular Functions and Performance Guarantees , 2018, ArXiv.

[26]  Ufuk Topcu,et al.  A Randomized Greedy Algorithm for Near-Optimal Sensor Scheduling in Large-Scale Sensor Networks , 2017, 2018 Annual American Control Conference (ACC).

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

[28]  R. Govindan,et al.  Utility-based sensor selection , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[29]  Arthur J. Krener,et al.  Measures of unobservability , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.