- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Annual Issues
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
Abstract and Applied Analysis
Volume 2013 (2013), Article ID 783279, 9 pages
Cucker-Smale Flocking with Bounded Cohesive and Repulsive Forces
1School of Electronics and Information, Hangzhou Dianzi University, Hangzhou 310018, China
2School of Information Engineering, Huanghuai University, Henan 463000, China
3Department of Mathematics, Southeast University, Nanjing 210096, China
4Department of Mathematics, King Abdulaziz University, Jeddah 21589, Saudi Arabia
5School of Science, Linyi University, Linyi, Shandong 276005, China
Received 6 July 2013; Accepted 27 August 2013
Academic Editor: A. M. Elaiw
Copyright © 2013 Qiang Song et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
This paper proposes two Cucker-Smale-type flocking models by introducing both cohesive and repulsive forces to second-order multiagent systems. Under some mild conditions on the initial state of the flocking system, it is shown that the velocity consensus of the agents can be reached independent of the parameter which describes the decay of communication rates. In particular, the collision between any two agents can always be avoided by designing an appropriate bounded repulsive function based on the initial energy of the flock. Numerical examples are given to demonstrate the effectiveness of the theoretical analysis.
Over the past few decades, the flocking problem of multiagent systems has attracted increasing attention due to its wide applications in many fields such as unmanned air vehicles, mobile robots, and sensor networks. To simulate the collective behaviors of birds and fish, Reynolds  proposed three well-known flocking rules for multiagent systems, that is, center cohesion, collision avoidance, and velocity consensus. In , Vicsek et al. introduced a simple discrete time flocking model to study the emergence of autonomous agents moving in the plane with the same speed but with different headings. By using nonnegative matrix and algebraic graph theories, Jadbabaie et al.  provided the theoretical analysis for Vicsek's flocking model. Olfati-Saber  presented a systematic framework to design distributed flocking algorithms for multiagent systems. Tanner et al.  investigated the flocking behaviors of multiagent systems with fixed and switching network topologies. In , both theoretical and experimental results were given for a flock of mobile robots. In [7–10], some strategies were developed to ensure the connectivity of the time-varying communication topology.
In 2007, Cucker and Smale  proposed a flocking model to investigate the emergence behavior in multiagent systems. For a network of autonomous agents, the continuous-time version of the Cucker-Smale flocking model is described as follows : where are the position and velocity states of the th agent, respectively, is called the communication rate defined as in which determines the decay of , , and .
In , Cucker and Smale studied the flocking behavior of model (1) and showed that the flock converges to a common velocity unconditionally when , while the stability of the flock depends on the initial positions and velocities when . The Cucker-Smale flocking model (1) has attracted much attention in recent years. Shen  investigated the flocking behavior of an extended Cucker-Smale model with hierarchical leadership. Ha and Liu  provided a simple proof for the Cucker-Smale model (1) and derived some conditions for reaching exponential flocking. Ha et al.  presented a Cucker-Smale-type model with nonlinear velocity couplings. Park et al.  proposed an augmented Cucker-Smale model by introducing interagent bonding forces. Perea et al.  successfully applied Cucker-Smale model (1) to the real-flight formation control in the Darwin space mission.
According to the flocking rules of Reynolds, one knows that the collision avoidance is not considered in the original Cucker-Smale model (1) and its variations [12–16]. To fix this drawback, Cucker and Dong  developed the following extended Cucker-Smale-type model with repelling forces: where the differentiable function satisfies and to ensure the collision avoidance among the agents, in which is a specified distance. Assuming that the initial positions of model (3) satisfy for all , Cucker and Dong  showed that the flock asymptotically converges to a common velocity and the distance between any two agents is greater than when , while the convergence of the flock relies on the initial positions and velocities of the agents when . Note that when , one has , which means that the repulsive force in model (3) is unbounded. However, in many practical cases, the actuator of an agent can only handle finite forces or torques due to its saturation. Therefore, it is imperative to design some bounded repulsive functions for Cucker-Smale-type flocking models.
Motivated by the above discussions, we propose two improved Cucker-Smale-type flocking models in this paper. The main contribution of this paper is three-fold. First, inspired by the flocking model developed by Park et al.  and the aggregation techniques proposed by Gazi and Passino [18, 19], this paper presents two control strategies for the Cucker-Smale model (1) to ensure the cohesiveness of the flocking system. Second, to overcome the actuator saturation of multiagent systems, this paper designs a class of bounded repulsive functions for Cucker-Smale model (1) such that the collision-free motion of the flock can always be guaranteed. Third, it is shown that the velocity convergence of two proposed flocking models in this paper can be achieved independent of the parameter , which describes the decay of communication rate . Due to these distinguishing features, the proposed flocking models in this paper significantly improve some previous work related to Cucker-Smale-type flocking.
The remainder of this paper is organized as follows. Section 2 formulates the asymptotical flocking problem and defines bounded repulsive functions. Section 3 proposes two improved Cucker-Smale models and investigates their flocking behaviors. Numerical examples are given in Section 4 to verify the theoretical analysis. Finally, some concluding remarks and future trends are stated in Section 5.
Notations. The standard notations are used throughout the paper. The superscript “” represents the transpose of a vector or a matrix. denotes the set of real numbers. For , let be its Euclidean norm and let be its minimal element, and let denote the inner product. Let be a vector with all zero entries. The symbol “” is the gradient operator.
This section formulates the flocking problem of second-order multiagent systems, and defines a class of bounded repulsive functions to avoid interagent collisions.
2.1. Problem Formulation
Consider a second-order multiagent system consisting of agents described by where are the position and velocity states of the th agent, respectively, and is the control input for the th agent.
Definition 1. According to the flocking rules proposed by Reynolds , multiagent system (4) is said to achieve asymptotical flocking if its solution satisfies the following conditions for all , and :(i)flock cohesion: ;(ii)collision avoidance: ; (iii)velocity consensus: .
Remark 2. The first condition of the asymptotical flocking in Definition 1 indicates that each agent should stay close to the nearby flockmates to ensure the cohesiveness of the flock.
Remark 3. The collision in a multiagent system means that there exist at least two agents occupying the same space [4, 5, 7–9]. To ensure the collision-free motion of the flock, the minimal interagent distance in multiagent system (4) should be always greater than zero.
2.2. Bounded Repulsive Functions
To avoid collisions in a multiagent system, one can design some artificial potential functions to create interagent repulsive forces [4–8, 17–19]. Up to date, most researchers utilize the negative gradients of unbounded potential functions to avoid collisions among agents [5, 7, 8, 17–19]. However, in many practical situations, the control input of a multiagent system should be bounded because no actuator could provide an infinite control force. In this paper, we will show that interagent collisions can be avoided by designing some appropriate bounded repulsive functions. Below we define a class of bounded repulsive functions.
Definition 4. For multiagent system (4), assume that the initial positions of the agents satisfy for all . Let be a differentiable, nonnegative, and decreasing function with respective to the distance between agents and , such that (i). When , ; otherwise, ,(ii),where , and is a smooth and decreasing function in . If and , the potential function is called a bounded repulsive function.
Remark 5. If , that is, , the repulsive function is unbounded.
Remark 6. A possible bounded repulsive function to satisfy Definition 4 can be chosen as follows: where and .
3. Main Results
This section proposes two improved Cucker-Smale flocking models and investigates their flocking behaviors. In particular, some conditions are derived to ensure the collision-free motion of the flock.
3.1. Cucker-Smale Flocking with Bonding and Repulsive Forces
Recently, Park et al.  proposed an extended Cucker-Smale model as follows: where , and are positive parameters, , and the function is nonnegative.
In , it was shown that model (7) can exhibit cohesive flocking due to the bonding forces among the agents. However, the collision avoidance in model (7) was not addressed and thus should be resolved by adopting some new techniques. To improve model (7), we consider the following extended Cucker-Smale model with bonding and repulsive forces: where , , , and is a bounded repulsive function described in Definition 4.
Remark 8. We will show that the terms and in multiagent system (8) can yield bounded interagent bonding and repulsive forces, respectively.
The following result is very useful to derive the main results of this paper.
Lemma 9 (see ). For , let and . One has .
Let and be the position and velocity of the mass center of system (8), respectively as follows:
In view of , , and Remark 7, we can obtain . It follows that the velocity of the centroid of multiagent system (8) is a constant; that is, for all . Let and . It is obvious to see that and . Also, we have and . Then, it follows that and . Moreover, we have , whose time derivative is
Considering and , from (8) we have the following error system: where and .
To investigate the flocking behavior of multiagent system (8), we define the following energy function:
Theorem 10. For a flock of agents with dynamics (8), assume that the initial energy defined by (12) is finite, the initial positions satisfy for all , and the repulsive function is chosen to be bounded according to Definition 4. Then, multiagent system (8) exhibits asymptotical flocking with the common velocity ; that is, the velocity of the mass center, and the collision between any two agents can always be avoided if the repulsive function satisfies .
Proof. Considering (10) and Remark 7, we compute the time derivative of in (12) along the trajectory of (11) as follows:
where we use and , and the fact that (see Lemma 9) to obtain the third and the last equalities, respectively.
By (13), we have , which means that holds for all . Then, it follows from (12) that
Since , from (14) we obtain , which means that Hence, the cohesion condition of Definition 1 is satisfied.
By (2) and (15), we have for all . In view of (13), we have if and only if . Let . Thus, the set is the largest invariant set contained in the set for error system (11). According to LaSalle's invariance principle , starting from any initial condition, every solution of system (11) approaches as , that is, . So, the flock with dynamics (8) converges to a common velocity , that is, the velocity of the mass center.
Now we show that the collision between any two agents in multiagent system (8) can always be avoided if is satisfied. Suppose that agents and collides at some time instant . Then, we obtain . From (12), we have . Considering the assumption of , we have . However, always holds since . Hence, a contradiction occurs. Then, the distance between any two agents in multiagent system (8) should always be greater than zero, which ensures the collision-free motion of the flocking model (8).
Now, all three conditions of asymptotical flocking in Definition 1 hold. This completes the proof.
Remark 13. From the proof of Theorem 10, we have . Then, it follows that the term in multiagent system (8) yields bounded bonding forces among agents satisfying . If the repulsive function is bounded, the repulsive force in (8) is also bounded satisfying by Definition 4 and (15).
3.2. Cucker-Smale Flocking with Attractive and Repulsive Forces
For a network of agents, Gazi and Passino  proposed the following swarming model: where and are positive parameters, the first and the second terms in the right-hand side describe the attraction and repulsion among the agents, respectively. Motivated by the aggregation technique in the swarming model (16), we introduce both attractive and repulsive forces to the original Cucker-Smale model (1) as follows: where , and is a bounded repulsive function described in Definition 4.
Remark 15. Later, we will show that the terms and in (17) can yield bounded attractive and repulsive forces among the agents, respectively.
Let and be the position and the velocity of the mass center of multiagent system (17), respectively. It is easy to verify , which means that the velocity of the centroid is constant. Let and let . Note that . From (17), we obtain the following error system:
Construct the following energy function to study the flocking behavior of multiagent system (17):
Theorem 16. For flocking system (17), assume that the initial energy defined by (19) is finite, the initial positions satisfy for all , and the repulsive function is designed to be bounded based on Definition 4. Then, the flocking system (17) reaches velocity consensus on the common value , and the collision-free motion of the flock can be ensured if holds.
Proof. The proof can be carried out following the similar procedure for the proof of Theorem 10. The time derivative of in (19) along the trajectory of (18) yields
By (20), we have . Thus, for all . From (19), we obtain
Then, it follows that , which indicates that the term ( in (17) creates attractive forces among agents such that the positions of all agents remain bounded in a ball centered at with radius . Then, the distance between any two agents satisfies
Since , we have for all by (2). Then, in view of (20), we have if and only if . Following the similar lines in the proof of Theorem 10, we can show that the velocities of all agents in system (17) converge to the common velocity , and the distance between any two agents is always greater than zero if the bounded repulsive function satisfies .
Remark 17. From the proof of Theorem 16, we have . Then, it follows that the term in (17) yields a bounded attractive force, that is, . If the repulsive function is bounded, the repulsive force in (17) is also bounded satisfying by Definition 4 and (22).
4. Numerical Results
This section provides two simulation examples to verify our theoretical results. The bounded repulsive function (5), that is, for , is adopted to avoid interagent collisions. Define to measure the proximity of the agents .
Example 18. Consider flocking model (8) with ten two-dimensional agents. Initially, the minimum distance between any two agents is . The system parameters are chosen to be , , , and . The parameters of the repulsive function are taken as and . After some simple calculation using (12), we obtain which is the initial energy of the flock. Considering , we know that the condition on the bounded repulsive function in Theorem 10 is satisfied. From Figure 1(a), we can see that the flock converges to a common velocity. The cohesiveness among agents is clearly shown in Figure 1(b), in which the symbols “+” and “o” denote the starting and ending points of the trajectory of an agent, respectively. In particular, from Figure 1(c), we note that collision avoidance in the flock is ensured because the minimal interagent distance is always greater than zero.
Example 19. Consider a multiagent system composed of ten two-dimensional agents described by dynamics (17) with , , and . The initial positions of the agents satisfy . The parameters of the repulsive function are given by and . By (19), the initial energy of the flock is determined to be . Hence, the condition for the bounded repulsive function in Theorem 16 holds in view of . Figure 2(a) shows that the flock achieves velocity consensus. The cohesive behavior of the flock is demonstrated by Figure 2(b). Figure 2(c) indicates that the interagent distance is always greater than zero which guarantees the collision-free motion of the agents.
5. Conclusions and Future Work
In this paper, we have proposed two Cucker-Smale-type flocking models with both cohesive and repulsive forces to improve the original Cucker-Smale model and its existing variations. It is shown that the velocity convergence of the flocking system is independent of the parameter describing the decay of communication rates. We have also proved that the collision-free motion of the multiagent system can always be guaranteed by choosing an appropriate bounded repulsive function according to the initial energy of the flock. Up to date, the Cucker-Smale-type flocking models assume that each agent has the same sensing radius, which implies that the network topology is undirected. However, the sensing radii of the agents in a multiagent system may be different in many practical cases. In our future work, we will consider the Cucker-Smale flocking problem for multiagent systems with directed topologies.
This work was supported in part by the National Science Foundation of China under Grants 61273218, 61304172, 61272530, and 61273012, by the Natural Science Foundation of Henan Province of China under Grants 122102210027, 122300410220, and 2012XJGLX0521, by a project supported by the Scientific Research Fund of Zhejiang Provincial Education Department under Grant Y201223649 and by the Deanship of Scientific Research (DSR), King Abdulaziz University (KAU), under Grant 3-130/1434/HiCi. The authors, therefore, acknowledge technical and financial support of KAU.
- C. W. Reynolds, “Flocks, herds, and schools: a distributed behavioral model,” Computer Graphics, vol. 21, no. 4, pp. 25–34, 1987.
- T. Vicsek, A. Czirók, E. Ben-Jacob, I. Cohen, and O. Shochet, “Novel type of phase transition in a system of self-driven particles,” Physical Review Letters, vol. 75, no. 6, pp. 1226–1229, 1995.
- A. Jadbabaie, J. Lin, and A. S. Morse, “Coordination of groups of mobile autonomous agents using nearest neighbor rules,” IEEE Transactions on Automatic Control, vol. 48, no. 6, pp. 988–1001, 2003.
- R. Olfati-Saber, “Flocking for multi-agent dynamic systems: algorithms and theory,” IEEE Transactions on Automatic Control, vol. 51, no. 3, pp. 401–420, 2006.
- H. G. Tanner, A. Jadbabaie, and G. J. Pappas, “Flocking in fixed and switching networks,” IEEE Transactions on Automatic Control, vol. 52, no. 5, pp. 863–868, 2007.
- D. Gu and Z. Wang, “Leader-follower flocking: algorithms and experiments,” IEEE Transactions on Control Systems Technology, vol. 17, no. 5, pp. 1211–1219, 2009.
- H. Su, X. Wang, and G. Chen, “A connectivity-preserving flocking algorithm for multi-agent systems based only on position measurements,” International Journal of Control, vol. 82, no. 7, pp. 1334–1343, 2009.
- J. Zhou, X. Wu, W. Yu, M. Small, and J. Lu, “Flocking of multi-agent dynamical systems based on pseudo-leader mechanism,” Systems & Control Letters, vol. 61, no. 1, pp. 195–202, 2012.
- G. Wen, Z. Duan, H. Su, G. Chen, and W. Yu, “A connectivity-preserving flocking algorithm for multi-agent dynamical systems with bounded potential function,” IET Control Theory & Applications, vol. 6, no. 6, pp. 813–821, 2012.
- J. Zhu, J. Lü, and X. Yu, “Flocking of multi-agent non-holonomic systems with proximity graphs,” IEEE Transactions on Circuits and Systems I, vol. 60, no. 1, pp. 199–210, 2013.
- F. Cucker and S. Smale, “Emergent behavior in flocks,” IEEE Transactions on Automatic Control, vol. 52, no. 5, pp. 852–862, 2007.
- J. Shen, “Cucker-Smale flocking under hierarchical leadership,” SIAM Journal on Applied Mathematics, vol. 68, no. 3, pp. 694–719, 2007.
- S. Y. Ha and J. G. Liu, “A simple proof of the Cucker-Smale flocking dynamics and mean-field limit,” Communications in Mathematical Sciences, vol. 7, no. 2, pp. 297–325, 2009.
- S. Y. Ha, T. Ha, and J. H. Kim, “Emergent behavior of a Cucker-Smale type particle model with nonlinear velocity couplings,” IEEE Transactions on Automatic Control, vol. 55, no. 7, pp. 1679–1683, 2010.
- J. Park, H. J. Kim, and S. Y. Ha, “Cucker-Smale flocking with inter-particle bonding forces,” IEEE Transactions on Automatic Control, vol. 55, no. 11, pp. 2617–2623, 2010.
- L. Perea, G. Gómez, and P. Elosegui, “Extension of the Cucker-Smale control law to space flight formations,” Journal of Guidance, Control, and Dynamics, vol. 32, no. 2, pp. 526–536, 2009.
- F. Cucker and J. G. Dong, “Avoiding collisions in flocks,” IEEE Transactions on Automatic Control, vol. 55, no. 5, pp. 1238–1243, 2010.
- V. Gazi and K. M. Passino, “Stability analysis of swarms,” IEEE Transactions on Automatic Control, vol. 48, no. 4, pp. 692–697, 2003.
- V. Gazi and K. M. Passino, “A class of attractions/repulsion functions for stable swarm aggregations,” International Journal of Control, vol. 77, no. 18, pp. 1567–1579, 2004.
- H. K. Khalil, Nonlinear Systems, Prentice Hall, Englewood Cliffs, NJ, USA, 3rd edition, 2002.