Abstract
ABSTRACTThis paper deals with signed consensus problems for networks of agents in the presence of both fixed and switching topologies. By specifying signs for the agents, they are divided into two groups and are enabled to reach agreement on a consensus value which is the same in modulus for both groups but not in sign. Using nearest-neighbour interaction rules, we propose the distributed protocols and address their exponential convergence problem. It is shown that the quasi-strong connectivity of fixed networks or joint quasi-strong connectivity of switching networks can provide a necessary and sufficient guarantee for all agents to achieve signed consensus exponentially fast. In particular, the signed consensus results can include as special cases those of bipartite consensus in signed networks with fixed and switching topologies. Numerical simulations are also provided to illustrate the exponential convergence performance of the proposed signed consensus protocols.
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.
