同步(交流)
拓扑(电路)
网络拓扑
同步网络
计算机科学
多智能体系统
离散时间和连续时间
控制理论(社会学)
数学
控制(管理)
计算机网络
人工智能
统计
组合数学
作者
Xingping Wang,Jiandong Zhu,Zhaolin Cheng
出处
期刊:IEEE Transactions on Automatic Control
[Institute of Electrical and Electronics Engineers]
日期:2014-10-14
卷期号:60 (7): 1927-1932
被引量:33
标识
DOI:10.1109/tac.2014.2362990
摘要
In this note, we consider the synchronization problem for discrete-time linear multi-agent systems with time-varying network topology. To describe a new joint connectivity condition for synchronization, the concept of synchronization reachable topology is introduced. Under the conditions that agent dynamics is neutrally stable and network topology is synchronization reachable, a synchronization and an exponential synchronization result are obtained using paracontraction theory. The two results generalize in a natural way the classical results for the consensus of first-order discrete-time multi-agent systems. Finally, the effectiveness of the results is illustrated by a simulation example.
科研通智能强力驱动
Strongly Powered by AbleSci AI