Sub-Optimal Sensor Scheduling with Error Bounds
Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
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.
|Research areas and keywords||
Subject classification (UKÄ) – MANDATORY
|Title of host publication||Proceedings of the 16th IFAC World Congress|
|Publication status||Published - 2005|