Abstract
This paper explores the collective behavior of bipartite flocking for a set of autonomous mobile agents based on Cucker-Smale update rules on directed cooperation-competition networks. In our model, cooperative or competitive degree between neighbouring agents is set by a nonlinear function of the communication distance between agents, which is called weight function, and further the influence of communication delays on the system stability and the final distance between agents is analyzed. With the help of related conclusions about sub-stochastic matrices, a sufficient condition relying on the topology structure, weight functions and initial states is established to guarantee the realization of bipartite flocking behavior. In the end the effectiveness of dynamic results is verified through a numerical example.
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.
