Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems
type: Item
instance of: scholarly article
title: Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems
zbMATH Open document ID: 1327.93369
author: Syed Talha Jawaid
author: Stephen Smith
published in: Automatica
publication date: 2015-12-22T00:00:00Z
Mathematics Subject Classification ID: 93E10
Mathematics Subject Classification ID: 93C55
Mathematics Subject Classification ID: 93C05
Mathematics Subject Classification ID: 93E11
Mathematics Subject Classification ID: 93E25
zbMATH DE Number: 6523653
zbMATH Keywords: Kalman filters
zbMATH Keywords: sensor networks
zbMATH Keywords: multi-sensor estimation
zbMATH Keywords: sensor scheduling
zbMATH Keywords: greedy algorithms
MaRDI profile type: Publication
full work available at URL: j.automatica.2015.08.022
OpenAlex ID: W1803898544
cites work: On the determination of optimal costly measurement strategies for linear stochastic systems
cites work: Sensor selection via compressed sensing
cites work: Q4196269
cites work: Q3112637
cites work: On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
cites work: Q5191187
cites work: Sensor Selection via Convex Optimization
cites work: Sensor selection strategies for state estimation in energy constrained wireless sensor networks
cites work: An analysis of approximations for maximizing submodular set functions—I
cites work: Periodicity of Kalman-based scheduled filters
cites work: Is submodularity testable?
cites work: Kalman Filtering With Intermittent Observations
cites work: On efficient sensor scheduling for linear dynamical systems
cites work: Stochastic sensor activation for distributed state estimation over a sensor network
DOI: 10.1016/J.AUTOMATICA.2015.08.022
Recommended article: On efficient sensor scheduling for linear dynamical systems
Recommended article: Optimal sensor scheduling for multiple linear dynamical systems
Recommended article: A complete greedy algorithm for infinite-horizon sensor scheduling
Recommended article: On the Optimal Solutions of the Infinite-Horizon Linear Sensor Scheduling Problem
Recommended article: Randomized Greedy Sensor Selection: Leveraging Weak Submodularity
Recommended article: Approximate optimal periodic scheduling of multiple sensors with constraints
Recommended article: Optimal Periodic Sensor Scheduling in Networks of Dynamical Systems
Recommended article: Q3535023
Recommended article: Hybrid method for a general optimal sensor scheduling problem in discrete time
Recommended article: A greedy Galerkin method to efficiently select sensors for linear dynamical systems
description: scientific article; zbMATH DE number 6523653