期刊
SYSTEMS & CONTROL LETTERS
卷 57, 期 2, 页码 175-183出版社
ELSEVIER
DOI: 10.1016/j.sysconle.2007.08.009
关键词
multiagent system; undirected network; linear matrix inequality; average consensus; switching topology
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据