Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems

DOI10.1016/J.AUTOMATICA.2015.08.022MaRDI QIDQ900693zbMATH OpenOpenAlexFDO

Authors Syed Talha Jawaid, Stephen Smith

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

zbMATH Keywords

greedy algorithmssensor networksKalman filterssensor schedulingmulti-sensor estimation

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3635849 (Why is no real title available?)
• Adaptive submodularity: theory and applications in active learning and stochastic optimization
• An analysis of approximations for maximizing submodular set functions—I
• Is submodularity testable?
• Kalman Filtering With Intermittent Observations
• Linear systems theory.
• On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
• On efficient sensor scheduling for linear dynamical systems
• On the determination of optimal costly measurement strategies for linear stochastic systems
• Periodicity of Kalman-based scheduled filters
• Sensor Selection via Convex Optimization
• Sensor selection strategies for state estimation in energy constrained wireless sensor networks
• Sensor selection via compressed sensing
• Stochastic sensor activation for distributed state estimation over a sensor network

Cited in

(13)

• Distributed strategy selection: a submodular set function maximization approach
• A randomized approach to sensor placement with observability assurance
• Submodularity-based false data injection attack scheme in multi-agent dynamical systems
• Optimal sensor communications in presence of transmission delays and bandwidth limitations
• An exact solution approach for the mobile multi‐agent sensing problem
• Randomized Greedy Sensor Selection: Leveraging Weak Submodularity
• Sensor scheduling for linear systems: A covariance tracking approach
• On efficient sensor scheduling for linear dynamical systems
• 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)