Consensus Problems for High-Order Multi-Agent Systems

Article Preview

Abstract:

An information consensus algorithm for high-order multi-agent systems is proposed based on algebraic graph theory. Sufficient and necessary conditions are given for each information to converge to common values. The network topology of multi-agent systems has a directed spanning tree and each weight of different derivatives is positive, then consensus is achieved.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 403-408)

Pages:

2736-2739

Citation:

Online since:

November 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] T. Vicsek, A. Czirok, E. Ben-Jacob, I. Cohen and O. Shochet: Physical Review Letters Vol. 75(1995), p.1226.

Google Scholar

[2] Su H S, Wang X F, Yang W: Asian Journal of Control, Vol. 10(2008) , p.238.

Google Scholar

[3] R. Olfati-Saber , R.M. Murray, in: IEEE Transactions on Automatic Control (2004).

Google Scholar

[4] W. Ren: Systems and Control Letters, Vol. 56(2007), p.474.

Google Scholar

[5] Wei Ren. On consensus algorithms for double-integrator dynamics, in: IEEE Trans. Automatic Control (2008).

Google Scholar