Consensus Problem and Algorithms
| 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
Novel Type of Phase Transition in a System of Self-Driven Particles, Tamás Vicsek, András Czirók, Eshel Ben-Jacob, Inon Cohen, and Ofer Shochet, Physical Review Letters, vol. 75, issue 6, 1226-1229, 1995. A distributed behavioural model of a group of animals.
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.
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.
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.
Additional Resources
Matrix Analysis, R. A. Horn and C.R. Johnson, Cambridage University Press, 1985. A good book for stochastic matrix analysis.
Algebraic Graph Theory G. Royle and C. Godsil, Springer, Graduate Texts in Mathematices, 2001.
