Difference between revisions of "Consensus Problem and Algorithms"

From MurrayWiki
Jump to: navigation, search
(Reading)
(Lecture Materials)
 
(5 intermediate revisions by the same user not shown)
Line 7: Line 7:
 
<!-- 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:270-2-8-1-lecturenotes2.pdf|Lecture: Consensus Problem and Algorithms]]
  
 
== Reading ==
 
== Reading ==
Line 15: Line 17:
  
 
*<p>[http://www.seas.upenn.edu/~jadbabai/papers/JadLiMorseTAC_June03.pdf 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.</p>
 
*<p>[http://www.seas.upenn.edu/~jadbabai/papers/JadLiMorseTAC_June03.pdf 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.</p>
 +
 +
*<p>[http://www.cds.caltech.edu/~murray/papers/2003f_om04-tac.html 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. </p>
 +
 +
*<p>[http://http://ieeexplore.ieee.org/search/srchabstract.jsp?arnumber=1431045&isnumber=30864&punumber=9&k2dockey=1431045@ieeejrns&query=%28+beard%3Cin%3Eau+%29&pos=0 Consensus seeking in multi-agent systems under dynamically changing interaction topologies], W. Ren and R. W. Beard, IEEE Transactions on Automatic Control, vol. 50, issue 5, 655-661, May 2005.</p>
  
 
== Additional Resources ==
 
== Additional Resources ==
 
<!-- Links to additional information. If there are good sources of additional information for students interested in exploring this topic further, these should go at the bottom of the page. -->
 
<!-- Links to additional information. If there are good sources of additional information for students interested in exploring this topic further, these should go at the bottom of the page. -->
 +
 +
*<p>[http://www.amazon.com/gp/product/0521386322/002-0302673-7388830?v=glance&n=283155 Matrix Analysis], R. A. Horn and C.R. Johnson, Cambridage University Press, 1985. A good book for stochastic matrix analysis.</p>
 +
 +
*<p>[http://www.amazon.com/exec/obidos/ASIN/0387952209/drgordonroyle/002-0302673-7388830 Algebraic Graph Theory] G. Royle and C. Godsil, Springer, Graduate Texts in Mathematices, 2001. </p>

Latest revision as of 23:34, 14 May 2006

Prev: Estimation and Control in Networked Systems Course Home Next: Cooperative and Coordinated Control Scheme for Multi-Agent Systems

This is the template for CDS 270 lectures. If you edit this page, you will see comments describing what goes in each section. Do not edit this template. See CDS 270: Information for Lecturers for more information on how to create a wiki page corresponding to a lecture.

Lecture Materials

Reading

Additional Resources

  • Matrix Analysis, R. A. Horn and C.R. Johnson, Cambridage University Press, 1985. A good book for stochastic matrix analysis.