Consensus and Cooperation in Networked Multi-Agent Systems - Revision history

Murray at 15:26, 26 February 2017

2017-02-26T15:26:02Z

← Older revision		Revision as of 15:26, 26 February 2017
Line 2:		Line 2:
	\| authors = R Olfati-Saber, J Fax, Richard M Murray		\| authors = R Olfati-Saber, J Fax, Richard M Murray
	\| title = Consensus and Cooperation in Networked Multi-Agent Systems		\| title = Consensus and Cooperation in Networked Multi-Agent Systems
	\| source = Proceedings of the IEEE, 95(1):215 - 233		\| source = Proceedings of the IEEE, 95(1):215 - 233, 2007
	\| year = 2007		\| year = 2007
	\| type = Preprint		\| type = Preprint

Murray at 15:25, 26 February 2017

2017-02-26T15:25:23Z

← Older revision		Revision as of 15:25, 26 February 2017
Line 7:		Line 7:
	\| funding =		\| funding =
	\| url = http://www.cds.caltech.edu/~murray/preprints/ofm07-ieeeproc.pdf		\| url = http://www.cds.caltech.edu/~murray/preprints/ofm07-ieeeproc.pdf
	\| abstract = 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-de.....		\| abstract = 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.
	\| flags =		\| flags =
	\| tag = ofm07-ieeeproc		\| tag = ofm07-ieeeproc
	\| id = 2007c		\| id = 2007c
	}}		}}

Murray: htdb2wiki: creating page for 2007c_ofm07-ieeeproc.html

2016-05-15T06:17:23Z

htdb2wiki: creating page for 2007c_ofm07-ieeeproc.html

New page

{{HTDB paper
| authors = R Olfati-Saber, J Fax, Richard M Murray
| title = Consensus and Cooperation in Networked Multi-Agent Systems
| source = Proceedings of the IEEE, 95(1):215 - 233
| year = 2007
| type = Preprint
| funding =
| url = http://www.cds.caltech.edu/~murray/preprints/ofm07-ieeeproc.pdf
| abstract = 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-de.....
| flags =
| tag = ofm07-ieeeproc
| id = 2007c
}}