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

Abstract

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.

Keywords

• Almost sure exponential leader-following consensus
• semi-Markovian switching topologies
• multi-agent systems