Abstract
In this paper, the bipartite consensus problem is addressed for a class of double-integrator multi-agent systems with antagonistic interactions. The cases with and without communication time delays are considered. In particular, if the communication time delays are not taken into account, the bipartite consensus of the studied multi-agent systems with directed signed graph can be achieved by the proposed distributed controller. If the nonuniform communication time delays are considered, the bipartite consensus of the considered multi-agent systems with undirected signed graph can be achieved if the time delays are less than a derived upper bound. Moreover, we propose an algorithm to solve the so-called grouping problem. Finally, some numerical examples are provided to illustrate the correctness of the results.
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.
