.png){kind=icon}
返回
On Stochastic Sensor Network Scheduling for Multiple Processes
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2017.2717193.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of multiple sensor scheduling for remote state estimation of multiple process over a shared link. In this problem, a set of sensors monitor mutually independent dynamical systems in parallel but only one sensor can access the shared channel at each time to transmit the data packet to the estimator. We propose a stochastic event-based sensor scheduling in which each sensor makes transmission decisions based on both channel accessibility and distributed event-triggering conditions. The corresponding minimum mean squared error estimator is explicitly given. Considering information patterns accessed by sensor schedulers, time-based ones can be treated as a special case of the proposed one. By ultilizing real-time information, the proposed schedule outperforms the time-based ones in terms of the estimation quality. Resorting to solving a Markov decision process (MDP) problem with an average cost criterion, we can find optimal parameters for the proposed schedule. As for practical use, a greedy algorithm is devised for parameter design, which has rather low computational complexity. We also provide a method to quantify the performance gap between the schedule optimized via MDP and any other schedules.
Keyword:
Kalman filters
scheduling
wireless sensor networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
分享收藏分享收藏Design of LMI‐based sliding mode controller with an exponential policy for a class of underactuated systems.png)
Complexity
ComplexityIF0
PREAI
分享收藏分享收藏
查看更多内容