Abstract
In this paper we, investigate the bipartite consensus of higher-order multi-agent systems, by assuming that the interactions among agents are either cooperative or antagonistic and that the communication graph switches among a finite number of possible configurations. We first show that the “lifting approach”, proposed in [3] to model opinion dynamics in case of antagonistic interactions and agents modeled as integrators, can be extended to the case of higher order multi-agent systems with cooperative/antagonistic interactions and switching topologies. Subsequently, we are able to translate the bipartite consensus problem into a consensus problem among cooperative agents with switching topologies. This allows us to make use of the results obtained in [13] and hence to solve the bipartite consensus problem.
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.
