Consensus Problem of Singular Multi-Agent Systems with Continuous-Time and Fixed Topology

Article Preview

Abstract:

The consensus problems of two situations for singular multi-agent systems with fixed topology are discussed: directed graph without spanning tree and the disconnected undirected graph. A sufficient and necessary condition is obtained by applying the stability theory and the system is reachable asymptotically. But for normal systems, this can’t occur in upper two situations. Finally a simulation example is provided to verify the effectiveness of our theoretical result.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1687-1691

Citation:

Online since:

January 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] W. Ren, R.W. Beard, T.W. McLain: Coordination variables and consensus building in multiple vehicle systems in Cooperative Control. (Berlin: Springer-Verlag, 2005).

Google Scholar

[2] R. Olfati-Saber, R.M. Murray: IEEE Transactions on Automatic Control, Vol. 49, (2004), P1520.

Google Scholar

[3] H.H. Rosenbrock: Int. J. Control, Vol. 20 (1974), P191.

Google Scholar

[4] Yonghong Wu, Zhi-Hong Guan: IEEE international conference on control and automation (xiamen, China, June9-11, 2010), P2115.

Google Scholar

[5] W. Ren, R.W. Beard: IEEE Transactions on Automatic Control, Vol. 50, (2005), P655.

Google Scholar

[6] C. Godsil and G. Royle: Algebraic Graph Theory. (New York: Springer-Verlag, 2001. ).

Google Scholar

[7] P.C. Parks, V. Hahn: Stability theory (Prentice Hall, 1993).

Google Scholar

[8] Q.L. Zhang, D.M. Yang: Analysis and Synthesis for Uncertain Descriptor Systems (Shenyang: Northeastern University Press. 2003)(In Chinese).

Google Scholar