Almost Sure Exponential Consensus of Linear and Nonlinear Multi-Agent Systems Under Semi-Markovian Switching Topologies and Application to Synchronization of Chaos Systems

Almost Sure Exponential Consensus of Linear and Nonlinear Multi-Agent Systems Under Semi-Markovian Switching Topologies and Application to Synchronization of Chaos Systems
复制标题

DOI：
10.1109/access.2023.3331745
复制
发表时间：
2023
期刊：
IEEE Access
影响因子：
3.9
通讯作者：
Xia Xiao;Xihui Wu;Xiaoli Hou;Yuehua He
Xia Xiao;Xihui Wu;Xiaoli Hou;Yuehua He
中科院分区：
计算机科学3区
文献类型：
--
作者：
Xia Xiao;Xihui Wu;Xiaoli Hou;Yuehua He

文献摘要

相似文献

本文研究了半马尔可夫切换拓扑（SMST）下线性和非线性多智能体系统（MAS）的几乎确定的指数领导者跟随共识（ASELFC）。与现有的SMST下的MAS研究工作不同，我们消除了每个拓扑都有一个以领导者为根的有向生成树（DST）的限制。仅部分交换拓扑需要具有 DST。采用Lyapunov分析方法和随机技术，得到了ASELFC的充分条件。最后，以蔡氏电路为例，将理论结果应用于解决混沌系统的同步问题。
This paper researches the almost sure exponential leader-following consensus (ASELFC) of linear and nonlinear multi-agent systems (MASs) under semi-Markovian switching topologies (SMSTs). Differing from existing research works of MASs under SMSTs, we remove the restriction that every topology has a directed spanning tree (DST) rooted in the leader. Only partial switching topologies are requested to have a DST. By employing Lyapunov analysis method and stochastic technique, sufficient conditions for ASELFC are obtained. Finally, the theoretical results are applied to solve the synchronization of Chaos systems by using an example of Chua’s circuits.