Sparsity-Promoting Sensor Selection for Non-Linear Measurement Models

DOI10.1109/TSP.2014.2379662zbMATH Open1394.94124arXiv1310.5251OpenAlexW2963005128MaRDI QIDQ4579718FDOQ4579718

Authors: Sundeep Prabhakar Chepuri, G. Leus 

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: Sensor selection is an important design problem in large-scale sensor networks. Sensor selection can be interpreted as the problem of selecting the best subset of sensors that guarantees a certain estimation performance. We focus on observations that are related to a general non-linear model. The proposed framework is valid as long as the observations are independent, and its likelihood satisfies the regularity conditions. We use several functions of the Cram'er-Rao bound (CRB) as a performance measure. We formulate the sensor selection problem as the design of a selection vector, which in its original form is a nonconvex l0-(quasi) norm optimization problem. We present relaxed sensor selection solvers that can be efficiently solved in polynomial time. We also propose a projected subgradient algorithm that is attractive for large-scale problems and also show how the algorithm can be easily distributed. The proposed framework is illustrated with a number of examples related to sensor placement design for localization.

Full work available at URL: https://arxiv.org/abs/1310.5251

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited In (17)

• A projected gradient method for nonlinear inverse problems with \(\alpha \ell_1 - \beta \ell_2\) sparsity regularization
• Optimal sensor placement for joint parameter and state estimation problems in large-scale dynamical systems with applications to thermo-mechanics
• Optimal \(\alpha,\mathfrak{d})\)-multi-completion of \(\mathfrak{d}\)-designs
• Distributed Sparsity-Aware Sensor Selection
• Parameter estimation in epidemic spread networks using limited measurements
• \(\alpha \ell_1 - \beta \ell_2\) sparsity regularization for nonlinear ill-posed problems
• Q-learning-based target selection for bearings-only autonomous navigation
• An On-line Sensor Selection Algorithm for SPRT With Multiple Sensors
• Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion
• Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems
• A majorization-minimization algorithm for optimal sensor location in distributed parameter systems
• Study of MVDR beamforming with spatially distributed source: theoretical analysis and efficient microphone array geometry optimization method
• Outlier accommodation in moving-horizon state estimation: a risk-averse performance-specified approach
• Maximization of nonsubmodular functions under multiple constraints with applications
• Morozov's discrepancy principle for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization
• Sensor selection for Kalman filtering of linear dynamical systems: complexity, limitations and greedy algorithms
• Sensor selection via compressed sensing

This page was built for publication: Sparsity-Promoting Sensor Selection for Non-Linear Measurement Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579718)