𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The problem of optimal robust sensor scheduling

✍ Scribed by Andrey V. Savkin; Robin J. Evans; Efstratios Skafidas

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
132 KB
Volume
43
Category
Article
ISSN
0167-6911

No coin nor oath required. For personal study only.

✦ Synopsis

This paper considers the sensor scheduling problem which consists of estimating the state of an uncertain process based on measurements obtained by switching a given set of noisy sensors. The noise and uncertainty models considered in this paper are assumed to be unknown deterministic functions which satisfy an energy type constraint known as an integral quadratic constraint. The problem of optimal robust sensor scheduling is formulated and solution to this problem is given in terms of the existence of suitable solutions to a Riccati di erential equation of the game type and a dynamic programming equation. Furthermore, a real time implementable method for sensor scheduling is also presented.

πŸ“œ SIMILAR VOLUMES

Hybrid method for a general optimal sens
Hybrid method for a general optimal sensor scheduling problem in discrete time
✍ Z.G. Feng; K.L. Teo; V. Rehbock πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 566 KB

In this paper, we consider a general class of optimal sensor scheduling problems in discrete time. There are N 1 sensors available for acquiring data so as to estimate the needed but unknown signal. Only N 2 out of the N 1 sensors can be turned on at any moment, while different weights can be assign