Abstract
AbstractThe bipartite consensus problem is investigated for double‐integrator multi‐agent systems in the presence of measurement noise. A distributed protocol with time‐varying consensus gain is proposed. By using tools of state transition matrix and algebraic graph theory, necessary and sufficient conditions for the designed protocol to be a mean square bipartite linear χ‐consensus protocol are given. It is shown that the signed digraph being structurally balanced and having a spanning tree are not only sufficient, but also necessary for bipartite consensus. Furthermore, the protocol is proved to be a mean square bipartite average consensus protocol if the signed graph is weight balanced.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.