CONSENSUS AND r-CONSENSUS PROBLEMS FOR SINGULAR SYSTEMS  

作　　者：ZHANG Lequn FENG Jun-e YAO Juan 

机构地区：[1]School of Mathematics, Shandong University

出　　处：《Journal of Systems Science & Complexity》2014年第2期252-262,共11页系统科学与复杂性学报（英文版）

基　　金：supported by the National Natural Science Foundation of China under Grant Nos.61174141 and 61374025;Research Awards Young and Middle-Aged Scientists of Shandong Province under Grant Nos.BS2011SF009 and BS2011DX019;Excellent Youth Foundation of Shandong Province under Grant No.JQ201219

摘　　要：In this paper, the problem of consensus for continuous time singular systems of multi-agent networks is considered. The definition of r-consensus is introduced for singular systems of multi-agent networks. Firstly, linear systems with algebraic constraints are considered, and the corresponding results about consensus and average-consensus are derived. Then r-consensus and consensus problems of singular systems are investigated. Sufficient conditions of r-consensus and consensus are obtained,respectively. Finally, an illustrative example is given to show the effectiveness of the proposed method.

关 键 词：Balanced graphs CONSENSUS r-consensus singular systems strong connected graphs. 

分 类 号：O157.5[理学—数学]