Introduction to Distributed Control - Revision history

Gupta: /* Reading */

2006-05-10T20:06:33Z

Reading

← Older revision		Revision as of 20:06, 10 May 2006
Line 18:		Line 18:

	* <p>The synthesis algorithm we will cover in class is described in this paper.		* <p>The synthesis algorithm we will cover in class is described in this paper.
	"On the Synthesis of Control Laws for a Network of Autonomous Agents", V. Gupta, B. Hassibi and R. M. Murray, Proceedings of the American Control Conference 2004, vol. 6, pp. 4927-4932, 2004~~. [http://www.cds.caltech.edu/~murray/papers/2003r_ghm04-acc.html]~~.</p>		[http://www.cds.caltech.edu/~murray/papers/2003r_ghm04-acc.html "On the Synthesis of Control Laws for a Network of Autonomous Agents"], V. Gupta, B. Hassibi and R. M. Murray, Proceedings of the American Control Conference 2004, vol. 6, pp. 4927-4932, 2004.</p>

	* <p>Additional synthesis methods can be found in the references. I particularly recommend references 14, 21 and 22.		* <p>Additional synthesis methods can be found in the references. I particularly recommend references 14, 21 and 22.

Gupta: /* Reading */

2006-05-10T00:24:34Z

Reading

← Older revision		Revision as of 00:24, 10 May 2006
Line 23:		Line 23:
	**"Distributed Control Design for Systems Interconnected over an Arbitrary Graph", C. Langbort, R. S. Chandra and R. D'Andrea, IEEE Transactions on Automatic Control, vol. 49, no. 9, pp. 1502-1519, Sep. 2004.		**"Distributed Control Design for Systems Interconnected over an Arbitrary Graph", C. Langbort, R. S. Chandra and R. D'Andrea, IEEE Transactions on Automatic Control, vol. 49, no. 9, pp. 1502-1519, Sep. 2004.
	**"Optimal Control of Systems with Delayed Observation Sharing Patterns Via Input-Output Methods", P. G. Voulgaris, Systems and Controls Letters, Vol. 50, pp. 51-64, 2003.		**"Optimal Control of Systems with Delayed Observation Sharing Patterns Via Input-Output Methods", P. G. Voulgaris, Systems and Controls Letters, Vol. 50, pp. 51-64, 2003.
	**"A Characterization of Convex Problems in Decentralized Control", M. Rotkowitz and S. Lall, vol. 51, no. 2, pp.274-286, Feb. 2006.		**"A Characterization of Convex Problems in Decentralized Control", M. Rotkowitz and S. Lall, IEEE Transactions on Automatic Control, vol. 51, no. 2, pp.274-286, Feb. 2006.
	</p>		</p>

Gupta: /* Reading */

2006-05-09T19:09:41Z

Reading

← Older revision		Revision as of 19:09, 9 May 2006
Line 23:		Line 23:
	**"Distributed Control Design for Systems Interconnected over an Arbitrary Graph", C. Langbort, R. S. Chandra and R. D'Andrea, IEEE Transactions on Automatic Control, vol. 49, no. 9, pp. 1502-1519, Sep. 2004.		**"Distributed Control Design for Systems Interconnected over an Arbitrary Graph", C. Langbort, R. S. Chandra and R. D'Andrea, IEEE Transactions on Automatic Control, vol. 49, no. 9, pp. 1502-1519, Sep. 2004.
	**"Optimal Control of Systems with Delayed Observation Sharing Patterns Via Input-Output Methods", P. G. Voulgaris, Systems and Controls Letters, Vol. 50, pp. 51-64, 2003.		**"Optimal Control of Systems with Delayed Observation Sharing Patterns Via Input-Output Methods", P. G. Voulgaris, Systems and Controls Letters, Vol. 50, pp. 51-64, 2003.
	**"A Characterization of Convex Problems in Decentralized Control", M. Rotkowitz and S> Lall, vol. 51, no. 2, pp.274-286, Feb. 2006.		**"A Characterization of Convex Problems in Decentralized Control", M. Rotkowitz and S. Lall, vol. 51, no. 2, pp.274-286, Feb. 2006.
	</p>		</p>

Gupta: /* Reading */

2006-05-09T19:07:44Z

Reading

← Older revision		Revision as of 19:07, 9 May 2006
Line 11:		Line 11:

	== Reading ==		== Reading ==
	* <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>~~		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>~~The synthesis algorithm we will cover~~ in ~~class is described in this paper~~.~~[http://www~~.~~cds~~.~~caltech~~.~~edu/~murray/papers/2003r_ghm04~~-~~acc~~.~~html]~~.</p>		* <p>Reference 2 in the lecture notes covers the concept of information patterns.
			"Separation of Estimation and Control for Discrete Time Systems", H. S. Witsenhausen, Proceedings of the IEEE, vol. 59, no. 11, pp. 1557-1566, Nov. 1971.
			</p>

	* <p>Additional synthesis methods can be found in the references. I particularly recommend references 14, 21 and 22. </p>		* <p>The synthesis algorithm we will cover in class is described in this paper.
			"On the Synthesis of Control Laws for a Network of Autonomous Agents", V. Gupta, B. Hassibi and R. M. Murray, Proceedings of the American Control Conference 2004, vol. 6, pp. 4927-4932, 2004. [http://www.cds.caltech.edu/~murray/papers/2003r_ghm04-acc.html].</p>

			* <p>Additional synthesis methods can be found in the references. I particularly recommend references 14, 21 and 22.
			**"Distributed Control Design for Systems Interconnected over an Arbitrary Graph", C. Langbort, R. S. Chandra and R. D'Andrea, IEEE Transactions on Automatic Control, vol. 49, no. 9, pp. 1502-1519, Sep. 2004.
			**"Optimal Control of Systems with Delayed Observation Sharing Patterns Via Input-Output Methods", P. G. Voulgaris, Systems and Controls Letters, Vol. 50, pp. 51-64, 2003.
			**"A Characterization of Convex Problems in Decentralized Control", M. Rotkowitz and S> Lall, vol. 51, no. 2, pp.274-286, Feb. 2006.
			</p>

Gupta: /* Reading */

2006-05-09T00:57:06Z

Reading

← Older revision		Revision as of 00:57, 9 May 2006
Line 15:		Line 15:
	* <p>The synthesis algorithm we will cover in class is described in this paper.[http://www.cds.caltech.edu/~murray/papers/2003r_ghm04-acc.html].</p>		* <p>The synthesis algorithm we will cover in class is described in this paper.[http://www.cds.caltech.edu/~murray/papers/2003r_ghm04-acc.html].</p>

	* <p>Additional synthesis methods ~~are described~~ in the ~~reference section~~. I particularly recommend references 14, 21 and 22. </p>		* <p>Additional synthesis methods can be found in the references. I particularly recommend references 14, 21 and 22. </p>

Gupta: /* Reading */

2006-05-09T00:56:36Z

Reading

← Older revision		Revision as of 00:56, 9 May 2006
Line 13:		Line 13:
	* <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>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>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>The synthesis algorithm we will cover in class is described in this paper.[http://www.cds.caltech.edu/~murray/papers/2003r_ghm04-acc.html].</p>

	* <p>Additional synthesis methods are described in the reference section. I particularly recommend references 14, 21 and 22. </p>		* <p>Additional synthesis methods are described in the reference section. I particularly recommend references 14, 21 and 22. </p>

Gupta: /* Reading */

2006-05-08T22:57:03Z

Reading

← Older revision		Revision as of 22:57, 8 May 2006
Line 11:		Line 11:

	== Reading ==		== Reading ==
	* <p>~~Please refresh~~ the ~~material covered by Henrik a couple~~ of ~~weeks ago~~[http://www.cds.caltech.edu/~~%7Emurray/wiki/images/b/b3/Stateestim.pdf~~].</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>~~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.[http://www.cds.caltech.edu/~murray/papers/~~2003f_om04~~-~~tac~~.html].</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 ~~references~~ are ~~mentioned~~ in the ~~lecture notes~~. I particularly recommend references 11, 12 and ~~25. 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>Additional synthesis methods are described in the reference section. I particularly recommend references 14, 21 and 22. </p>

Gupta: /* Lecture Materials */

2006-05-08T22:47:16Z

Lecture Materials

← Older revision		Revision as of 22:47, 8 May 2006
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:~~lectur1d_gupta~~.pdf \|Lecture: Distributed ~~Estimation~~]]		* [[Media:lecture2d_gupta.pdf \|Lecture: Introduction to Distributed Control]]

	== Reading ==		== Reading ==

Gupta at 22:45, 8 May 2006

2006-05-08T22:45:17Z

New page

{{cds270-2 header}} 



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 ==


* [[Media:lectur1d_gupta.pdf |Lecture: Distributed Estimation]]

== Reading ==
* Please refresh the material covered by Henrik a couple of weeks ago[http://www.cds.caltech.edu/%7Emurray/wiki/images/b/b3/Stateestim.pdf].

* 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.[http://www.cds.caltech.edu/~murray/papers/2003f_om04-tac.html].

* Additional references are mentioned in the lecture notes. I particularly recommend references 11, 12 and 25. 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.