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

From Murray Wiki
Jump to navigationJump to search
Line 5: Line 5:

==  Lecture Materials ==
==  Lecture Materials ==
* Lecture slides: {{eeci-sp08 pdf|L7_pbc.pdf|Packet-Based Estimation and Control}}
* Lecture notes: {{eeci-sp08 pdf|L7_pbc-notes.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)

== Reading ==
== Reading ==

Revision as of 23:49, 30 March 2008

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