CDS 110b: Sensor Fusion: Difference between revisions

From Murray Wiki
Jump to navigationJump to search
mNo edit summary
No edit summary
 
(9 intermediate revisions by the same user not shown)
Line 1: Line 1:
{{cds110b-wi08}} __NOTOC__
{{cds110b-wi08 lecture|prev=Kalman Filters|next=Robust Performance}}
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.
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.


Line 20: Line 20:
===== Wednesday =====
===== Wednesday =====
<ol type="A">
<ol type="A">
<li>Application: Autonomous driving</li>
* Low-level sensor fusion in Alice (Gillula)
* Sensor fusion for urban driving (DGC07)
<li>Information filters</li>
<li>Information filters</li>
* Problem setup
* Problem setup
* Kalman filter derivation
* Kalman filter derivation
<li>Examples</li>
* Sensor fusion example revisited
* Sensor fusion example revisited
* Sensor fusion in Alice (Gillula + DGC07)
<li>Modern extensions of Kalman filtering</li>
* Moving horizon estimation
* Particle filters
</ol>
</ol>
<br>
* {{cds110b-wi08 pdfs placeholder|hw7.pdf|HW #7}} (due 5 Mar 08)
|}
|}
<p>
* {{cds110b-wi08 pdfs|L8-1_fusion.pdf|Lecture notes on sensor fusion}}
* {{cds110b-wi08 pdfs|L8-2_kfexts.pdf|Lecture slides on applications and extensions of Kalman filters}}
* {{cds110b-wi08 pdfs|hw7.pdf|HW #7}} (due 5 Mar 08)
</p>


== References and Further Reading ==
== References and Further Reading ==

Latest revision as of 03:23, 2 March 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. Application: Autonomous driving
    • Low-level sensor fusion in Alice (Gillula)
    • Sensor fusion for urban driving (DGC07)
  2. Information filters
    • Problem setup
    • Kalman filter derivation
    • Sensor fusion example revisited
  3. Modern extensions of Kalman filtering
    • Moving horizon estimation
    • Particle filters

References and Further Reading

Frequently Asked Questions