Input-to-State Stability of Multi-Agent Systems

Article Preview

Abstract:

In this paper, we mainly study input-to-state-stability (ISS) for the multi-agent systems with directed graph and the communication noise under switching interaction topologies, using the method of input-to-state-stability, input-to-state-stability -Lyapunov function. We point out the results of [5] is correct, but the proof of its main theorem has a small mistake, we give the proof by quite a different method.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

486-489

Citation:

Online since:

April 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] R. Olfati-Saber and R. M. Murray, Consensus problems in networks of agents with switching topology and time-delays, IEEE Trans. Automatic Control, Vol. 49, (2004) , p.1520.

DOI: 10.1109/tac.2004.834113

Google Scholar

[2] W. Ren, E. Atkins, Second-order consensus protocols in multiple vehicle systems with local interactions, Proc. AIAA Guidance, Navigation, Control Conf., San Francisco, CA, Paper AIAA-2005-6238, (2005).

DOI: 10.2514/6.2005-6238

Google Scholar

[3] E. Sontag, Y. Wang. On characterizations of the input to state stability property[J]. Systems & Control Letters, 24: 351-359, (1995).

DOI: 10.1016/0167-6911(94)00050-6

Google Scholar

[4] E. Sontag. On the input-to-state stability property[J]. European J. Control, 1: 24-36, (1995).

Google Scholar

[5] Derek B. Kingston, W. Ren, Randal W. Beard, Consensus algorithms are input-to-state stable, Proc. American Control Conf., Portland, OR, USA, p.1686, (2005).

DOI: 10.1109/acc.2005.1470210

Google Scholar

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

Google Scholar

[7] H. Khalil. Nonlinear Systems[M]. Upper Saddle River: Prentice Hall, (2002).

Google Scholar