Average Consensus in Networks of Multi-Agent with Multiple Time-Varying Delays英文文献资料.docVIP

Int. J. Communications, Network and System Sciences, 2010, 3, 196-203 doi:10.4236/ijcns.2010.32028 Published Online February 2010 (http://www.SciRP.org/journal/ijcns/). Average Consensus in Networks of Multi-Agent with Multiple Time-Varying Delays Tiecheng ZHANG, Hui YU Institute of Nonlinear and Complex Systems, China Three Gorges University, Yichang, China Email: ztchongctgu@, yuhui@ Received November 19, 2009; revised December 15, 2009; accepted January 21, 2010 Abstract The average consensus in undirected networks of multi-agent with both fixed and switching topology cou- pling 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 con- veniently. Convergence analysis is conducted by constructing Lyapunov-Krasovskii function. Sufficient con- ditions 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. Keywords: Average Consensus, Multi-Agent System, Multiple Time-Varying Delays, Linear Matrix Inequality 1. Introduction in [2] are extended to the case of directed graph by Ren et al. [3], in which matrix analysis and algebraic graph theory were used. Moreau [4] used a set-valued Lyapunov approach to study consensus problem with unidirectional time-dependent communication links. Saber et al. [5] discussed average consensus problem. When network communication is affected by time de- lay, the consensus problem is investigated in [5–7]. In [8], Saber provided a theoretical framework for analy- sis of consensus algorit