网络拓扑
停留时间
李雅普诺夫函数
控制理论(社会学)
多智能体系统
计算机科学
功能(生物学)
共识
强连通分量
国家(计算机科学)
数学优化
拓扑(电路)
数学
控制(管理)
算法
人工智能
进化生物学
临床心理学
生物
操作系统
物理
医学
非线性系统
组合数学
量子力学
作者
Jian Sun,Zhanshan Wang,Nannan Rong
摘要
Summary Consensus problem of multiagent systems with switching jointly connected topologies under sampled‐data control is studied in this article. The main contribution is that the consensus problem for such system is solved without the assumption that the system matrices are stable or critically stable. For this purpose, a time‐varying Lyapunov function method is utilized to describe the state characteristics with switching jointly connected topologies. Based on the time‐varying matrix of Lyapunov function, the “decline” characteristics at the switching instants is derived to compensate the divergence among the agents with disconnected topologies. Utilizing the “decline” characteristics, the overall consensus of such system can be guaranteed in the framework of dwell time. Finally, the effectiveness of the proposed result is illustrated by two numerical examples.
科研通智能强力驱动
Strongly Powered by AbleSci AI