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

From MurrayWiki
Jump to: navigation, search
(Wednesday)
Line 29: Line 29:
 
<li>Particle filters</li>
 
<li>Particle filters</li>
 
</ol>
 
</ol>
 +
|}
 
<p>
 
<p>
 +
* {{cds110b-wi08 pdfs placeholder|L8-1_fusion.pdf|Lecture notes on sensor fusion}}
 +
* {{cds110b-wi08 pdfs placeholder|L8-2_fusion.pdf|Lecture slides on information filters}}
 
* {{cds110b-wi08 pdfs placeholder|hw7.pdf|HW #7}} (due 5 Mar 08)
 
* {{cds110b-wi08 pdfs placeholder|hw7.pdf|HW #7}} (due 5 Mar 08)
 
</p>
 
</p>
|}
 
  
 
== References and Further Reading ==
 
== References and Further Reading ==

Revision as of 15:45, 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
    • Sensor fusion example revisited
  2. Application: Autonomous driving
    • Low-level sensor fusion in Alice (Gillula)
    • Sensor fusion for urban driving
  3. Particle filters

  • Lecture notes on sensor fusion
  • Lecture slides on information filters
  • HW #7 (due 5 Mar 08)

References and Further Reading

Frequently Asked Questions