Research Article | Open Access

Hong Shi, Guangming Xie, "Collective Dynamics of Swarms with a New Attraction/Repulsion Function", *Mathematical Problems in Engineering*, vol. 2011, Article ID 735248, 13 pages, 2011. https://doi.org/10.1155/2011/735248

# Collective Dynamics of Swarms with a New Attraction/Repulsion Function

**Academic Editor:**Jitao Sun

#### Abstract

We specify an â€śindividual-basedâ€ť continuous-time model for swarm aggregation in -dimensional Euclidean space. We show that the swarm is completely stable, and the center of the swarm is stationary. Numerical simulations indicate that the individuals will form a stable and cohesive swarm, and under the attraction/repulsion function, the bound of the swarm size will increase as the number of individuals increases.

#### 1. Introduction

Swarming is one of the most common and interesting phenomena in the biological world. Many organisms ranging from simple bacteria to advanced mammals gather together for one reason or another. Many biological theories have proved that such cooperative behavior has certain advantages such as increasing the chance of finding food [1], avoiding predators, and constructing nests. For example, Krause and Ruxton [2], and Couzin and Krause [3] showed that schools of fishes, flocks of birds, and some other vertebrates behave collectively in order to survive in nature. Even cooperative behaviors can be found in the bacteria colony [4]. In one word, the swarming behavior increases the average success of survival in the biological world. This phenomenon has been studied for many decades by biologists. In the recent years, more and more mathematicians and physicists study this phenomenon from the aspects of mathematical modeling [5, 6]. The increasing research concentration on the swarming behavior results from its developing use in engineering fields, such as coordination, distributed cooperative control, and learning strategies for autonomous multiagent systems such as autonomous multirobot applications and unmanned undersea, land, or air vehicles.

Many aspects can be concerned for modeling swarm behaviors [7â€“24], such as the mechanism of information transfer between groups and the synergetic process when preying food as a whole. How information is transmitted within a swarm; how an individual in a swarm can locate itself and find its right place to stay; and whether individuals in a swarm can combine together as a whole and keep it stable. Our work is mainly based on the note [9], in which the author developed a simple model for swarm aggregations based on interindividual attraction/repulsion interactions and showed that the swarm would get cohesive in finite time with a constant bound size, regardless of the number of individuals in the swarm. In [9], the authors technically specified an attraction/repulsion function which ensures each individual not to move away from the whole swarm. Furthermore, they amended their model in [10], introduced the environment factor, and showed that the swarm would avoid unfavorable one.

In this paper, we introduce an adjusted attraction/repulsion function. The function in this paper works better in modeling the behaviors of swarm because it is more similar to the swarm in nature. The function indicates that the repulsion increases to infinite as the distance between two individuals in the swarm decreases to zero, and the attraction decreases to zero as the distance increases to infinite. However, for the attraction/repulsion function in [9], the attraction increases to infinite as the distance between two individuals in the swarm increases to infinite, and the repulsion is bounded as the distance decreases to zero. Furthermore, numerical simulations show that the bound of the size of the ultimately stable swarm will increase as the number of individuals in the swarm increases, whereas the increasing rate will decrease.

#### 2. Model of a Swarm with New Attraction/Repulsion Function

We consider a swarm of individuals (members) in an -dimensional Euclidean space. We model the individuals as points and ignore their dimensions and assume that they can change their directions arbitrarily if necessary with no time delays. We assume synchronous motion and no time delays, that is, all the members move simultaneously and know the exact positions of all the other members in the swarm, and thus there are no isolated clusters in the swarm. The equation of motion of individual is given by where represents the position of individual ; represents the function of attraction and repulsion between the individuals in the swarm. In other words, the direction and magnitude of motion of each member is determined as a sum of the attraction and repulsion of all the other members on this member. The attraction/repulsion function that we consider is where and are positive constants and is the Euclidean norm given by which is used to represent the distance between two individuals in the swarm.

For the case with and , this function is shown in Figure 1. From Figure 1, it is easy to see that as the distance becomes larger, the interaction between two individuals changes from repulsion (interaction forceâ€‰â€‰>â€‰â€‰0) to attraction (interaction forceâ€‰â€‰<â€‰â€‰0), and the attraction decreases as the distance gets much larger. The asterisk in Figure 1 represents the position where the attraction and the repulsion balance. In higher dimensions (i.e, ), the function is exactly the same as in the one-dimensional case, except that it acts on the line connecting the positions of the two individuals (i.e., the line on which the vector lies).

Note that the function constitutes an artificial social potential function, similar to the one in [9], that governs the interindividual interactions. The term represents the attraction, whereas the term represents the repulsion. Note that this function is attractive (i.e., dominates) for large distances and repulsive (i.e., dominates) for small distances, which is consistent with interindividual attraction/repulsion in biological swarms. Therefore, it constitutes a crude approximation of biological interactions. The main difference between the functions in [9] and in this paper is that the repulsion in our model is unbounded for infinitesimally small arguments; hence, avoidance of collisions between the individuals can be ensured; on the other hand, the attraction approaches zero as any two individuals are far away from each other, which can imitate the real swarm in nature more accurately.

The physical significance of our model is clear. If an individual is close to the others in the swarm, the repulsion dominates, which ensures the individual far away from them enough to be â€śsafeâ€ť. The repulsion increases as any two individuals get closer because in the real nature the individuals are inclined to be more apart away from others if they are nearer. And if an individual is far away from others in the swarm, the attraction dominates, which makes the individual get closer to the other members of the swarm. However, as the distance between the individual and the others gets bigger, this individual will loss more connection to other members of the swarm, and thus, the attraction decreases to zero as the distance increases to infinity. By equating , one can find that switches sign at the set of points defined as . The distance is the distance at which the attraction and the repulsion balance. Hence, if , then the repulsion dominates; if , then the attraction dominates. Also by equating , we can find that the distance is the distance at which the total force of attraction and repulsion begins to decrease. This is because that with the increase of distance, the individual has less connection with other members.

#### 3. Stability Analysis

In this section, we analyze the stability of the system and the final motion behaviors of the swarm members.

*Definition 3.1. *The *center* of the swarm members is defined as

We first prove that because of the symmetry of the attraction/repulsion function , the center is stationary for all , which means that the position of the center is decided by the initial positions of the swarm members. In other words, since is symmetric with respect to the origin, member moves toward every other member exactly the same amount as moves toward [9]. Hence, we have the following theorem.

Theorem 3.2. *The center of the swarm described in (2.1) with an attraction/repulsion function given in (2.2) is stationary for all while the whole swarm moves.*

*Proof. *One can easily see that the function is symmetric, that is, for all . Let . Thus
Therefore, the swarm center is stationary for all .

This theorem shows that the swarm described by the model in (2.1) and (2.2) is not drifting. It means that while the swarm members adjust their relative positions to the others, the whole swarm will not move to another new position.

In the following, we will further investigate the issue whether the swarm members will finally stop their motion or will start an oscillatory motion within certain region. Define the state of the system as the vector of the positions of the swarm members, that is, . Let the invariant set of equilibrium points be

We will prove that as ,â€‰â€‰the state converges to . Namely, the swarm will converge to its equilibrium points. Therefore, the configuration of the swarm members converges to a constant arrangement specified by the set of equilibrium points of the system described in (2.1) and (2.2). We first present the following definition [12].

*Definition 3.3. *The swarm described in (2.1) is *completely stable* if every solution converges to the set of equilibrium point of the system.

Theorem 3.4. *Consider the swarm described by the model in (2.1) with an attraction/repulsion function as given in (2.2). The swarm is completely stable, that is, as , we have .*

*Proof. *Choose the following Lyapunov function:
which is an artificial potential function. Computing the gradient of with respect to yields
Then, taking the time derivative of the Lyapunov function along the motion of the system, we obtain
for all . Thus, using LaSalleâ€™s invariance principle, we can conclude that as , the state converges to the largest invariant subset of the set defined by
Since each point in is an equilibrium, is an invariant set, and this proves the expected result.

The proof of the aforementioned theorem shows the distributed aspect of the swarming behavior. In fact, it shows that the swarm members are performing distributed optimization (function minimization) of a common function (the Lyapunov or cost function) using a distributed gradient method. In other words, each member computes its part of the gradient of the global function at its position (i.e., computes the gradient with respect to its motion variables) and moves along the negative direction of that gradient. The global function in this case is a function of the distances between the members [9].

Note that the complete stability implies global convergence of the swarm system to its equilibrium point set, that is, the configuration of the swarm members converges to a constant arrangement. However, the exact location and the size of this set cannot be known, in general, especially for large number of the swarm members, because the equations for equilibrium points are nonlinear. On the other hand; however, it is naturally expected that the swarm members will aggregate and form a cluster around the center . Hence, in the next section, we will discuss the cohesion of the swarm.

*Remark 3.5. *Note that in any of the above analyses, we did not use the dimension of the state space . Hence, the results obtained hold for any dimension .

*Remark 3.6. *The results here are global. This is a consequence of the definition of the attraction/repulsion function in (2.2) over the entire domain.

#### 4. Analysis of Swarm Cohesion

We define a swarm member called a free agent, as in [9], which means that there is no neighbors in its repulsion range.

*Definition 4.1. *A swarm member is called a *free agent* at time if
where is the set of members of the swarm.

Note that if the distance between a free agent and other members in the swarm is larger than , then there will not be repulsion force on the free agent, and the total force on it will be a combined effect of all the attraction imposed by all the other members. Then we hope that this total force is pointing toward the center of the swarm and that the free agent is moving toward it. To begin the proof of the following theorem, we define the *error vector * as for all .

Theorem 4.2. *Assume that all the members are the free agents in the swarm described by the model in (2.1) with an attraction/repulsion function as given in (2.2) at time . Then, at time , their motions are in the direction of decrease of (i.e., toward the center ).*

*Proof. *Note that the motion of member can be represented as
and because of Theorem 3.2, we can get

Choose the Lyapunov function for the swarm as , where represents half of the distance between member and the swarm center . Then taking the derivative of and by using (4.2) and (4.3), we can obtain
where . Since all the members are the free agents at time , then for all , we can get . Therefore, we have
which completes the proof.

*Remark 4.3. *This theorem is important because it shows the possibility of convergence of the swarm if the original swarm is dispersive. When the members in the swarm are all free agents, the members will aggregate around .

As discussed above, all the members of the swarm will converge to the center and form a cluster around . However, note that the attraction/repulsion function in this paper has infinite repulsion force as ; hence, the agents cannot close unlimitedly.

*Definition 4.4. *The radius of the hyper-ball in which the members finally converge is called a *converging radius*, and

We guess that the radius of the hyper-ball in which the members finally converge will increase as the number of members in the swarm increases. In the next section, we will perform some numerical simulations to illustrate the guess. And the simulation results will show that the converging radius increases as the number of members in the swarm increases, and we will provide an approximate function graph to depict the relationship between the radius and the number of the members.

#### 5. Numerical Simulations of the Swarm with the New Attraction/Repulsion Function

We performed some simulations to illustrate whether our hypothesis is consistent with the simulation results. Figures 2, 3, 4, 5, 6, 7, 8, 9, 10, and 11 show the states of swarm for the different numbers of individuals in the swarm, where the circles represent the initial positions of members and the asterisks represent the positions of the swarm center. We chose the swarm sizes from 10 to 180. From these figures, it is easy to see that the radius of swarm increases gradually as the number of individuals in the swarm increases, and the increasing rate decreases as the number of individuals in the swarm increases. Figure 12 presents the relation between the number of individuals in the swarm and the converging radius of the swarm, the increasing trend also clearly indicates that the new attraction/repulsion function works well. All the simulation results strongly support the hypothesis before.

#### 6. Concluding Remarks

In this paper, we developed a model of swarm with a new attraction/repulsion function. We analyzed the stability of the swarm system and the aggregation characteristic of the swarm and illustrated by numerical simulations that the radius of the swarm will increase as the number of individuals in the swarm increases. The simulation results presented the approximate relationship between the number of individuals and the swarm radius. This model can be used in studying how individuals forage and chase food in groups. And furthermore, this model can be extended to other more complicated cases in a group that are considered in [10â€“15]. The following two questions can be further studied: the precise analytic relationship between the number of individuals in a swarm and the radius of the swarm; the motion behaviors within multiple swarms using the attraction/repulsion function provided in this paper.

#### References

- D. W. Stephens and J. R. Krebs,
*Foraging Theory*, Princeton University Press, Princeton, NJ, USA, 1986. - J. Krause and G. Ruxton,
*Living in Groups*, Oxford University Press, Oxford, UK, 2002. - I. D. Couzin and J. Krause, â€śSelf-organization and collective behavior in vertebrates,â€ť
*Advances in the Study of Behavior*, vol. 32, pp. 1â€“75, 2003. View at: Publisher Site | Google Scholar - K. M. Passino, â€śBiomimicry of bacterial foraging for distributed optimization and control,â€ť
*IEEE Control Systems Magazine*, vol. 22, no. 3, pp. 52â€“67, 2002. View at: Publisher Site | Google Scholar - E. Boabeau, M. Dorigo, and G. Theraulaz,
*Swarm Intelligence: From Natural to Artificial Systems*, Oxford University Press, Oxford, UK, 1999. - A. Czirók and T. Vicsek, â€śCollective behavior of interacting self-propelled particles,â€ť
*Physica A: Statistical Mechanics and its Applications*, vol. 281, no. 1, pp. 17â€“29, 2000. View at: Publisher Site | Google Scholar - I. D. Couzin, J. Krause, N. R. Franks, and S. A. Levin, â€śEffective leadership and decision-making in animal groups on the move,â€ť
*Nature*, vol. 433, no. 7025, pp. 513â€“516, 2005. View at: Publisher Site | Google Scholar - G. Grégoire, H. Chaté, and Y. Tu, â€śMoving and staying together without a leader,â€ť
*Physica D. Nonlinear Phenomena*, vol. 181, no. 3-4, pp. 157â€“170, 2003. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - V. Gazi and K. M. Passino, â€śStability analysis of swarms,â€ť
*IEEE Transactions on Automatic Control*, vol. 48, no. 4, pp. 692â€“697, 2003. View at: Publisher Site | Google Scholar | MathSciNet - V. Gazi and K. M. Passino, â€śStability analysis of social foraging swarms,â€ť
*IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics*, vol. 34, no. 1, pp. 539â€“557, 2004. View at: Publisher Site | Google Scholar - 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. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - T. Chu, L. Wang, T. Chen, and S. Mu, â€śComplex emergent dynamics of anisotropic swarms: convergence vs oscillation,â€ť
*Chaos, Solitons and Fractals*, vol. 30, no. 4, pp. 875â€“885, 2006. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - L. Wang, H. Shi, T. Chu, W. Zhang, and L. Zhang, â€śAggregation of foraging swarms,â€ť in
*Lecture Notes in Artificial Intelligence*, vol. 3339, pp. 766â€“777, Springer, Berlin, Germany, 2004. View at: Publisher Site | Google Scholar - H. Shi, L. Wang, T. Chu, and F. Xiao, â€śSelf-organization of general multi-agent systems with complex interactions,â€ť in
*Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '06)*, pp. 3203â€“3208, October 2006. View at: Publisher Site | Google Scholar - H. Shi, L. Wang, T. Chu, and M. Xu, â€śCollective dynamic behavior of anisotropic foraging swarms,â€ť in
*Proceedings of the American Control Conference (ACC '07)*, pp. 2563â€“2568, July 2007. View at: Publisher Site | Google Scholar - B. Liu, T. G. Chu, L. Wang, and Z. F. Wang, â€śSwarm dynamics of a group of mobile autonomous agents,â€ť
*Chinese Physics Letters*, vol. 22, no. 1, pp. 254â€“257, 2005. View at: Publisher Site | Google Scholar - 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. View at: Publisher Site | Google Scholar | MathSciNet - 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. View at: Publisher Site | Google Scholar | MathSciNet - H. Shi, L. Wang, and T. Chu, â€śVirtual leader approach to coordinated control of multiple mobile agents with asymmetric interactions,â€ť
*Physica D. Nonlinear Phenomena*, vol. 213, no. 1, pp. 51â€“65, 2006. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - Y. Hong, J. Hu, and L. Gao, â€śTracking control for multi-agent consensus with an active leader and variable topology,â€ť
*Automatica*, vol. 42, no. 7, pp. 1177â€“1182, 2006. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - H. Shi, L. Wang, and T. Chu, â€śFlocking of multi-agent systems with a dynamic virtual leader,â€ť
*International Journal of Control*, vol. 82, no. 1, pp. 43â€“58, 2009. View at: Publisher Site | Google Scholar | Zentralblatt MATH - G. Xie and L. Wang, â€śMoving formation convergence of a group of mobile robots via decentralised information feedback,â€ť
*International Journal of Systems Science*, vol. 40, no. 10, pp. 1019â€“1027, 2009. View at: Publisher Site | Google Scholar | Zentralblatt MATH - G. Xie and L. Wang, â€śConsensus control for a class of networks of dynamic agents,â€ť
*International Journal of Robust and Nonlinear Control*, vol. 17, no. 10-11, pp. 941â€“959, 2007. View at: Publisher Site | Google Scholar - F. Xiao and L. Wang, â€śAsynchronous consensus in continuous-time multi-agent systems with switching topology and time-varying delays,â€ť
*IEEE Transactions on Automatic Control*, vol. 53, no. 8, pp. 1804â€“1816, 2008. View at: Publisher Site | Google Scholar

#### Copyright

Copyright © 2011 Hong Shi and Guangming Xie. 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.