Abstract

In this paper, the bipartite tracking consensus problem of general linear multi-agent systems over signed networks is investigated, in which an asynchronous communication manner is adopted. The asynchronous setting refers to that the clocks of each agent, at which the agent’s dynamics is updated, are independent of others. Relying on some related properties of the sub-stochastic matrix, the dynamics of the agents under the proposed asynchronous consensus protocol is rigorously checked. It is shown that the bipartite tracking consensus is implemented if the signed digraph contains a spanning tree. A simulation example is provided to verify our theoretical findings.

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 call

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.