An outer-approximation approach for information-maximizing sensor selection
DOI10.1007/S11590-012-0457-9zbMATH Open1269.90074DBLPjournals/ol/ChoiHB13OpenAlexW2008246569WikidataQ60022211 ScholiaQ60022211MaRDI QIDQ1947624FDOQ1947624
Authors: Han-Lim Choi, Jonathan P. How, Paul I. Barton 
Publication date: 23 April 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0457-9
Recommendations
- Sensor selection for remote state estimation with QoS requirement constraints
- Sensor selection for random field estimation in wireless sensor networks
- Sensor selection for Kalman filtering of linear dynamical systems: complexity, limitations and greedy algorithms
- Simultaneous Optimal Control and Discrete Stochastic Sensor Selection
- scientific article; zbMATH DE number 1978152
Applications of mathematical programming (90C90) Semidefinite programming (90C22) Mixed integer programming (90C11)
Cites Work
- Matrix Analysis
- Title not available (Why is that?)
- On the distribution of the largest eigenvalue in principal components analysis
- Solving mixed integer nonlinear programs by outer approximation
- Dynamic programming and optimal control. Vol. 1.
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Constrained maximum-entropy sampling
- Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
- Maximum lifetime coverage preserving scheduling algorithms in sensor networks
- Dynamics of information systems. Theory and applications
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- Maximum-entropy remote sampling
- Continuous trajectory planning of mobile sensors for informative forecasting
- Title not available (Why is that?)
- Mobile Sensor Network Control Using Mutual Information Methods and Particle Filters
- Approximate Dynamic Programming for Communication-Constrained Sensor Network Management
- Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
- A linear integer programming bound for maximum-entropy sampling
- An Exact Algorithm for Maximum Entropy Sampling
- Solving maximum-entropy sampling problems using factored masks
Cited In (7)
- Approximate Supermodularity of Kalman Filter Sensor Selection
- Title not available (Why is that?)
- Sensor Selection Based on Generalized Information Gain for Target Tracking in Large Sensor Networks
- Informative windowed forecasting of continuous-time linear systems for mutual information-based sensor planning
- An outer-approximation algorithm for maximum-entropy sampling
- An outer-approximation algorithm for maximum-entropy sampling
- Approximating the minimal sensor selection for supervisory control
Uses Software
This page was built for publication: An outer-approximation approach for information-maximizing sensor selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1947624)
