Consensusability of Discrete-time Multi-agent Systems over Directed Graphs
This paper investigates the joint effect of agent dynamic and directed communication graphs on consensusability of linear discrete-time multi-agent systems under a common control protocol. For single input agent dynamic, a necessary and suf.cient condition is given by a simple min-max optimization in terms of the eigenvalues of the graph Laplacian matrix and the topological entropy of the agent dynamic. While for the vector input case, a suf.cient condition, which is also necessary for single input, is provided to achieve consensusability. By using non-identical control gain matrices differed by a scaling for each agent, a design method for the optimal scaling is proposed as well. The result recovers the related literature. An illustrative example is.nally included to demonstrate the effectiveness of our theoretic results.
YOU Keyou XIE Lihua
School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore, 639798
国际会议
The 30th Chinese Control Conference(第三十届中国控制会议)
烟台
英文
1-6
2011-07-01（万方平台首次上网日期，不代表论文的发表时间）