Journal
SYSTEMS & CONTROL LETTERS
Volume 57, Issue 2, Pages 175-183Publisher
ELSEVIER
DOI: 10.1016/j.sysconle.2007.08.009
Keywords
multiagent system; undirected network; linear matrix inequality; average consensus; switching topology
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available