A convex optimization approach to worst-case optimal sensor selection

This paper considers the problem of optimal sensor selection in a worst-case setup. Our objective is to estimate a given quantity based on noisy measurements and using no more than n sensors out of a total of N available, possibly subject to additional selection constraints. Contrary to most of the literature, we consider the case where the only information available about the noise is a deterministic set-membership description and the goal is to minimize the worst-case estimation error. While in principle this is a hard, combinatorial optimization problem, we show that tractable convex relaxations can be obtained by using recent results on polynomial optimization.

[1]  Bruno Sinopoli,et al.  A convex optimization approach of multi-step sensor selection under correlated noise , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[2]  Avishy Carmi,et al.  Sensor scheduling via compressed sensing , 2010, 2010 13th International Conference on Information Fusion.

[3]  Georgios B. Giannakis,et al.  Selecting reliable sensors via convex optimization , 2010, 2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

[4]  T. J. Rivlin,et al.  Optimal Estimation in Approximation Theory , 1977 .

[5]  Antonio Vicino,et al.  Optimal estimation theory for dynamic systems with set membership uncertainty: An overview , 1991, Autom..

[6]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[7]  Jean B. Lasserre,et al.  An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs , 2001, IPCO.

[8]  Andreas Krause,et al.  Near-optimal Nonmyopic Value of Information in Graphical Models , 2005, UAI.

[9]  R. Tempo.  Robust estimation and filtering in the presence of bounded noise , 1987, 26th IEEE Conference on Decision and Control.

[10]  Bruno Sinopoli,et al.  Sensor selection strategies for state estimation in energy constrained wireless sensor networks , 2011, Autom..

[11]  Andreas Krause,et al.  Near-optimal Observation Selection using Submodular Functions , 2007, AAAI.

[12]  Raúl E. Curto,et al.  Solution of the Truncated Complex Moment Problem for Flat Data , 1996 .

[13]  Charles A. Micchelli,et al.  A Survey of Optimal Recovery , 1977 .

[14]  H. Woxniakowski.  Information-Based Complexity , 1988 .

[15]  Rudolf Mathar,et al.  Strategies for distributed sensor selection using convex optimization , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[16]  R. Tempo,et al.  Optimal algorithms theory for robust estimation and prediction , 1985 .

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

[18]  Dinesh Verma,et al.  A survey of sensor selection schemes in wireless sensor networks , 2007, SPIE Defense + Commercial Sensing.