.png){kind=icon}
Return
A complete greedy algorithm for infinite-horizon sensor scheduling
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2017.04.018.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we study the problem of scheduling sensors to estimate the state of a linear dynamical system. The estimator is a Kalman filter and our objective is to optimize the a posteriori error covariance over an infinite time horizon. We focus on the case where a fixed number of sensors are selected at each time step, and we characterize the exact conditions for the existence of a schedule with uniformly bounded estimation error covariance, Using this result, we construct a scheduling algorithm that guarantees that the error covariance will be bounded if the existence conditions are satisfied. We call such an algorithm complete. Finally, we provide simulations to compare the performance of the algorithm against other known techniques. (C) 2017 Elsevier Ltd. All rights reserved.
Keywords:
Sensor networks
Kalman filters
Sensor scheduling
Multi-sensor estimation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
Organization
Cited Papers
ShareSaveSubmodularity and greedy algorithms in sensor scheduling for linear dynamical systems.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
ShareSaveShareSave
View more