Abstract
This work focuses on the fixed-time bipartite flocking control problem for multi-agent systems. By employing the structurally balanced signed graph theory and a fixed-time stability theorem, we can prove that all individuals can be partitioned into two disjoint clusters within a fixed time and they move to opposite directions with the same velocity. We find that the settling time merely depends on the parameters and network connectivity. Moreover, the parameters, network connectivity and the initial states have an important influence on the diameter of each disjoint cluster. The results are novel, which are firstly illustrated by both theoretical analysis and numerical simulations.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
