Difference between revisions of "CDS 110b: Sensor Fusion"

From MurrayWiki
Jump to: navigation, search
m
Line 4: Line 4:
 
{| border=1 width=100%
 
{| border=1 width=100%
 
|- valign=top
 
|- valign=top
| width=50%
+
| width=50% |
 
===== Monday =====
 
===== Monday =====
 
<ol type="A">
 
<ol type="A">

Revision as of 15:39, 24 February 2008

CDS 110b Schedule Project Course Text

In this set of lectures we discuss discrete-time random processes and the discrete-time Kalman filter. We use the discrete-time formulation to consider problems in (multi-rate) sensor fusion and sensor fusion in the presence of information/packet loss. We also introduce the information filter, which provides a particularly simple method for sensor fusion.

Monday
  1. Discrete-time Kalman filter
    • Discrete-time stochastic systems
    • Main theorem (following AM08)
    • Predictor-corrector form
  2. Sensor fusion
    • Problem setup → inverse covariance weighting
    • Example: TBD
  3. Variations
    • Multi-rate filtering and filtering with data loss
Wednesday
  1. Information filters
    • Problem setup
    • Kalman filter derivation
  2. Examples
    • Sensor fusion example revisited
    • Sensor fusion in Alice (Gillula + DGC07)


  • HW #7 (due 5 Mar 08)

References and Further Reading

Frequently Asked Questions