The projection method for continuous-time consensus seeking

被引：0
作者：
R. P. Agaev
P. Yu. Chebotarev
机构：
[1] Russian Academy of Sciences,Trapeznikov Institute of Control Sciences
来源：
Automation and Remote Control | 2015年 / 76卷
关键词：
Remote Control; Orthogonal Projection; Projection Method; Multiagent System; Laplacian Matrix;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
For the case where the dependency digraph has no spanning in-tree, we characterize the region of convergence of the basic continuous-time distributed consensus algorithm and show that consensus can be achieved by employing the method of orthogonal projection, which has been proposed for the discrete-time coordination problem.
引用
收藏
页码：1436 / 1445
页数：9
相关论文
共 21 条
[1]  
Agaev R.P.(2000)The Matrix of Maximum Out Forests of a Digraph and its Applications Autom. Remote Control. 61 1424-1450
[2]  
Chebotarev P.Yu.(2009)Coordination in Multiagent Systems and Laplacian Spectra of Digraphs Autom. Remote Control. 70 469-483
[3]  
Chebotarev P.Yu.(2004)Consensus Problems in Networks of Agents with Switching Topology and Time-delays IEEE Trans. Automat. Control. 49 1520-1533
[4]  
Agaev R.P.(2013)On the Asymptotics of Consensus Protocols Upravlen. Bol’shimi Sist. 43 55-77
[5]  
Olfati-Saber R.(2014)The Forest Consensus Theorem IEEE Trans. Automat. Control. 59 2475-2479
[6]  
Murray R.M.(2002)Forest Matrices around the Laplacian Matrix Linear Algebra Appl. 356 253-274
[7]  
Chebotarev P.Yu.(1974)Reaching a Consensus J. Am. Stat. Ass. 69 118-121
[8]  
Agaev R.P.(1936)The Approximation of One Matrix by Another of Lower Rank Psychometrika 1 211-218
[9]  
Chebotarev P.(2012)Distributed Containment Control with Multiple Stationary or Dynamic Leaders in Fixed and Switching Directed Networks Automatica 48 1586-1597
[10]  
Agaev R.(1996)A Characterization and Representation of the Drazin Inverse SIAM J. Matrix Anal. Appl. 17 744-747
123