Sensor selection for Kalman filtering of linear dynamical systems: complexity, limitations and greedy algorithms
From MaRDI portal
Publication:518316
DOI10.1016/j.automatica.2016.12.025zbMath1357.93100OpenAlexW2582646431MaRDI QIDQ518316
Raid Ayoub, Haotian Zhang, Shreyas Sundaram
Publication date: 28 March 2017
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2016.12.025
Filtering in stochastic control theory (93E11) Abstract computational complexity for mathematical programming problems (90C60) Estimation and detection in stochastic control theory (93E10) Optimal stochastic control (93E20)
Related Items
Inadequacy of linear methods for minimal sensor placement and feature selection in nonlinear systems: a new approach using secants, A randomized approach to sensor placement with observability assurance, Multi-hop sensor network scheduling for optimal remote estimation, Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey, On polynomially solvable constrained input selections for fixed and switched linear structured systems, Maximization of nonsubmodular functions under multiple constraints with applications, Submodularity-based false data injection attack scheme in multi-agent dynamical systems, Sensor placement for optimal estimation of vector-valued diffusion processes, Q-learning-based target selection for bearings-only autonomous navigation, Strategic sensor placement on graphs, An improved \(H_\infty\) filtering for Markovian jump system with time-varying delay based on finite frequency domain
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems
- Estimation, control, and the discrete Kalman filter
- Sensor selection strategies for state estimation in energy constrained wireless sensor networks
- On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
- Matrix Analysis
- Upper bounds for the solution of the discrete Riccati equation
- Iterative matrix bounds and computational solutions to the discrete algebraic Riccati equation
- Upper matrix bound of the solution for the discrete Riccati equation
- Sensor Selection via Convex Optimization
- Sparsity-Promoting Sensor Selection for Non-Linear Measurement Models
- Deterministic Sensor Selection for Centralized State Estimation Under Limited Communication Resource
- Sensor Selection and Precoding Strategies for Wireless Sensor Networks
- Bounds in algebraic Riccati and Lyapunov equations: a survey and some new results
- Eigenvalue Inequalities for Matrix Product
- Optimal Pruning for Multi-Step Sensor Scheduling
- Design of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers
- Minimal Controllability Problems
- Minimal Actuator Placement With Bounds on Control Effort
- On Submodularity and Controllability in Complex Dynamical Networks
- Geometric methods for optimal sensor design
- A review of methods for input/output selection
