.png){kind=icon}
Return
Optimal sensor scheduling for multiple linear dynamical systems
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2016.09.015.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the design of an optimal collision-free sensor schedule fora number of sensors which monitor different linear dynamical systems correspondingly. At each time, only one of all the sensors can send its local estimate to the remote estimator. A preliminary work for the two-sensor scheduling case has been studied in the literature. The generalization into multiple-sensor scheduling case is shown to be nontrivial. We first find a necessary condition of the optimal solution which can significantly reduce the feasible optimal solution space without loss of performance. By modelling a finite-state Markov decision process (MDP) problem, we can numerically search an asymptotic periodic schedule which is proven to be optimal. Some simple but effective suboptimal schedules for any systems are proposed. We also find a lower bound of the optimal cost, which enables us to quantify the performance gap between any suboptimal schedule and an optimal one. (C) 2016 Published by Elsevier Ltd.
Keywords:
Kalman filter
Medium access control
State estimation
Sensor scheduling
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
View more organizations
Cited Papers
ShareSaveSubmodularity and greedy algorithms in sensor scheduling for linear dynamical systems.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
ShareSaveShareSaveShareSave
ShareSaveShareSave View more