# EECI08: Information Flow and Consensus

From Murray Wiki

Jump to navigationJump to searchPrev: Packet-Based Control | Course home | Next: Distributed Control |

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

- Lecture slides: An Introduction to Graph Theory

#### Additional Information

|}