Sub-Optimal Sensor Scheduling with Error Bounds
Author
Editor
- Pavel Piztek
Summary, in English
In this paper the problem of sub-optimal sensor schedulingwith a guaranteed distance to optimality is considered. Optimal in thesense that the sequence that minimizes the estimation error covariancematrix for a given time horizon is found. The search is done usingrelaxed dynamic programming. The algorithm is then applied to onesimple second order system and one sixth order model of a fixedmounted model lab helicopter.
Department/s
Publishing year
2005
Language
English
Publication/Series
Proceedings of the 16th IFAC World Congress
Document type
Conference paper
Publisher
Elsevier
Topic
- Control Engineering
Keywords
- Sequences
- Sensor fusion
- Estimation
- Hybrid Modes
- Dynamic Programming
Status
Published
ISBN/ISSN/Other
- ISBN: 0-08-045108-X