Introduction to Distributed Control: Difference between revisions
From Murray Wiki
Jump to navigationJump to search
No edit summary |
|||
| Line 8: | Line 8: | ||
<!-- Include links to materials that you used in your lecture. At a minimum, this should include a link to your lecture presentation. You might also include links to MATLAB scripts or other source code that students would find useful --> | <!-- Include links to materials that you used in your lecture. At a minimum, this should include a link to your lecture presentation. You might also include links to MATLAB scripts or other source code that students would find useful --> | ||
<!-- Sample lecture link: * [[Media:L1-1_Intro.pdf|Lecture: Networked Control Systems: Course Overview]] --> | <!-- Sample lecture link: * [[Media:L1-1_Intro.pdf|Lecture: Networked Control Systems: Course Overview]] --> | ||
* [[Media: | * [[Media:lecture2d_gupta.pdf |Lecture: Introduction to Distributed Control]] | ||
== Reading == | == Reading == | ||
Revision as of 22:47, 8 May 2006
| Prev: Distributed Estimation | Course Home | Next: Estimation and Control in Networked Systems |
In this lecture, we take a look at the problem of distributed control. We will begin by seeing why the problem is hard. Then we will look at one obvious approach towards solving the problem. Other approaches to the problem will also be mentioned.
Lecture Materials
Reading
Please refresh the material covered by Henrik a couple of weeks ago[1].
Consensus algorithms will be covered in detail in the class next week. We will also touch upon one such algorithm in passing. For more details, you can read this paper.[2].
