Difference between revisions of "EECI08: PacketBased Estimation and Control"
From Murray Wiki
Jump to navigationJump to search
Line 1:  Line 1:  
{{eecisp08 headernext=[[NCS:  {{eecisp08 headernext=[[NCS: Information Flow and ConsensusGraph Theory]]prev=[[NCS: State Estimation and Sensor FusionState Estimation]]}}  
{{righttoc}}  {{righttoc}} 
Revision as of 10:04, 21 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 