EECI08: Information Flow and Consensus: Difference between revisions
m (EECI: Information Flow and Consensus moved to EECI08: Information Flow and Consensus) |
No edit summary |
||
| Line 1: | Line 1: | ||
{{eeci-sp08 header|next=[[ | {{eeci-sp08 header|next=[[EECI08: Distributed Estimation and Control|Distributed Control]]|prev=[[EECI08: Packet-Based Estimation and Control|Packet-Based Control]]}} | ||
{{righttoc}} | {{righttoc}} | ||
Latest revision as of 20:26, 1 March 2009
| Prev: Packet-Based Control | Course home | Next: Distributed Control |
This lecture gives an introduction to some concepts and tools in graph theory. After giving the basic definitions of graphs and properties of graphs, we introduce the Laplacian of a matrix and discuss its properties and uses. Special emphasis is placed on the eigenvalues of the Laplacian, including the bounding of those eigenvalues using the Gershgorin disk theorem. The consensus problem is introduced as an example of the use of the basic concepts.
Lecture Materials
- Lecture slides: An Introduction to Graph Theory
- Some students had troubles print these due to font issues. Here is a scan of the notes in case you can't get them to print.
Reading
Algebraic Graph Theory G. Royle and C. Godsil, Springer, Graduate Texts in Mathematices, 2001.
Consensus problems in networks of agents with switching topology and time-delays, R. Olfati-Saber and R. M. Murray, IEEE Transactions on Automatic Control, vol. 49, 1520-1533, Sept. 2004. A good reference for continuous time consensus algorithms.
Coordination of groups of mobile autonomous agents using nearest neighbor rules, A. Jadbabaie, J. Lin, and A. S. Morse, IEEE Transactions on Automatic Control, Vol. 48, No. 6, June 2003, pp. 988-1001. A good reference for discrete time consensus algorithms and theoretical explanation for consensus of multi-agent systems using nearest neighbor rules.
