Skip to main content

Consensus of Complex Multi-agent Systems

  • 578 Accesses

Abstract

This entry provides a broad overview of the basic elements of consensus dynamics. It describes the classical Perron-Frobenius theorem that provides the main theoretical tool to study the convergence properties of such systems. Classes of consensus models that are treated include simple random walks on grid-like graphs and in graphs with a bottleneck, consensus on graphs with intermittently randomly appearing edges between nodes (gossip models), and models with nodes that do not modify their state over time (stubborn agent models). Application to cooperative control, sensor networks, and socioeconomic models are mentioned.

This is a preview of subscription content, log in via an institution.

Bibliography

  • Acemoglu D, Como G, Fagnani F, Ozdaglar A (2013) Opinion fluctuations and disagreement in social networks. Math Oper Res 38(1):1–27

    Article  MathSciNet  Google Scholar 

  • Boyd S, Ghosh A, Prabhakar B, Shah D (2006) Randomized gossip algorithms. IEEE Trans Inf Theory 52(6):2508–2530

    Article  MATH  MathSciNet  Google Scholar 

  • Carli R, Fagnani F, Speranzon A, Zampieri S (2008) Communication constraints in the average consensus problem. Automatica 44(3):671–684

    Article  MATH  MathSciNet  Google Scholar 

  • Castellano C, Fortunato S, Loreto V (2009) Statistical physics of social dynamics. Rev Modern Phys 81:591–646

    Article  Google Scholar 

  • Fax JA, Murray RM (2004) Information flow and cooperative control of vehicle formations. IEEE Trans Autom Control 49(9):1465–1476

    Article  MathSciNet  Google Scholar 

  • Galton F (1907) Vox populi. Nature 75:450–451

    Article  Google Scholar 

  • Gantmacher FR (1959) The theory of matrices. Chelsea Publishers, New York

    MATH  Google Scholar 

  • Jadbabaie A, Lin J, Morse AS (2003) Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans Autom Control 48(6):988–1001

    Article  MathSciNet  Google Scholar 

  • Levin DA, Peres Y, Wilmer EL (2008) Markov chains and mixing times. AMS, Providence

    Google Scholar 

  • Strogatz SH (2003) Sync: the emerging science of spontaneous order. Hyperion, New York

    Google Scholar 

  • Surowiecki J (2004) The wisdom of crowds: why the many are smarter than the few and how collective wisdom shapes business, economies, societies and nations. Little, Brown. (Traduzione italiana: La saggezza della folla, Fusi Orari, 2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fabio Fagnani .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag London

About this entry

Cite this entry

Fagnani, F. (2013). Consensus of Complex Multi-agent Systems. In: Baillieul, J., Samad, T. (eds) Encyclopedia of Systems and Control. Springer, London. https://doi.org/10.1007/978-1-4471-5102-9_136-1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-5102-9_136-1

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, London

  • Online ISBN: 978-1-4471-5102-9

  • eBook Packages: Springer Reference EngineeringReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Chapter history

  1. Latest

    Consensus of Complex Multi-agent Systems
    Published:
    14 October 2020

    DOI: https://doi.org/10.1007/978-1-4471-5102-9_136-2

  2. Original

    Consensus of Complex Multi-agent Systems
    Published:
    03 April 2014

    DOI: https://doi.org/10.1007/978-1-4471-5102-9_136-1