Abstract
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 (F d TC) 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 F d TC protocol is applied to solve the FTC problem. Simulations are provided to illustrate the effectiveness of our theoretical results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Systems, Man, and Cybernetics: Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
