.png){kind=icon}
返回
Fast and Optimal Sensor Scheduling for Networked Sensor Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/CDC.2008.4739445.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses a sensor scheduling problem for a class of networked sensor systems whose sensors are spatially distributed and measurements are influenced by state dependent noise. Sensor scheduling is required to achieve power saving since each sensor operates with a battery power source. The scheduling problem is formulated as a model predictive control problem with single sensor measurement per time. It is assumed that all sensors have state dependent noise and have the same characteristics, which follows from the properties of networked sensor systems. We propose a fast and optimal sensor scheduling algorithm for a class of networked sensor systems. Computation time of the proposed algorithm is proportional to the number of sensors and does not depend on the prediction horizon. In addition, we provide a fast sensor scheduling algorithm for a general class of systems by using a linear approximation of the sensor model.
Keyword:
TIME
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
0
论文数:
40
被引数:
0
机构
引用论文
Long-term survival and T-cell kinetics in relapsed/refractory ALL patients who achieved MRD response after blinatumomab treatment.png)
Blood
OAAI
BloodIF0
OAAI分享收藏分享收藏
查看更多内容