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

From MurrayWiki
Jump to: navigation, search
(References and Further Reading)
Line 1: Line 1:
 
{{cds110b-wi08}}
 
{{cds110b-wi08}}
 
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.
 +
 +
{| border=1 width=100%
 +
|- valign=top
 +
|
 +
===== Monday =====
 +
<ol type="A">
 +
<li>test</li>
 +
</ol>
 +
|
 +
===== Wednesday =====
 +
|}
  
 
* {{cds110b-wi08 pdfs placeholder|hw7.pdf|HW #7}} (due 5 Mar 08)
 
* {{cds110b-wi08 pdfs placeholder|hw7.pdf|HW #7}} (due 5 Mar 08)

Revision as of 15:28, 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. test
Wednesday
  • HW #7 (due 5 Mar 08)

References and Further Reading

Frequently Asked Questions