Abstract
This article settles the fixed-time bipartite consensus for multi-agent systems that are subject to disturbances or not. The established protocols are aimed at controlling networked agents to reach agreement bipartitely, which reveals that a final state is the same in quantity but not in sign. By introducing algebraic graph theory, Lyapunov analysis and stability theory of fixed-time, the settling time associated with the design parameters and network connectivity rather than the initial states is explicitly given. The rationality of theoretical analysis is demonstrated via simulations.
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: Physica A: Statistical Mechanics and its Applications
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.
