Abstract
The problem of optimally scheduling various measurement sensors in a multiple-target tracking application is addressed. A short review of state filtering fundamentals using the Kalman filtering formalism is given. It is pointed out that the infinite-horizon optimality scheduling problem is closley related to the definition of some invariants and to the construction of a characteristic fractal set. Iteratively building an approximation of this set results in quasi-optimal finite-length sensor allocation sequences.
Original language | English (US) |
---|---|
Title of host publication | Proceedings of the IEEE Conference on Decision and Control |
Publisher | Publ by IEEEPiscataway |
Pages | 2291-2292 |
Number of pages | 2 |
DOIs | |
State | Published - Jan 1 1990 |
Externally published | Yes |