.png){kind=icon}
返回
On efficient sensor scheduling for linear dynamical systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2012.06.092.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Consider a set of sensors estimating the state of a process in which only one of these sensors can operate at each time-step due to constraints on the overall system. The problem addressed here is to choose which sensor should operate at each time-step to minimize a weighted function of the error covariances of the state estimates. This work investigates the development of tractable algorithms to solve for the optimal and suboptimal sensor schedules. A condition on the non-optimality of an initialization of the schedule is developed. Using this condition, both an optimal and a suboptimal algorithm are devised to prune the search tree of all possible sensor schedules. The suboptimal algorithm trades off the quality of the solution and the complexity of the problem through a tuning parameter. The performance of the suboptimal algorithm is also investigated and an analytical error bound is provided. Numerical simulations are conducted to demonstrate the performance of the proposed algorithms, and the application of the algorithms in active robotic mapping is explored. (c) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Sensor scheduling
Kalman Filter
Sensor selection
Multi-sensor estimation
Networked control systems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
.png){kind=icon}
Feineinstellung der Elektronenstruktur in Halogenobis(o-iminobenzosemichinonato)eisen(III)-Komplexen
PREAI
分享收藏
Evidence-Based BIODANZA Programmes for Children (TANZPRO-Biodanza) in Schools and Kindergartens
PREAI
分享收藏
查看更多内容