Difference between revisions of "EECI08: PacketBased Estimation and Control"
From Murray Wiki
Jump to navigationJump to search
m (NCS: PacketBased Estimation and Control moved to EECI: PacketBased Estimation and Control) 

Line 24:  Line 24:  
==== Lecture Materials ====  ==== Lecture Materials ====  
* Lecture slides: {{eecisp08 pdf  * Lecture slides: {{eecisp08 pdfL7_pbc.pdfPacketBased Estimation and Control}}  
* Lecture notes: {{ncsbookfusionChapter 5  PacketBased Estimation and Control}}  * Lecture notes: {{ncsbookfusionChapter 5  PacketBased Estimation and Control}}  
Revision as of 15:55, 28 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 (TCPlike) or not acknowledged (UDPlike).
Outline

Lecture Materials
Additional Information 