Abstract
Consensus problems arise in many instances of collaborative control of multi-agent complex systems; where it is important for the agents to act in coordination with the other agents. To reach coordination, agents need to share information. In large groups of agents the information sharing should be local in some sense, due to energy limitations, reliability, and other constraints. A consensus protocol is an iterative method that provides the group with a common coordination variable. However, local information exchange limits the speed of convergence of such protocols. Therefore, in order to achieve high convergence speed, we should be able to design appropriate network topologies. A reasonable conjecture is that the small world graphs should result in good convergence speed for consensus problems because their low average pairwise path length should speed the diffusion of information in the system. In this paper we address this conjecture by simulations and also by studying the spectral properties of a class of matrices corresponding to consensus problems on small world graphs.
1
The material is based upon work supported by National Aeronautics and Space Administration under award No NCC8235.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Bibliography
V. Blondel, J. Hendrickx, A. Olshevsky, and J. Tsitsiklis. Convergence in multiagent coordination, consensus and flocking. Proceedings 44th IEEE Conference on Decision and Control, pp. 2996–3000, 2005.
P. J. Davis. Circulant Matrices. Wiley, 1979.
L. Fang and P. Antsaklis. On communication requirements for multi-agents consensus seeking. Proceedings of Workshop NESC05, Lecture Notes in Control and Information Sciences (LNCIS), Springer, 331:53–68, 2006.
A. Jadbabaie, J. Lin, and A. S. Morse. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control, 48(6):988–1001, 2003.
T. Jiang and J. S. Baras Autonomous trust establishment. Proceedings 2nd International Network Optimization Conference, Lisbon, Portugal, 2005.
M. E. J. Newman, C. Moore, and D. J. Watts, Mean-field solution of the small-world network model. Physical Review Letters 84: 3201–3204, 2000.
R. Olfati Saber. Ultrafast consensus in small-world networks. Proceedings American Control Conference, 4:2371–2378, 2005.
R. Olfati Saber and R.M Murray. Consensus problems in networks of agents with switcing topology and time-delays. IEEE Transactions on Automatic Control, 49(9):1520–1533, 2004.
W. Ren, R. W. Beard, and T. W. McLain. Coordination variables and consensus building in multiple vehicle systems. Lecture Notes in Control and Information Sciences series, 309:171–188, 2004, Springer Verlag.
E. Seneta. Nonnegative Matrices and Markov Chains. Springer, 1981.
T. Vicsek, A. Czirok, E. Ben Jakob, I. Cohen, and O. Schochet. Novel type of phase transitions in a system of self-driven particles. Physical Review Letters, 75:1226–1299, 1995.
D.J. Watts and S.H. Strogatz. Collective dynamics of small-world networks. Nature, 393:440–442, 1998.
D.J. Watts. Small Worlds: The Dynamics of Networks Between Order and Randomness. Princeton University Press, 1999.
L. Xiao, S. Boyd, and S. Lall. A scheme for robust distributed sensor fusion based on average consensus. Proceedings International Conference on Information Processing in Sensor Networks, pp. 63–70, 2005.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer
About this paper
Cite this paper
Hovareshti, P., Baras, J.S. (2010). Consensus Problems on Small World Graphs: A Structural Study. In: Minai, A., Braha, D., Bar-Yam, Y. (eds) Unifying Themes in Complex Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85081-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-85081-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85080-9
Online ISBN: 978-3-540-85081-6
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)