Sub-Optimal Sensor Scheduling with Error Bounds

Peter Alriksson, Anders Rantzer

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingResearchpeer-review

24 Citations (SciVal)


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.
Original languageEnglish
Title of host publicationProceedings of the 16th IFAC World Congress
EditorsPavel Piztek
ISBN (Print)0-08-045108-X
Publication statusPublished - 2005

Subject classification (UKÄ)

  • Control Engineering


  • Sequences
  • Sensor fusion
  • Estimation
  • Hybrid Modes
  • Dynamic Programming


Dive into the research topics of 'Sub-Optimal Sensor Scheduling with Error Bounds'. Together they form a unique fingerprint.

Cite this