Average Consensus in Networks of Multi-Agent with Multiple Time-Varying Delays

HTML  Download Download as PDF (Size: 295KB)  PP. 196-203  
DOI: 10.4236/ijcns.2010.32028    6,439 Downloads   12,093 Views  Citations
Author(s)

Affiliation(s)

.

ABSTRACT

The average consensus in undirected networks of multi-agent with both fixed and switching topology coupling multiple time-varying delays is studied. By using orthogonal transformation techniques, the original system can be turned into a reduced dimensional system and then LMI-based method can be applied conveniently. Convergence analysis is conducted by constructing Lyapunov-Krasovskii function. Sufficient conditions on average consensus problem with multiple time-varying delays in undirected networks are obtained via linear matrix inequality (LMI) techniques. In particular, the maximal admissible upper bound of time-varying delays can be easily obtained by solving several simple and feasible LMIs. Finally, simulation examples are given to demonstrate the effectiveness of the theoretical results.

Share and Cite:

T. ZHANG and H. YU, "Average Consensus in Networks of Multi-Agent with Multiple Time-Varying Delays," International Journal of Communications, Network and System Sciences, Vol. 3 No. 2, 2010, pp. 196-203. doi: 10.4236/ijcns.2010.32028.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.