CASIA OpenIR  > 复杂系统管理与控制国家重点实验室  > 先进机器人
Leader-Following Consensus of Discrete-Time Linear Multi-AgentSystems with Communication Noises
Long Cheng; Hongming Wang; Zeng-Guang Hou; Min Tan; Hongnian Yu
Conference Name34th Chinese Control Conference (CCC)
Conference DateJUL 28-30, 2015
Conference PlaceHangzhou
AbstractThis paper studies the leader-following consensus problem of discrete-time generic linear multi-agent systems. Agents share their states with their neighbors via a noisy communication network. An algorithm is proposed for the leader-following consensus problem where the time-varying gain is employed to attenuate noises. Different from most previous results where all agents have to use the same time-varying gain, each agent can have its own time-varying gain. Sufficient conditions for solving the mean square leader-following consensus problem are obtained: 1) the communication topology graph has a spanning tree; 2) the summation of every time-varying gain from zero to infinite is infinite; 3) all time-varying gains are infinitesimal of the same order as time goes to infinity; and 4) all roots of a so-called "parameter polynomial" are inside the unit circle. Finally, a simulation example is given to verify the theoretical results.
Document Type会议论文
Recommended Citation
GB/T 7714
Long Cheng,Hongming Wang,Zeng-Guang Hou,et al. Leader-Following Consensus of Discrete-Time Linear Multi-AgentSystems with Communication Noises[C],2015.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Long Cheng]'s Articles
[Hongming Wang]'s Articles
[Zeng-Guang Hou]'s Articles
Baidu academic
Similar articles in Baidu academic
[Long Cheng]'s Articles
[Hongming Wang]'s Articles
[Zeng-Guang Hou]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Long Cheng]'s Articles
[Hongming Wang]'s Articles
[Zeng-Guang Hou]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.