Consensus and Cooperation in Networked Multi-Agent Systems

Консенсус и кооперация в сетевых многоагентных системах
Richard M. Murray, Reza Olfati‐Saber, J.A. Fax
2007-01-01

algebraic graph theorydirected information flowmulti-agent consensusnetwork topology robustnesssmall-world networks
This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees. An overview of basic concepts of information consensus in networks and methods of convergence and performance analysis for the algorithms are provided. Our analysis framework is based on tools from matrix theory, algebraic graph theory, and control theory. We discuss the connections between consensus problems in networked dynamic systems and diverse applications including synchronization of coupled oscillators, flocking, formation control, fast consensus in small-world networks, Markov processes and gossip-based algorithms, load balancing in networks, rendezvous in space, distributed sensor fusion in sensor networks, and belief propagation. We establish direct connections between spectral and structural properties of complex networks and the speed of information diffusion of consensus algorithms. A brief introduction is provided on networked systems with nonlocal information flow that are considerably faster than distributed systems with lattice-type nearest neighbor interactions. Simulation results are presented that demonstrate the role of small-world effects on the speed of consensus algorithms and cooperative control of multivehicle formations.
1
Matrix theory, algebraic graph theory, and control theory provide convergence and performance analysis tools for networked multi-agent consensus.
2
Networks with nonlocal information flow can achieve substantially faster consensus than distributed systems using lattice-type nearest-neighbor interactions.
3
Simulations demonstrate that small-world network effects accelerate consensus and influence cooperative control performance in multivehicle formations.
4
Spectral and structural properties of complex networks are directly connected to the speed of information diffusion in consensus algorithms.
5
The paper develops a theoretical framework for consensus algorithms emphasizing directed information flow, topology changes from link or node failures, time delays, and performance guarantees.

Networked multi-agent systems (networked multi-agent dynamic systems)

consensus and cooperation dynamics, including convergence speed, robustness, and performance under directed information flow, topology changes, and time delays

Publication Details
Publication Date
2007-01-01
Journal
Publisher
ISSN
Cited by
10540
Access Type
Author Information
Authors
Richard M. Murray
Reza Olfati‐Saber
J.A. Fax
Explore further
Open the scid.ai AI chat with a ready-made request: it will find papers on a similar topic and help build a literature review.
Find similar papers in the chat →
Make a presentation
100%