A review of some exchange algorithms for constructing discrete D-optimal designs
Computational Statistics & Data Analysis - Second special issue on optimization techniques in statistics
Randomized algorithms
Optimal wire and transistor sizing for circuits with non-tree topology
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Data Fusion and Sensor Management: A Decentralized Information-Theoretic Approach
Data Fusion and Sensor Management: A Decentralized Information-Theoretic Approach
On an Optimization Problem in Sensor Selection
Discrete Event Dynamic Systems
D-optimal designs for sensor and actuator locations
Computers and Operations Research - Location analysis
Sensor selection: a geometrical approach
IROS '95 Proceedings of the International Conference on Intelligent Robots and Systems-Volume 2 - Volume 2
Wireless Sensor Networks: An Information Processing Approach
Wireless Sensor Networks: An Information Processing Approach
Entropy-based sensor selection heuristic for target localization
Proceedings of the 3rd international symposium on Information processing in sensor networks
Convex Optimization
Multivariate Nonnegative Quadratic Mappings
SIAM Journal on Optimization
Utility based sensor selection
Proceedings of the 5th international conference on Information processing in sensor networks
Optimal Design of Experiments (Classics in Applied Mathematics) (Classics in Applied Mathematics, 50)
The sensor selection problem for bounded uncertainty sensing models
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Computation of Minimum-Volume Covering Ellipsoids
Operations Research
Maximum mutual information principle for dynamic sensor query problems
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Automatica (Journal of IFAC)
Just relax: convex programming methods for identifying sparse signals in noise
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Automatica (Journal of IFAC)
Feasibility analysis on optimal sensor selection in cyber-physical systems
ACC'09 Proceedings of the 2009 conference on American Control Conference
Cross-entropy optimization for sensor selection problems
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
A convex optimization approach of multi-step sensor selection under correlated noise
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Robust linear dimensionality reduction for hypothesis testing with application to sensor selection
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Joint power allocation and relay selection in cooperative networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Estimation of distribution algorithm for sensor selection problems
RWS'10 Proceedings of the 2010 IEEE conference on Radio and wireless symposium
Signal recovery with cost-constrained measurements
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Sensor selection strategies for state estimation in energy constrained wireless sensor networks
Automatica (Journal of IFAC)
Stability of dynamical networks with non-identical nodes: A multiple V-Lyapunov function method
Automatica (Journal of IFAC)
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Convex feasibility modeling and projection methods for sparse signal recovery
Journal of Computational and Applied Mathematics
On efficient sensor scheduling for linear dynamical systems
Automatica (Journal of IFAC)
Integration, the VLSI Journal
Sensing task assignment via sensor selection for maximum target coverage in WSNs
Journal of Network and Computer Applications
Scheduling parallel Kalman filters for multiple processes
Automatica (Journal of IFAC)
Journal of Signal Processing Systems
Approximate optimal periodic scheduling of multiple sensors with constraints
Automatica (Journal of IFAC)
Utility-driven data acquisition in participatory sensing
Proceedings of the 16th International Conference on Extending Database Technology
PCRLB-based sensor selection for maneuvering target tracking in range-based sensor networks
Future Generation Computer Systems
Sensor selection via compressed sensing
Automatica (Journal of IFAC)
Column Subset Selection Problem is UG-hard
Journal of Computer and System Sciences
Hi-index | 35.71 |
We consider the problem of choosing a set of k sensor measurements, from a set of m possible or potential sensor measurements, that minimizes the error in estimating some parameters. Solving this problem by evaluating the performance for each of the (mk) possible choices of sensor measurements is not practical unless m and k are small. In this paper, we describe a heuristic, based on convex optimization, for approximately solving this problem. Our heuristic gives a subset selection as well as a bound on the best performance that can be achieved by any selection of k sensor measurements. There is no guarantee that the gap between the performance of the chosen subset and the performance bound is always small; but numerical experiments suggest that the gap is small in many cases. Our heuristic method requires on the order of m3 operations; for m = 1000 possible sensors, we can carry out sensor selection in a few seconds on a 2-GHz personal computer.