.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Kalman filter
Medium access control
State estimation
Sensor scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems线性动态系统的传感器调度中的亚模块化和贪婪算法.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏分享收藏
查看更多内容