Advanced Search
Article Contents
Article Contents

Branch and bound method for sensor scheduling in discrete time

Abstract Related Papers Cited by
  • In this paper we consider the question of sensor scheduling in discrete time. The basic problem is to design a linear filter whose output provides an unbiased minimum variance estimate of a signal process whose noisy measurements from multiple sensors are available for input to the filter. The problem is to select one source (sensor data) dynamically so as to minimize estimation errors. We formulate the problem as an optimal control problem. By analyzing the positive semi-definite property of the error covariance matrix, we develop a branch and bound method to calculate the optimal scheduling strategy and give a numerical result for interpretation.
    Mathematics Subject Classification: Primary: 58F15, 58F17; Secondary: 53C35.


    \begin{equation} \\ \end{equation}
  • 加载中

Article Metrics

HTML views() PDF downloads(109) Cited by(0)

Access History

Other Articles By Authors



    DownLoad:  Full-Size Img  PowerPoint