EECI08: Information Flow and Consensus

From Murray Wiki
Revision as of 20:26, 1 March 2009 by Murray (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search
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