Introduction to Distributed Control: Difference between revisions
From Murray Wiki
Jump to navigationJump to search
| Line 11: | Line 11: | ||
== Reading == | == Reading == | ||
* <p> | * <p>Reference 2 in the lecture notes covers the concept of information patterns. Most of the cited papers are available using IEEE Xplore[http://ieeexplore.ieee.org/Xplore/dynhome.jsp]. If you are unable to obtain any, please send me [http://www.cds.caltech.edu/~vijay] a mail.</p> | ||
* <p> | * <p>The synthesis algorithm we will cover in class is described in the paper.[http://www.cds.caltech.edu/~murray/papers/2003r_ghm04-acc.html].</p> | ||
* <p>Additional | * <p>Additional synthesis methods are described in the reference section. I particularly recommend references 14, 21 and 22. </p> | ||
Revision as of 22:57, 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
Reference 2 in the lecture notes covers the concept of information patterns. Most of the cited papers are available using IEEE Xplore[1]. If you are unable to obtain any, please send me [2] a mail.
The synthesis algorithm we will cover in class is described in the paper.[3].
Additional synthesis methods are described in the reference section. I particularly recommend references 14, 21 and 22.
