A complete greedy algorithm for infinite-horizon sensor scheduling

DOI10.1016/J.AUTOMATICA.2017.04.018MaRDI QIDQ2409254zbMATH OpenOpenAlexFDO

Authors Ahmad Bilal Asghar, Syed Talha Jawaid, Stephen Smith

Publication date 11 October 2017

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.automatica.2017.04.018

zbMATH Keywords

Kalman filtersmulti-sensor estimationsensor networkssensor scheduling

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Estimation and detection in stochastic control theory (93E10) Filtering in stochastic control theory (93E11)

Recommendations

• On infinite-horizon sensor scheduling
• Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems
• On efficient sensor scheduling for linear dynamical systems
• Stochastic sensor scheduling via distributed convex optimization
• The problem of optimal robust sensor scheduling

Cites work

• Approximate optimal periodic scheduling of multiple sensors with constraints
• Detectability and Stabilizability of Time-Varying Discrete-Time Linear Systems
• Greedy Adaptive Linear Compression in Signal-Plus-Noise Models
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Multiplying matrices faster than coppersmith-winograd
• On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
• On efficient sensor scheduling for linear dynamical systems
• Optimal periodic scheduling of sensor networks: a branch and bound approach
• Optimal Periodic Sensor Scheduling in Networks of Dynamical Systems
• Sensor selection strategies for state estimation in energy constrained wireless sensor networks
• Sensor Selection via Convex Optimization
• Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems

Cited in

(13)

• Sensor scheduling for linear systems: A covariance tracking approach
• A separation theorem for joint sensor and actuator scheduling with guaranteed performance bounds
• A risk-based multisensor optimization scheduling method for target threat assessment
• On infinite-horizon sensor scheduling
• On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
• On efficient sensor scheduling for linear dynamical systems
• scientific article; zbMATH DE number 7042556 (Why is no real title available?)
• Sensor selection for Kalman filtering of linear dynamical systems: complexity, limitations and greedy algorithms
• Improved multi-channel scheduling algorithm for parallel Kalman filters
• Sensor selection for remote state estimation with QoS requirement constraints
• Control and communication scheduling co-design for networked control systems: a survey
• Real-time sensor selection for time-varying networks with guaranteed performance
• Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems

This page was built for publication: A complete greedy algorithm for infinite-horizon sensor scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409254)