Average consensus in networks of dynamic agents with switching topologies and multiple time-varying delays

被引：390

作者：

Sun, Yuan Gong ^{[1
,2
]}

Wang, Long ^{[1
]}

Me, Guangming ^{[1
]}

机构：

[1] Peking Univ, Ctr Syst & Control, Coll Engn, Beijing 100871, Peoples R China

[2] Qufu Normal Univ, Dept Math, Qufu 273165, Shandong, Peoples R China

来源：

SYSTEMS & CONTROL LETTERS | 2008年 / 57卷 / 02期

关键词：

multiagent system; undirected network; linear matrix inequality; average consensus; switching topology;

D O I：

10.1016/j.sysconle.2007.08.009

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we discuss average consensus problem in undirected networks of dynamic agents with fixed and switching topologies as well as multiple time-varying communication delays. By employing a linear matrix inequality method, we prove that all the nodes in the network achieve average consensus asymptotically for appropriate communication delays if the network topology is connected. Particularly, several feasible linear matrix inequalities are established to determine the maximal allowable upper bound of time-varying communication delays. Numerical examples are given to demonstrate the effectiveness and the sharpness of the theoretical results. (C) 2007 Elsevier B.V. All rights reserved.

引用

页码：175 / 183

页数：9