Abstract
Within the framework of signed graph and multi-agent systems, this paper investigates the distributed bipartite opinion forming problem over coopetition networks. Several sufficient algebraic and geometric topology conditions that guarantee consensus, regardless of the magnitudes of individual coupling strengths among the agents, have been derived by exploring the interaction direction patterns. All the criteria presented do not require the global knowledge of the coupling weights of the entire network, and thus are easier to check. The effectiveness of the theoretical results are illustrated by numerical examples.
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.
