Difference between revisions of "EECI08: Packet-Based Estimation and Control"

From Murray Wiki
Jump to navigationJump to search
m (EECI: Packet-Based Estimation and Control moved to EECI08: Packet-Based Estimation and Control)
 
(One intermediate revision by the same user not shown)
Line 5: Line 5:


==  Lecture Materials ==
==  Lecture Materials ==
* Lecture notes: {{eeci-sp08 pdf|L7_pbc-notes.pdf|Packet-Based Estimation and Control}} (scan of handwritten notes)
* Lecture notes: {{eeci-sp08 pdf|L7_pbc-scan.pdf|Packet-Based Estimation and Control}} (scan of handwritten notes)
* Lecture slides: {{eeci-sp08 pdf|L7_pbc.pdf|Packet-Based Estimation and Control}} (contains a few examples + graphs)
* Lecture slides: {{eeci-sp08 pdf|L7_pbc.pdf|Packet-Based Estimation and Control}} (contains a few examples + graphs)



Latest revision as of 20:16, 1 March 2009

Prev: State Estimation Course home Next: Graph Theory

This lecture describes how to extend results in estimation and control to the case where the information between sensing, actuation and computation flows across a network with possible packet loss and time delay. We begin with the estimation problem, summarizing the results on Sinopoli et al on Kalman filtering with intermittent data, which uses average convergence as a stability metric. An alternative formulation is to use almost sure convergence, which gives improved results for lossy networks. Finally, we extend the results on estimation to the control setting, summarizing approaches in the cases where receipt of packets are acknowledge (TCP-like) or not acknowledged (UDP-like).

Lecture Materials

Reading