Algorithms for scheduling of hidden Markov model sensors

TitleAlgorithms for scheduling of hidden Markov model sensors
Publication TypeConference Paper
Year of Publication2001
AuthorsKrishnamurthy, V., and B. Wahlberg
Conference NameDecision and Control, 2001. Proceedings of the 40th IEEE Conference on
Pagination4818 -4819 vol.5
Keywordscost function, estimation errors, hidden Markov model estimation problem, hidden Markov model sensors, hidden Markov models, Markov chain, measurement costs, noisy sensors, observers, optimal algorithm, scheduling, sensors, signal processing
Abstract

Consider the hidden Markov model estimation problem where the realization of a single Markov chain is observed by a number of noisy sensors. The sensor scheduling problem for the resulting hidden Markov model is as follows: design an optimal algorithm for selecting at each time instant, one of the many sensors to provide the next measurement. Each measurement has an associated measurement cost. The problem is to select an optimal measurement scheduling policy, so as to minimize a cost function of estimation errors and measurement costs

URLhttp://dx.doi.org/10.1109/.2001.980969
DOI10.1109/.2001.980969

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2020 The University of British Columbia