Intelligent Controllers for Multirobot Competitive and Dynamic Tracking

This paper focuses on the problem of target tracking using 𝑘 fittest robots in a group of 𝑛 mobile robots with 𝑛 > 𝑘 . We present centralized and distributed coordination models with all-to-all and limited communications, respectively. For the case of all-to-all communication between robots, theoretical analysis is presented to prove the exponential stability of the whole system. In real applications of robotic networks, a robot may only be allowed to exchange information with a limited number of neighbors. In such a limited communication case where centralized quantity is not available, a consensus filter is used to estimate the centralized quantities in a distributed way, and a distributed competitive target tracking is thus achieved. The stability of the distributed control is also proved in theory. Finally, illustrative examples are provided and analyzed to substantiate the efficacy of the proposed models for tracking moving target in a competition manner with all-to-all communications and limited communications.


Introduction
The competition and cooperation behaviors of living beings, such as swarms of ants, shoals of fish, or even the troops in military, have certain advantages, including avoiding predators, increasing the chance of finding food, saving energy, and so on.For example, for a joint vigilance task in military, all soldiers should keep unmoved and the one who finds an invader should track the invader closely.Such a behavior can be deemed as a coordination based on the competition, where the soldier who finds the invader is the "winner" and wins the opportunity to do the tracking task while the rest ones are the "losers" and keep unmoved to do the vigilance.
Deemed as a modeling of cooperation, consensus algorithms estimate the related weights or states by mitigating differences among multiple agents in a group and have been applied to many computation problems depicted in distributed manner, such as multiagent systems [1][2][3], consensus for multiple robots [4], distributed environmental modeling [5].Despite the achieved success, consensus essentially lacks a mechanism to model competition behaviors in a distributed network, which desires the increase of peer differences and the enhancement of contrasts [6].
Research in many fields observes and confirms the fact that the competition is equally important as the cooperation for complex systems [6][7][8].Therefore, various schemes and models have been proposed, investigated, and applied to describe and model the competition.Among them, the -winners-take-all (-WTA) models, which identify the  largest of  competitors with  > , are a typical approach to capture competitive behaviors.In addition, the -WTA degrades to the famous winner-take-all (WTA) process for  = 1 [9][10][11][12][13].It is proven in [9] that a two-layered network aided with WTA is able to approximate any nonlinear 2 Complexity mapping in arbitrary accuracy.In addition, it is proven in [11] that a -WTA problem can be equivalently converted to a constrained convex quadratic programming (QP) optimization formulation, which enriches significantly techniques for solving -WTA problems.Thanks to the advantages of intelligent computing and universal approximation, neural networks have been widely investigated in numerous areas [14][15][16][17][18][19][20].For example, an adaptive control approach based on neural network is constructed to stabilize a class of nonlinear discrete-time systems with unknown functions and unknown control direction, in which the neural networks are exploited to approximate the unknown function [18].Being designed for solving QP problems, dual neural networks are constructed in [16] and applied to solving the redundancy resolution of kinematically redundant manipulators, which utilizes the corresponding dual variables.Dual neural networks are then further exploited to solving -WTA problems in [10,12,13].The -WTA problem is modeled as a convex QP problem and then solved by an elaborately constructed dual neural network in [10].By following the same problem formulation, the model in [10] is simplified and modified in [12] by tailoring the structure and taking advantage of the nonlinearity provided by a saturation function used in the model.
Currently, robotics is playing an indispensable role in modern society as well as academic researches and industrial applications [21][22][23][24][25][26][27][28][29][30][31][32][33][34].Yang et al. introduce physical haptic feedback mechanism in robots to result in muscle activity, in order to achieve intuitive human impedance transfer through a designed coupling interface in [21].In addition, multiple mobile robots coordination plays an important role in various fields such as cooperative rescue, antiterrorism and is becoming a hot but tough topic in robotics [23,29,31,35].For example, the internal forces applied on the object for a dual-arm robot are considered in addition to the external forces in [23].The coordination of multiple fixed-base redundant manipulators are investigated in [8] to execute a given task with dynamic task allocation ability.A multiplerobot system can be deemed as a robot group in which the robots can communicate with others and can cooperatively implement different kinds of tasks.A near-optimal tracking control method is presented for wheeled mobile robots in [29], which designs a backstepping kinematic controller to generate desired velocity profiles.The moving target tracking with a group of mobile robots is investigated in [31], which allows each robot in the group has a pan/tilt camera to detect the target and has limited communication capability of communicating with neighbor robots.This is close to what we are investigating but with a major difference that they drive all the mobile robots to track the moving target while only the winners of the mobile robots in this paper can be activated to do the task.
Although some achievements have been earned for the cooperative control of multiple mobile robots, there are still some unsatisfactory aspects with existing solutions.One of the unsatisfactory aspects in the existing achievements is that they can not select the fittest mobile robots in a group to execute the task with the rest ones unmoved.In this paper, we use multiple mobile robots for tracking target in a competition manner, which extends -WTA to the study of complex behavior coordination in a swarm of robots.We first propose a target tracking model with all-to-all communications.Then, a modified model only requiring limited communications among mobile robots is proposed to solve this problem.Theoretical analyses are provided to prove the exponential stability.Both models are validated by computer simulations.
The remainder of this paper is organized into five sections.The preliminary for tracking target via multiple mobile robots in a competition manner is presented in Section 2, which is consisted of the modeling on the mobile robot, the assumptions as well as the theoretical basis for analyzing the proposed models.Then, the coordination model for tracking the moving target with all-to-all communications is designed and analyzed in Section 3. Section 4 uses a distributed consensus filter to estimate centralized quantities, and then embeds it into the distributed coordination based model with limited communications with theoretical analyses on convergence speed and stability presented.Section 5 provides illustrative simulation examples to substantiate the efficacy and superiority of the proposed models for tracking target via multiple mobile robots in the situations of all-to-all communications and limited communications.Section 6 concludes the paper with final remarks.

Preliminary and Problem Formulation
This section presents the preliminary and the model of the robot.

Preliminary.
In the ensuing sections, the coordination models for multiple mobile robots will be viewed as singularly perturbed systems.Therefore, for investigating the convergence speed and stability of these models, the following theoretical basis on a singularly perturbed system is presented as a preliminary, which will be utilized in the ensuing proofs of Theorems 3 and 4.
(3) The functions , ,  and their partial derivatives up to the second order are bounded for  − () ∈   .
2 : vector composed of 2 elements with each one being 1.

Differential-Driven Robot.
The differential-driven-wheeled mobile robot (Figure 1) is equipped with two step motors for movement, Bluetooth module for communication, and an on-board microprocessor for programming and control.The kinematic model of the th differential-driven-wheeled mobile robot is formulated as With the aid of feedback linearization technique presented in [37], we have The motion of the th robot is 2.4.Problem Definitions.In this part, problem definitions are presented as follows.
Problem 1 (centralized competitive tracking).With all-toall communications, construct a model for  mobile robots described by (5) to allocate the task to the fittest robots such that the  mobile robots with the minimum distance from the moving target stay active to execute the task while the others keep unmoved.
Problem 2 (distributed competitive tracking).With limited communications, design a model to achieve the same goal as presented in Problem 1.

Competitive Tracking with All-to-All Communications
This section presents a centralized competition control law for tracking the moving target with all-to-all communications.

Model Design.
The neural network model presented in [12] for generating -WTA competition is formulated as Require: Position  of all mobile robots, position  t and velocity ṗ t of the moving target are all available to the th mobile robot, a preset distance tolerant  Ensure: The  mobile robots with the minimum distance from the moving target approach the latter and the rest ones keep unmoved 1: Initialize variable  2: repeat 3: Get   ,  t , ṗ where V  is the th element of V;   stands for the th element of  ∈ {0, 1}  ;  > 0 satisfies  ≤ 0.5(V  − V +1 );  Ω (⋅) is defined as The above neural network model is globally asymptotically stable for solving the -WTA problem [12]: In addition, the control for the th mobile robot is defined as It can be obtained from (10) that the th mobile robot is unmoved for   = 0 and that the th mobile robot approaches to the moving target exponentially for   = 1.Substituting ( 7) into (6) generates where In addition, the coordination model for tracking the moving target can be formulated into a compact form:  As illustrated in Figure 2, the proposed centralized coordination model consists of two parts: the -WTA part (as shown in the dashed rectangle in the figure) and the controller part.The -WTA part collects inputs from the robots (e.g.,   ), and inputs from the moving target (i.e.,  t ) and outputs   , which is feeded into the controller (10).Then, the control input ṗ  to the mobile robot is yielded.The diagram illustrates the interplay between the mobile robot, the moving target and the coordination model.In addition, procedures of the proposed centralized coordination model with all-to-all communications are stated in Algorithm 1.The th mobile robot first collects its position   , the position  t and velocity ṗ t of the moving target (Line 3), and collects position of all the other robots by communication (Line 4).After this, ṗ  is calculated using (11) and then drive the mobile robot using ṗ  .Lines 3, 4, 5, and 6 are repeated in sequence until the preset distance tolerance is achieved.
In addition, we have the following theorem for the proposed centralized coordination model (12) for competitive tracking.
eorem .There exists  * > 0 ∈ R such that, for all  >  * , for a group of  differential-driven robots described by (5) with the coordination control law (12),  robots with the minimum distance move towards the target at an exponential speed.
Proof.The proof involves two aspects.(1) The equilibrium point of system ( 12) is identical to the solution of Problem 1. (2) System ( 12) exponentially converges to its equilibrium point.
For aspect (1), it is evident that the equilibrium point of system (12) corresponds to the  mobile robots with minimum initial distance from the moving target capturing the latter.That is, the equilibrium point of system ( 12) is identical to the solution of Problem 1.
For aspect (2), the centralized coordination model ( 12) can be rewritten as of which the equilibrium point is ( * ,  * ).Evidently, the above system is a special case of singularly perturbed system (1).Therefore, the stability of the equilibrium point is evaluated via Lemma 1.
Based on the above aspects (1) and (2), there exists  * > 0 ∈ R such that, for all  >  * , for a group of  differentialdriven robots described by (5) with the coordination control law (12),  robots with the minimum distance move towards the target at an exponential speed.The proof is thus complete.

Distributed Competitive Tracking with Limited Communications
We have developed centralized model (12) for competitive target tracking in the previous section, which requires allto-all communications.Aiming at reducing communication burdens, in this section, we develop a fully distributed model, which only requires limited communications.Equation (11) indicates that only ∑  =1  Ω ( + V  /(2)) requires the global information in the team, which can be deemed as the obstacle to achieving the goal of distributed coordination control.We use consensus filter to estimate it in a distributed manner.With consensus filter, a robot is able to estimate the average of filter inputs by running the following protocol [38]: where L() is the communication neighbor set of the th mobile robot;   and   are maintained by the th mobile robot;   > 0 for  ∈ L() with   =   ;  > 0 is used to scale the convergence rate.In addition, for  ∉ L(),   =   = 0.By running (17) on all the mobile robots involved,   converges to the average of inputs, i.e., ∑  =1   / or ∑  =1  Ω ( + V  /(2))/.Thus, by using consensus filter (17) to estimate ∑  =1  Ω ( + V  /(2)), we further have Complexity

Require:
Position  of itself and mobile robot(s)  ∈ L(), position  t and velocity ṗ t of the moving target are available to the th mobile robot, a preset distance tolerant  Ensure: The  mobile robots with the minimum distance from the moving target approach the latter and the rest ones keep unmoved which can be written into a compact form: where  0 denotes the initial time instant;  = diag(  ) −  with diag(  ) being a diagonal matrix.As illustrated in Figure 3, the proposed distributed coordination model consists of three parts: the -WTA part and the distributed consensus filter part (as shown in the dashed rectangle in the figure) and the controller part.In addition to the information from the moving target and the th mobile robot itself, this model also requires   and   , which originate from the distributed consensus filter part of mobile robot(s)  ∈ L().Moreover, the procedures of the proposed distributed coordination model with limited communications is stated in Algorithm 2. The difference of Algorithms 1 and 2 lies in that a consensus filter is used to estimate   in a distributed way in Algorithm 2. Distributed coordination control law (19) can be deemed as a cascaded system, where parameter  is the gain of the outer loop (i.e., the -WTA neural network model) to output the winners while  scales the convergence rate of the inner loop (i.e., the consensus filter) for estimating ∑  =1   /.Intuitively, it is necessary to choose the value of  larger than the value of  such that the inner loop converges much faster to obtain a stable system.We have the following theorem to reveal such a conclusion.eorem .There exists  * > 0 ∈ R and  * > 0 ∈ R such that, for all  >  * >  >  * , for a group of  differentialdriven robots described by (5) with the distributed coordination control law (19),  robots with the minimum distance move towards the target at an exponential speed.
Proof.The proof involves two aspects.(1) The equilibrium point of system ( 12) is identical to the solution of Problem 2. (2) System (12) exponentially converges to its equilibrium point.
For aspect (1), it can be obtained from the proof of Theorem 3 and is thus omitted here.
For aspect (2), the distributed coordination model (19) can be rewritten as ṗ =  (, , , ) of which the equilibrium point is ( * ,  * ), with β = [ ż , ζ /] T .Evidently, system (20) and its subsystem shown as follows are special cases of singularly perturbed system (1): of which the equilibrium point is ( * ,  * ).Then, the proof is divided into the following two steps: (1) the stability and convergence of subsystem ( 21) is evaluated via Lemma 1; (2) the stability and convergence of system ( 20) is evaluated via Lemma 1 based on theoretical results in Step 1.
Step 2 (the stability and convergence of system ( 20)).By following the similar procedures as those in Theorem 3 and the above Step 1 and based on the theoretical results therein, one can derive the conclusion that there exists  * > 0 ∈ R and  * > 0 ∈ R such that, for all  >  * >  >  * , the equilibrium of system ( 19) is exponentially stable.
Based on the above aspects (1) and (2), there exists  * > 0 ∈ R and  * > 0 ∈ R such that, for all  >  * >  >  * , for a group of  differential-driven robots described by (5) with the distributed coordination control law (19),  robots with the minimum distance move towards the target at an exponential speed.The proof is thus complete.
For the distributed coordination model (19) for competitive target tracking via multiple mobile robots, the core idea is to use the distributed consensus filter to estimate the centralized quantity in Algorithm 1 and use the estimated value to replace the actual centralized quantity in the moving target tracking.Theoretical analysis of the convergence and stability of distributed coordination model (19) are presented in Theorem 4, which reveals the key point for a successful competitive target tracking is that the consensus filter should run on a fast enough time scale.
Example 1.In this example, model (12) with all-to-all communications is employed to the task of moving target tracking with  = 2.The corresponding simulation results, which are classified into two phases, are illustrated in Figures 4-6.
Specifically, as shown in Figure 4(a), at  = 0 s, the initial position of the moving target is around (1, 9.5), from which the two nearest mobile robots marked in red lines win the competition.In comparison, the rest ones, as the losers of the competition, are deactivated and unmoved.As a result, the two winners begin to track the moving target.In addition, as visualized in Figure 4(b), at  = 1 s, the target moves to the position around (0.7, 7), followed by the two winner mobile robots marked in red lines.It can be seen from this figure that the two winners approach to the moving target, which means that the tracking task goes well.Moreover, Figure 4(c) illustrates the snapshot at  = 3 s, from which, we can find that the two winner mobile robots have almost achieved the position of the moving target.Besides, the distance tolerant  = 0.01 m means that, during the competitive target tracking process, for the first time that the norm of the distance between a mobile robot and the target is less than 0.01 m, the moving target can be deemed as captured by the mobile robot.The corresponding actual path of the moving target as well as the tracking trajectories are shown in Figure 4(d), from which, we can  12) with all-to-all communications for moving target tracking and the corresponding tracking trajectories, where initial locations of mobile robots and the moving target are randomly generated.In this sense, ten mobile robots compete with each other for tracking the moving target, and only two of them with the minimum distance from the moving target (the winners) are activated to track while the rest ones (the losers) keep unmoved.find that the trajectories of the two winner mobile robots are smooth.In addition, as the losers in the sense of a further distance from the target, the rest mobile robots keep unmoved, which can be deemed as a measure of energy conservation.These simulation results reveal preliminarily the effectiveness of the proposed coordination model (12) with all-to-all communications.
As the continuation of simulation results shown in Figure 4, the simulation results on phase 2 of the target tracking are shown in Figure 5.Initial locations ( ≈ 4 s) of all mobile robots of phase 2 are the same as their finial locations of phase 1 shown in Figure 4(c) and the moving target is randomly placed.At the beginning of phase 2, as illustrated in Figure 5(a), the moving target appears at the location (7.5, 8.5), and the mobile robots marked in red win the competition and are activated.In addition, as visualized in Figure 5(b), at  = 5 s, the target moves to the position (5.5, 5.5) and the two winners are very close to the moving target.Moreover, Figure 4(c) illustrates the snapshot at  = 8 s, where the locations of the two mobile robots (the winners) and the target are nearly at the same position.To see the overall target tracking process more clearly, Figure 5(d) visualizes the actual path of the moving target as well as the tracking trajectories.From the figure, we can find that the trajectories of the two mobile robots (the winners) are smooth and the rest mobile robots keep unmoved.These simulation results verify the effectiveness of the proposed coordination model (12) with all-to-all communications.
To observe the target tracking task in a different perspective, outputs of the -WTA network of the whole process as well as the corresponding velocities of mobile robots at different phases are illustrated in Figure 6.It can be found in Figure 6(a) that, starting with randomly generated initial state, the outputs of the -WTA network rapidly converge to the correct results within 8 × 10 −4 s, and the outputs change rapidly when the target tracking process enters into phase 2. The detailed velocities of the mobile robots in phase 1 and phase 2 are shown in Figures 6(b) and 6(c), respectively.From these two subfigures, it can be observed that the velocities of two mobile robots eventually reach to zero while the rest ones' velocities stay at zero during each phase.These results further verify the effectiveness of the proposed coordination model (12) with all-to-all communications in a different perspective.
Example 2. In this example, the distributed coordination model (19) with limited communications is employed to track the moving target with a single winner, i..e,  = 1.As stated above, we assume that the mobile robots with | − | ≤ 1 have the communications and the rest ones can not communicate with each other for information exchanging.The corresponding simulation results, which are classified into two phases, are illustrated in Figures 7-9 (19) with limited communications for tracking the moving target and the corresponding tracking trajectories, where initial locations of mobile robots and the moving target are randomly generated.In this sense, at each time instant, ten mobile robots compete with each other for tracking the moving target, and only one of them with the minimum distance from the moving target (the winner) is activated to track while the rest ones (the losers) keep unmoved.At  ≈ 0.5 s, as the moving target approaches to one of the losers, the winner at the initial time fails in the competition and becomes a loser marked in black line.As a continuator, the new winner marked in red line begins to track the moving target.Specifically, as shown in Figure 7(a), at  = 0 s, the initial position of the moving target is (5.5, 9), from which the nearest mobile robot at (5.5, 9.5) marked in red lines wins the competition.In comparison, the rest ones, as the losers of the competition, are deactivated and unmoved.As a result, the winner begins to track the moving target.However, as shown in Figure 7(b), as the moving target approaches to one of the losers, the incipient winner loses out at  ≈ 0.5 s (thus is marked in black line in Figure 7(b)).As a result, the new winner marked in red line begins to track the moving target.Moreover, Figure 7(c) illustrates the snapshot at  = 3 s, from which, it can be observed that the mobile robot (the new winner) has almost approached the moving target.Figure 7(d) illustrates the corresponding actual path of the moving target as well as the tracking trajectories, which shows that the trajectories of the two mobile robots (the new winner and the new loser) are smooth.In addition, as the losers, the rest mobile robots keep unmoved.These simulation results verify preliminarily the effectiveness of the proposed distributed coordination model (19) with limited communications.
Simulation results on phase 2 of the target tracking are shown in Figure 8, which is the continuation of the simulation results shown in Figure 7. Initial locations ( ≈ 4 s) of all mobile robots of phase 2 are the same as their final locations of phase 1 shown in Figure 7(c) and the moving target is randomly placed initially.At the beginning of phase 2, as illustrated in Figure 8(a), the moving target is randomly placed at (4.5, 5.5), and the mobile robot marked in red wins the competition and is activated to track the moving target.In addition, Figure 8(b) visualizes that, at  = 5 s, the target moves to the position around (2.5, 3) and the winner is close to the moving target.Moreover, as illustrated in Figure 8(c), the mobile robot (the winner) finally captures the moving target and the task is completed successfully.Figure 8(d) visualizes the actual path of the moving target as well as the tracking trajectories, from which, we can find that the trajectory of the winner is smooth and the rest mobile robots keep unmoved.These simulation results verify the effectiveness of the proposed distributed coordination model (19) with limited communications.
Figure 9 provides a different perspective to observe the target tracking task, which illustrates outputs of the -WTA network of the whole process as well as the corresponding velocities of mobile robots at different phases.It can be found in Figure 9(a) that the outputs of the -WTA network rapidly converge to the correct results within 0.1 s, which is evidently longer than that shown in Figure 6(a) due to the estimation on ∑  =1  Ω (+V  /(2)) via consensus filter (17).The velocities of the mobile robots in phase 1 and phase 2 are shown in Figures 9(b) and 9(c), respectively.From these two subfigures, it can be observed that the velocities of two winner mobile robots eventually reach to zero while the rest ones' velocities remain zero during each phase.These results further verify the effectiveness of the proposed distributed coordination model (19) with limited communications.
Example 3. Simulation results with zero-initial-velocity constraint, as well as bound limits on velocity of mobile robots are shown in Figure 10, with ṗ +  = − ṗ −  = 3/.Specifically, as shown in Figure 10(a), starting with randomly generated initial state, the outputs of the -WTA network rapidly converge to the correct results.The detailed velocities of the mobile robots are shown in Figure 10(b).It can be observed that the velocities of two mobile robots eventually reach to zero while the rest ones' velocities stay at zero.In addition, the velocities are kept within their physical limits as well.Moreover, each winner mobile robot, starting from zero velocity, gradually accelerates its speed to reach the desired velocity.The corresponding actual path of the moving target as well as the tracking trajectories are shown in Figure 10(c), from which, we can find that the trajectories of the two winner mobile robots are smooth.In addition, as the losers in the sense of a further distance from the target, the rest mobile robots keep unmoved, which can be deemed as a measure of energy conservation.

Conclusions
In this paper, we have proposed centralized and distributed coordination models with all-to-all and limited communications, respectively.Simulations based on differential-drivenwheeled mobile robots have been conducted to illustrate the efficacy of the proposed centralized and distributed coordination models for tracking moving target in a competition manner with all-to-all communications and limited communications.

Figure 3 :
Figure 3: Control block diagram for the th mobile robot in the distributed competitive target tracking control via multiple robots in the situation of limited communications, where subscript  ∈ L().

Figure 4 :
Figure 4: (Phase 1) With  = 2, snapshots for centralized model (12) with all-to-all communications for moving target tracking and the corresponding tracking trajectories, where initial locations of mobile robots and the moving target are randomly generated.In this sense, ten mobile robots compete with each other for tracking the moving target, and only two of them with the minimum distance from the moving target (the winners) are activated to track while the rest ones (the losers) keep unmoved.(a) Snapshots at  = 0 s.(b) Snapshots at  = 1 s.(c) Snapshots at  = 3 s.(d) Actual path of the moving target and tracking trajectories of different mobile robots.

Figure 5 : (Phase 2 )
Figure 4: (Phase 1) With  = 2, snapshots for centralized model (12) with all-to-all communications for moving target tracking and the corresponding tracking trajectories, where initial locations of mobile robots and the moving target are randomly generated.In this sense, ten mobile robots compete with each other for tracking the moving target, and only two of them with the minimum distance from the moving target (the winners) are activated to track while the rest ones (the losers) keep unmoved.(a) Snapshots at  = 0 s.(b) Snapshots at  = 1 s.(c) Snapshots at  = 3 s.(d) Actual path of the moving target and tracking trajectories of different mobile robots. .

Figure 6 :
Figure 6: Outputs of -WTA network in centralized model (12) with  = 2 as well as the corresponding velocities of mobile robots at different phases.(a) Outputs of -WTA network with  = 2. (b) Velocities of mobile robots of phase 1. (c) Velocities of mobile robots of phase 2.

Figure 7 :
Figure 7: (Phase 1) With  = 1, snapshots for distributed coordination model(19) with limited communications for tracking the moving target and the corresponding tracking trajectories, where initial locations of mobile robots and the moving target are randomly generated.In this sense, at each time instant, ten mobile robots compete with each other for tracking the moving target, and only one of them with the minimum distance from the moving target (the winner) is activated to track while the rest ones (the losers) keep unmoved.At  ≈ 0.5 s, as the moving target approaches to one of the losers, the winner at the initial time fails in the competition and becomes a loser marked in black line.As a continuator, the new winner marked in red line begins to track the moving target.(a) Snapshots at  = 0 s.(b) Snapshots at  = 1 s.(c) Snapshots at  = 3 s.(d) Tracking trajectories of different mobile robots.
Figure 7: (Phase 1) With  = 1, snapshots for distributed coordination model(19) with limited communications for tracking the moving target and the corresponding tracking trajectories, where initial locations of mobile robots and the moving target are randomly generated.In this sense, at each time instant, ten mobile robots compete with each other for tracking the moving target, and only one of them with the minimum distance from the moving target (the winner) is activated to track while the rest ones (the losers) keep unmoved.At  ≈ 0.5 s, as the moving target approaches to one of the losers, the winner at the initial time fails in the competition and becomes a loser marked in black line.As a continuator, the new winner marked in red line begins to track the moving target.(a) Snapshots at  = 0 s.(b) Snapshots at  = 1 s.(c) Snapshots at  = 3 s.(d) Tracking trajectories of different mobile robots.

Figure 8 : (Phase 2 )Figure 9 :
Figure 8: (Phase 2) As the continuation of simulation results shown in Figure 7, this figure shows the tracking trajectory and snapshots for the distributed coordination model (19) with limited communications for tracking the moving target and initial locations of mobile robots being the same as those in Figure 7(c) and the initial location of moving target being generated randomly.Ten mobile robots compete with each other for tracking the moving target, and only the one with the minimum distance from the moving target is activated to track while the rest ones (the losers) keep unmoved.(a) The snapshot at  ≈ 4.1 s.(b) The snapshot at  = 5 s.(c) The snapshot at  = 8 s.(d) Tracking trajectories of different mobile robots.

Figure 10 :
Figure 10: Performance of -WTA network in distributed coordination model with  = 2, zero-initial-velocity constraint, as well as bound limits on velocity of mobile robots.(a) Outputs of -WTA network with  = 2. (b) Velocities of mobile robots.(c) Tracking trajectories of different mobile robots.