Finite-Time Consensus of Switched Multiagent Systems
研究了由连续时间和离散时间子系统组成的切换多智能体系统的有限时间一致性问题，提出了两种协议并证明了在强连通和领导跟随网络下的有效性。
This paper focuses on the finite-time consensus (FTC) problem of switched multiagent system (MAS) which is composed of continuous-time and discrete-time subsystems. Different from the existing results, each agent of this system is controlled by switching control method. To achieve consensus in finite time for the switched MAS, two types of consensus protocols (the FTC protocol and the fixed-time consensus (FdTC) protocol) are proposed. By using algebraic graph theory, Lyapunov theory and matrix theory, it is proved that the FTC problem in strongly connected network and leader-following network can be solved, respectively. When the initial states of agents are not available, the FdTC protocol is applied to solve the FTC problem. Simulations are provided to illustrate the effectiveness of our theoretical results.