Consensus of Finite-Field Networks with Switching Topologies and Linear Protocols
This paper investigates the consensus of finite-field networks with switching topologies and linear protocols by using the semi-tensor product (STP) method,and presents a number of new results.First,an algebraic form of finite-field networks with switching topologies and linear protocols is obtained via STP.Second,based on the algebraic form and the switching point reachability,a necessary and sufficient condition is presented for the consensus of finite-field networks under arbitrary switching signal.Finally,an illustrative example is given to verify the obtained new results.The study of the illustrative example shows that the new results presented in this paper are very effective in the consensus analysis of finite-field networks with switching topologies and linear protocols under arbitrary switching signal.
Finite-Field Networks Consensus Switching Topologies Linear Protocols Switching Point Reachability Semi-Tensor Product of Matrices
LI Haitao WANG Yuzhen GUO Peilian
School of Control Science and Engineering,Shandong University,Jinan 250061,P. R. China
国际会议
The 33th Chinese Control Conference第33届中国控制会议
南京
英文
2475-2480
2014-07-28(万方平台首次上网日期,不代表论文的发表时间)