.png){kind=icon}
.png){kind=icon}
返回
Sensor scheduling in continuous time
.png){kind=icon}
PRE
AI
DOI：10.1016/S0005-1098(01)00159-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Let N be the number of available sensor sources. Noisy observations of an underlying state process are available for these N sources. We consider the continuous time sensor scheduling problem in which N, of these N sources are to be chosen to collect data at each time point. This sensor scheduling problem (with switching costs and switching constraints) is formulated as a constrained optimal control problem. In this framework, the controls represent the sensors that are chosen at a particular time. Thus, the control variables are constrained to take values in a discrete set, and switchings between sensors can occur in continuous time. By incorporating recent results on discrete valued optimal control, we show that this problem can be transformed into an equivalent continuous optimal control problem. In this way, we obtain the sensor scheduling policy as well as the associated switching times. (C) 2001 Elsevier Science Ltd. All rights reserved.
Keyword:
optimal control
parametrization
scheduling algorithms
sensors
stochastic systems
switching times
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。