Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems
DOI10.1016/J.AUTOMATICA.2015.08.022zbMATH Open1327.93369OpenAlexW1803898544MaRDI QIDQ900693FDOQ900693
Stephen Smith, Syed Talha Jawaid
Publication date: 22 December 2015
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2015.08.022
Recommendations
- On efficient sensor scheduling for linear dynamical systems
- Optimal sensor scheduling for multiple linear dynamical systems
- A complete greedy algorithm for infinite-horizon sensor scheduling
- On the Optimal Solutions of the Infinite-Horizon Linear Sensor Scheduling Problem
- Randomized Greedy Sensor Selection: Leveraging Weak Submodularity
- Approximate optimal periodic scheduling of multiple sensors with constraints
- Optimal Periodic Sensor Scheduling in Networks of Dynamical Systems
- Optimal sensor scheduling in continuous time
- Hybrid method for a general optimal sensor scheduling problem in discrete time
- A greedy Galerkin method to efficiently select sensors for linear dynamical systems
Filtering in stochastic control theory (93E11) Linear systems in control theory (93C05) Discrete-time control/observation systems (93C55) Estimation and detection in stochastic control theory (93E10)
Cites Work
- Title not available (Why is that?)
- Sensor Selection via Convex Optimization
- Kalman Filtering With Intermittent Observations
- Linear systems theory.
- Is submodularity testable?
- An analysis of approximations for maximizing submodular set functions—I
- 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
- On efficient sensor scheduling for linear dynamical systems
- Stochastic sensor activation for distributed state estimation over a sensor network
- Periodicity of Kalman-based scheduled filters
- Title not available (Why is that?)
- Sensor selection via compressed sensing
- On the determination of optimal costly measurement strategies for linear stochastic systems
Cited In (12)
- Distributed strategy selection: a submodular set function maximization approach
- Submodularity-based false data injection attack scheme in multi-agent dynamical systems
- A randomized approach to sensor placement with observability assurance
- An exact solution approach for the mobile multi‐agent sensing problem
- Optimal sensor communications in presence of transmission delays and bandwidth limitations
- Randomized Greedy Sensor Selection: Leveraging Weak Submodularity
- Sensor scheduling for linear systems: A covariance tracking approach
- Multi-hop sensor network scheduling for optimal remote estimation
- Maximization of nonsubmodular functions under multiple constraints with applications
- Sensor selection for Kalman filtering of linear dynamical systems: complexity, limitations and greedy algorithms
- Optimal sensor scheduling for multiple linear dynamical systems
- A complete greedy algorithm for infinite-horizon sensor scheduling
This page was built for publication: Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q900693)
