文献类型：期刊文献

英文题名：Fast consensus seeking in multi-agent systems with time delay

作者：Yang, Wen[1];Wang, Xiaofan[2];Shi, Hongbo[1]

机构：[1]E China Univ Sci & Technol, Minist Educ, Key Lab Adv Control & Optimizat Chem Proc, Shanghai 200237, Peoples R China;[2]Shanghai Jiao Tong Univ, Dept Automat, Shanghai 200240, Peoples R China

年份：2013

卷号：62

期号：3

起止页码：269

外文期刊名：SYSTEMS & CONTROL LETTERS

收录：;EI(收录号：20130515949100);WOS:【SCI-EXPANDED(收录号:WOS:000317257500007)】；

基金：This work was supported by the National Natural Science Foundation of P.R. China under Grants No. 61074125, No. 61203158, the Major State Basic Research Development Program of China (973 Program) under Grant No. 2010CB731400, the Fundamental Research Funds for the Central Universities, the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grants No. 20100074120010, and Shanghai Municipal Natural Science Foundation under No. 11ZR1409700.

语种：英文

外文关键词：Distributed consensus; Time delay; Convergence speed; Convex optimization

摘要：This paper considers the problem of finding the optimal network topology and consensus gain for the fastest second-order consensus with time delay. By using the root locus method in the frequency domain, the problem can be decomposed into two convex optimization problems. In the case that the network topology is fixed, a multi-hop relay scheme is introduced for fast consensus seeking. Each agent can receive information from its multi-hop neighbors with a certain delay. The optimal number of hops for the fastest convergence speed can be derived from the largest generalized eigenvalue of a pair of extension matrices. Finally, some examples are supplied to verify the theoretical results. (C) 2012 Elsevier B.V. All rights reserved.