Distributed Circumnavigation Control with Dynamic Spacings for a Heterogeneous Multi-robot System

05/14/2018 ∙ by Weijia Yao, et al. ∙ 0

Circumnavigation control is useful in real-world applications such as entrapping a hostile target. In this paper, we consider a heterogeneous multi-robot system where robots have different physical properties, such as maximum movement speeds. Instead of equal-spacings, dynamic spacings according to robots' properties, which are termed utilities in this paper, will be more desirable in a scenario such as target entrapment. A distributed circumnavigation control algorithm based on utilities is proposed for any number of mobile robots from random 3D positions to circumnavigate a target. The dynamic spacings are subject to the variation of robots' utilities. The robots can only obtain the angular positions and utilities of their two neighbouring robots, so the control law is distributed. Theoretical analysis and experimental results are provided to prove the stability and effectiveness of the proposed control algorithm.



There are no comments yet.


page 13

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

One of the most prominent research topics on distributed multi-robot system is the formation control problem. Significant efforts have been made on the circular formation control and circumnavigation control problems. In circular formation control problem, robots remain in their positions after the formation is generated, while in circumnavigation control problem, they still encircle around the target. In this sense, circular formation control could be regarded as a special case of circumnavigation control when the circumnavigation speed equals to zero.

There are already many studies on circumnavigation control (or circular formation control) problems. Most of the existing studies only consider the case where robots are distributed evenly on the formation (i.e., equal spacing), such as [4, 8, 15, 17, 9, 16]. In addition, the control algorithms proposed in these studies are only applicable on the 2D plane. Nevertheless, [1] proposes algorithms which are still effective in 3D space. The formation spacing, however, is fixed and equal. Although this is effective for a homogeneous multi-robot system, it may not be sufficient for a heterogeneous one where robots have different properties, such as maximum movement speeds. [10] and [11] propose a distributed control law for a multi-robot system to form a circular formation with any desired spacing among robots. However, it assumes that the robots are placed initially on a prescribed circle and the control algorithm is not applicable in the 3D space. Another major disadvantage is that the desired spacing, which is a global quantity, should be specified for each robot beforehand. If the specified spacing does not sum up to , or if robots are informed of inconsistent specified spacing, they will form an erroneous formation. Moreover, to the best of our knowledge, there are no studies concerning dynamic spacing for a heterogeneous multi-robot system.

In this study, we suppose that mobile robots are heterogeneous in terms of their kinematics abilities, such as maximum locomotion speeds, etc. In a scenario where these mobile robots need to entrap a hostile target, their inter-robot spacing should be different for better performance; those robots with lower mobility are supposed to gather together with smaller spacing than those with higher mobility, so the probability for the target to flee away from the formation is lower. We also consider the deterioration of individual performance due to physical worn-out or damage. Therefore, their spacing should be varied in a dynamic way during the circumnavigation process. Based on this, the goal of this paper is to propose a new distributed circumnavigation control algorithm which is able to control a group of heterogeneous mobile robots from any initial positions to circumnavigate a target with dynamic spacing in the 3D space.

The main contribution of this work is twofold. First, this paper proposes the concept of utility and formation guideline. Based on these two new concepts, we design a distributed circumnavigation control algorithm which enables robots to adjust their spacing dynamically according to the local variations of their utilities; a pre-specified desired spacing is not necessary (but it is necessary for studies such as [1, 10, 11]). The control algorithm is distributed and applicable for a heterogeneous multi-robot system of arbitrary size. Second, the distributed control algorithm does not require robots to be placed initially on a prescribed circular trajectory (but it is required in [10, 11]). Their initial positions can be arbitrarily chosen in the 3D space rather than being restricted on a 2D plane (which is the case in [10, 11]). In addition, the control algorithm can respond effectively to the situation where robots quit or join the circumnavigation process (but it is not studied in much literature such as [4, 9, 10, 11]).

The remainder of this paper is organized as follows. Section 2 introduces the circumnavigation control problem based on utilities and derives its corresponding mathematical formulation. Section 3 proposes the circumnavigation control algorithm. In section 4, simulation and real-robot experiments are performed and results are analysed. Finally, section 5 concludes the paper and summarizes the future work.

Figure 1: The body reference frame with the target as the origin.
Figure 2: Robots’ projections and the target on the plane.
Figure 3: The interpretation of the formation guideline.

2 Problem Formulation

The research question is that a group of mobile robots, denoted by , encircle a target in 3D space with dynamic spacing on a circular formation. Note that is only used to represent the th robot for convenience of narration; it does not correspond to any physical quantities. Suppose each mobile robot is modelled by a 3D kinematic point:


where is the control input to the robot and is its position in the world reference frame . In this problem, robots are required to maintain on the same plane with the encircled target which is modelled by another kinematic point. Therefore, a (target) body reference frame centred at the target is introduced (see Fig. 3). In addition, the cylindrical coordinate system is preferred to the commonly used Cartesian coordinate system since the former itself embodies three elements of interest: the distance between the projection of the robot on the plane to the target (), the height relative to the plane () and the angle between the -axis and the line joining the projection of the robot on the plane with the target (). The cylindrical coordinates for is denoted by (see Fig. 1

). To relate the cylindrical coordinates with the Cartesian coordinates, a vector function is defined as

where is a generic vector with components . , and . Note that . The Jacobian matrix of the vector function will be used later, which is For better analysis, we label the robots in the counter-clockwise direction according to their initial (angular) positions () in as shown in Fig. 3. Note that the subscript and represent the indices of the neighboring robots of in the clockwise and counter-clockwise direction respectively. Especially, if , , and if , . represents the difference between the angular positions of and that of . In particular,


Also note that


Before giving the definition of the circumnavigation problem with dynamic spacing, we propose the concept of utility. Let denote the field of non-negative real numbers.

Definition 1 (Utility)

In a heterogeneous multi-robot system, given different kinds of robots, a robot’s utility is determined by a given criterion (such as its maximum movement speed). The utility reflects the weight of the robot in the circumnavigation process at time .

For example, suppose a robot’s maximum movement speed is the criterion. Let , where is the maximum movement speed of and is the possible greatest movement speed in the heterogeneous multi-robot system. Then . When , the robot cannot continue the circumnavigation process with other robots. In this case, its neighboring robots will neglect its role in the circumnavigation process. will increase or decrease due to the enhancement or damage of the robot’s locomotion capabilities. To explain directly how utilities are utilized to enable dynamic spacing among robots, we simply regard the utility of a robot to be proportional to its maximum movement speed. For simplicity of writing, the symbol is neglected from unless it causes confusion. The circumnavigation control problem based on utilities is defined as follows:

Definition 2 (Circumnavigation Control Problem Based on Utilities)

In a heterogeneous multi-robot system composed of mobile robots, each of the robot’s dynamics are modelled by (1). Suppose is a smooth function of time and the utilities of robots, which maps utilities to the final holistic formation spacing. Assume exists, the circumnavigation control problem based on utilities is to seek control laws satisfying the following asymptotic conditions:


for . Here, , , and . , and denote the circumnavigation radius, the angular speed and the circumnavigation height respectively.

In this paper, it is required that all robots and the target remain in the same plane in the end. Therefore, the default value of is 0. However, can be different for different robots.

Equation (5) manifests that the final formation spacing is not specified manually as proposed in [10] or [14], but instead, it is determined by the function, which will be referred to as function for simplicity. Note that function depends on the utilities of other robots instead of calculating by each robot alone. The advantage of eliciting the function is that the spacing among robots can be dynamically adjusted corresponding to the variations of robots’ utilities.

The expression of the function is determined by a formation guideline. It is proposed under specific physics background representing the relationship between the utilities of robots and the final formation spacing. In this paper, we suppose that multiple heterogeneous robots circumnavigate a target and try to prevent it from fleeing. In Fig. 3, four robots rotate around a target denoted by . Suppose that the target is intelligent enough to determine the best fleeing points denoted by , , and in the figure. Obviously, the best fleeing points are related to the utility (i.e., the maximum movement speeds) of robots. The position of , for instance, is calculated by . We also suppose that the probability of capturing the target by a robot is inversely proportional to the time spent on moving from its initial position along the circular trajectory at its maximum speed to the best fleeing point. Therefore, the formation guideline can be defined as

Formation Guideline 1

In the final circumnavigation formation formed by robots, when the target tries to escape via any of the best fleeing point, the two robots adjacent to the best fleeing point have the same probability of capturing the target.

To understand the above formation guideline, taking Fig. 3 for example, it means the travelling time for and to arrive at the best fleeing point along the circular trajectory at their maximum speeds (i.e., and resp.) is the same, or the travelling time for to arrive at or along the circular trajectory at its maximum speed (i.e., ) is identical, and hence, the probability of capturing the target is equal. Following this, it can be derived that for , According to this equation, the relationship between the final desired formation spacing and the utilities is Therefore, given , the formation spacing can be determined, and the function is expressed as follows:


Similarly, another formation guideline can be defined as follows:

Formation Guideline 2

In the final circumnavigation formation formed by robots, the spacing among robots is proportional to their utilities.

Formation Guideline 2 can be interpreted in this way: as the utility of a robot increases, its complementary effects on its neighboring robots increase, and therefore the spacing between them should be increased. Taking Fig. 3 for example, the formation guideline indicates that, for , Accordingly, given , the final desired formation spacing is determined. Hence the function is

Remark 1

Note that formation guidelines only reflect the relationship between the utilities of robots and the final formation spacing; it does not determine the utilities of robots.

3 Utility-based Circumnavigation Control Algorithm

First we define a rotational matrix , which is the representation of the body reference frame with respect to the world reference frame . Therefore, the following equation calculates the cylindrical coordinates of in the frame : where and are the Cartesian coordinates of and the target in the frame respectively. Then the derivative of is the dynamics of robots in the cylindrical coordinates, which is where is the Jacobian matrix as shown in Section 2, i.e. . Note that as long as . This means is invertible as long as the distance between and the target is non-zero. This condition can always be guaranteed since the initial positions of the robots and the target do not coincide, and by designing appropriate control algorithms, the distance can be guaranteed to be non-zero all the time. By letting


we can switch our focus to the new control input in the cylindrical coordinates [1]. The advantage of transforming to this control input is that we can control , and separately, which are the three main variables in the circumnavigation problem.

Notations. For positive integers and , and are a set of all -by- and -by- real matrices. If all the entries in a matrix is nonnegative, this matrix is called nonnegative. We denote as the identity matrix. and are vectors of all 1’s or 0’s of suitable dimensions respectively. The underlying directed graph (or digraph) of a nonnegative matrix , denoted by , is the directed graph with the vertex set , such that there is a directed edge in from to if and only if [2]. A directed graph is called strongly connected if for every pair of vertices, there is a directed path between them [5]. The following is a preliminary result related to any strongly connected digraph.

Lemma 1 (Theorem 3 of [7])

Assume is a strongly connected digraph with Laplacian satisfying , and . Then

Theorem 3.1

Consider a multi-robot system with robot dynamics described by (1) and (9), by introducing the control input into (9), where


Note that , and are positive gains, and


where is the utility of the robot and it is piecewise constant. If the function is shown as (8) (Formation Guideline 1), the circumnavigation control problem based on utilities encoded by (4), (5), (6) and (7) can be solved with exponential convergence speed.


It is obvious that (10) and (11) do not rely on the states of other robots, and they are basically P control laws with reference input and 0 respectively. So according to the classical control theory, and will converge exponentially to and 0 respectively.

Since is piecewise constant, it is obvious that exists. We define and , so (12) and (13) can be written into compact forms respectively as follows:


where is shown as (16), and During each time period where is constant, and are constant matrix and vector respectively. Note that matrix

is a row stochastic matrix

[2] and furthermore, it could be considered as the adjacency matrix [5] corresponding to a weighted directed ring denoted by . It can be readily verified that is strongly connected. Next we define the error signal as


where , which is the Laplacian matrix of . Since is constant at each time period, the derivative of is . By substituting (14) and (17) into this equation, we further obtain the error dynamics as


Note that 1

is the right eigenvector associated with the zero eigenvalue of

, so . The solution to (18) is . According to Lemma 1 and also note that only affects the convergence speed but not the convergence value, we have , where and . By substituting (17) into this equation, we obtain the following:


Let and where the entry of is

and . It can be easily verified that and are the left and right eigenvector of the Laplacian matrix associated with the zero eigenvalue respectively, and . Therefore, (19) becomes , which means that the difference between the desired angular position and the actual angular position of each robot vanishes to zero exponentially, or According to (14), the circumnavigation speed of each robot converges to the desired angular speed . In addition, under this condition, is replaced by in (13) and therefore, for robots with indices , the equation further becomes This means a sequence of equations . Assuming , we have . According to (3), it follows that , and hence . Therefore, . So the formation spacing expressed by (5) and (8) can be achieved.

Remark 2

Since (10), (11), (12) and (18) typically admit a linear system, the convergence is global and exponential. In fact, for the convergence of , a Lyapunov function can be defined as , where , so the global and exponential convergence can also be proved using the Lyapunov theorem. In addition, if , (8) becomes , that is, the spacing among robots is equal. Then (13) becomes


Combined with (10), (11) and (12), they can solve circumnavigation problem with equal spacing.

Remark 3

It is interesting to note that when there are only two robots, i.e., , the subscripts of robots satisfy . Equation (13) is simplified to , and (8) becomes . This indicates that the formation spacing is fixed no matter how robots’ utilities change (except 0); these two robots will always position on the ends of the diameter of the circular trajectory. Furthermore, and degrade to and respectively.

Remark 4

In the definition of circumnavigation control problem based on utilities, (5) contains the utilities of all robots. However, it can be seen from (13) that each robot only needs to obtain the utilities of its two neighboring robots. Moreover, it should be noted that robots do not know what the holistic expected formation is; the actual formation (or spacing) among robots adapt dynamically to the variations of the local utilities of neighboring robots. In addition, when a robot joins or leaves the formation, according to (12) and (13), the spacing among robots will adjust dynamically through local update of the utilities of neighboring robots. To sum up, the utility-based circumnavigation control algorithm does not rely on the number of robots, and it is able to dynamically adjust the formation spacing dependent on the change of utilities. The control algorithm is distributed, and in this way, it achieves the global aim described by (5).

Remark 5

When , the robot has quitted from the circumnavigation process, and therefore the communication topology has changed. The change of communication topology means the indices of the neighboring robots alter accordingly. When , for example, the neighboring robots of change from and to and . In this way, the circumnavigation control algorithm based on utilities can well adapt to the cases where there are local variations on utilities or where robots join or quit from the formation. The formation spacing can adjust dynamically based on the selected formation guideline, achieving distributed formation reconfiguration.

Another problem that is worth considering is whether robots preserve their initial orders during the whole circumnavigation process. This means any robot will not overtake or be overtaken by its neighbours, which guarantees that they will not collide with each other if they are regarded as mass points. Before introducing the next theorem, the definition of a Metzler matrix [6] is given. For a real matrix , if all its off-diagonal elements are non-negative, i.e., , is a Metzler matrix.

Theorem 3.2

During the circumnavigation process, robots always keep their initial orders in the formation. In other words, , for .


According to (2), (12) and (13), for , it follows that


where represents , which is the index of the second adjacent robot for the robot in the counter-clockwise direction. Let , then (21) can be rewritten as


where is shown in (22). Therefore, the solution of is Since is a Metlzer matrix, it has been proved that is a non-negative matrix [6]. In addition, due to , it follows that , which means that robots always keep their initial orders in the formation.

Remark 6

The significance of this theorem is that it provides a preliminary result for collision avoidance. In other words, if robots are treated as mass points, then collision will not happen since they always keep their initial orders. For real robots with geometric shape, given sufficiently large spacing, the collision will not happen, but this will need further investigation.

Similarly, with Formation Guideline 2, the circumnavigation control problem based on utilities can also be solved.

4 Experimental Results and Analysis

Although it is claimed that formation guidelines correspond to specific physics backgrounds, in the experiment, we do not try to reproduce the specific scenarios. This is because the emphasis here is the stability of the circumnavigation control algorithm based on utilities, and how the global formation spacing reacts dynamically to the variation of the utilities. In the experiments, robots’ utilities are supposed to be proportional to its maximum movement speed. However, how the utilities are calculated from the maximum movement speeds is not the interest of the study. Instead, the variation of the utilities are manually specified. Readers can think of an increase in the utilities as an update of robots’ locomotion capabilities, while the decrease means the deterioration of performance due to worn-out or damage of robots. The first experiment is a simulation with Simulink and the other is a real-robot experiment using soccer-playing robots.

4.1 Simulation with Simulink

In this simulation, four robots are used and Formation Guideline 2 is adopted. For demonstrating the dynamic change in formation spacing when robots’ utilities vary, the utilities of the robot , and remain 1 throughout the whole circumnavigation process, while the utility of the robot varies according to a piecewise constant function. That is . For convenience, the three time ranges are denoted by Stage 1, 2 and 3 respectively. Note that at Stage 2, the utility of the robot is zero, which means it does not continue the circumnavigation process but retreats to a corner. In this experiment, robots’ initial positions are randomly chosen. Simulation parameters are m, rad/s and .

Figure 4: The simulation with Simulink. (a)-(d) are the circumnavigation process at 4.8 s (Stage 1), 8.9 s (Stage 2), 10.3 s (Stage 3) and 13.4 s (Stage 3) respectively.
Figure 5: The data plots of the simulation. (a)-(c) are the error signals of the circumnavigation process. They are the plots for , and respectively. (d) is the curves of the real spacing and the desired spacing. The red, green, blue and yellow dashed lines are the desired spacing for robots , , and respectively.

The circumnavigation process is illustrated in Fig. 4. The black dot in the center is the target to be encircled. Dashed lines connecting four robots represented by red, green, blue and yellow dots indicate the formation shape and communication topologies intuitively. Dashed lines connecting the target and the robots demonstrate the circumnavigation radii. At Stage 1, four robots form a stable formation and circumnavigate the target (see Fig. 3(a)). Then leaves the formation at Stage 2 (see Fig. 3(b)). At the beginning of Stage 3, joins the formation (see Fig. 3(c)). Note that the communication topologies have changed from Stage 1 to Stage 2 and from Stage 2 to Stage 3. Four robots form a stable formation again with different spacing in comparison with Stage 1 in the end (see Fig. 3(d)).

The data plots of the simulation are shown in Fig. 5. Since quits from the formation during Stage 2, the corresponding data is not plotted. It can be seen from Fig. 5 that although the changes of the utility of lead to the deviation of curves from the expected values, the circumnavigation error signals converge to zero exponentially during the three stages (see Fig. 4(a), Fig. 4(b) and Fig. 4(c) resp.). The spacing among robots changes according to the variation of the utilities. However, the spacing converges to the desired ones at the end of each stage (see Fig. 4(d)). Although the simulation experiment involves only four robots, it should be noted that the control algorithm only utilizes the information of neighboring robots, therefore it can be extended to a system with any number of robots.

Stage Utilities Desired spacing 111 Under Formation Guideline 1, the desired spacing (unit: degree) are calculated according to the robots’ utilities. However, this information is not needed by robots during the circumnavigation process.
Stage 1
Stage 2
Stage 3
Stage 4 222  At this stage, the robot quits from the formation.
Table 1: The utilities and the corresponding spacing at four stages.

4.2 Experiment with Soccer Robots

In this experiment, four soccer-playing robots [12, 13] are used and Formation Guideline 1 is adopted. Since the soccer-playing robots have omnidirectional movement abilities and they can reach any given velocity instantly, their dynamics can be regarded as the first-integrator model given in (1). In addition, an omnidirectional vision system is equipped on each robot with algorithms for self-localization and the recognition of a yellow football [3]. The position and velocity of the robot itself and the position and velocity of the football are obtained by its own omnidirectional vision system. Moreover, robots are only allowed to receive information from its neighboring robots and the information is transmitted using wireless communication.

Figure 6: The real robot experiment. (a) are the initial robot positions; (b)-(e) are positions at 4 s (Stage 1), 19 s (Stage 2), 39 s (Stage 3) and 61 s (Stage 4) respectively.
Figure 7: The data plots of the real robot experiment. (a) and (b) are the error signals of the circumnavigation process. They are the plots for and respectively. (c) is the curves of the real spacing and the desired spacing. The red, green, blue and yellow dashed lines are the desired spacing for robots , , and respectively. (d) is the plot of the trajectories of robots on the plane.

The utilities of robots , and remain 20 throughout the whole circumnavigation process, while the utility of the robot varies according to a piecewise constant function. That is, . For convenience, the four time ranges are denoted by Stage 1, 2, 3 and 4 respectively. Note that at Stage 4, the robot quits from the circumnavigation process as its utility becomes zero. The utility of the four robots and the corresponding desired spacing is listed in Table 1. In this experiment, robots’ initial positions are randomly chosen. The experiment parameters are m, rad/s, and .

The circumnavigation process is shown in Fig. 6. It demonstrates the positions of robots at different stages. The yellow lines connecting each robot’s center indicate the formation shape. The ball in the middle of the field is the target to be encircled, which is marked by a red circle. The corresponding data plots are shown in Fig. 7. Since robots move on the ground, the error plot of is omitted. In Fig. 6(d), the red, green, blue and black solid lines connecting the centres of robots represent the formation shapes at Stage 1, 2, 3 and 4 respectively. The dashed lines originated from robots are their trajectories. Note that since quits from the formation at Stage 4 (), the data related to is not plotted after 45 s.

It can be seen from these figures that at Stage 1, since the utility of is the least, its neighboring robots and decrease their spacing with to compensate for this insufficiency (see Fig. 5(b) or the red solid lines in Fig. 6(d)). When it comes to Stage 2, robots form an equal-spacing formation as their utilities are equal (see Fig. 5(c) or the green solid lines in Fig. 6(d)). Stage 3 is contrary to Stage 1, where the utility of becomes the greatest. Therefore, its two neighboring robots increase the corresponding spacing with it (see Fig. 5(d) or the blue solid lines in Fig. 6(d)). Finally, at Stage 4, quits from the formation due to its zero utility. The other three robots form a new communication topology as stated in Remark 5 (i.e., excluding the robot ) and transform to a equilateral triangular formation as their utilities are identical (see Fig. 5(e) or the black solid lines in Fig. 6(d)).

In addition, the circumnavigation radii, angular speeds and formation spacing converge to but fluctuate around the desired values at each stage (see Fig. 6(a), Fig. 6(b) and Fig. 6(c)). Moreover, at the three intersections of the stages (15 s, 30 s and 45 s respectively), the circumnavigation radii and the angular speeds of robots and , the two neighboring robots of , experience large deviation from the desired angular speed. They, however, converge swiftly afterwards (see Fig. 6(b)). Noticeably, at the last intersection (45 s), the circumnavigation radius and spacing for the robot deviate significantly from the desired values due to the absence of the robot in the formation, but the variations diminish rapidly subsequently (see Fig. 6(a) and Fig. 6(c)). The robot is hardly affected as it is not a neighboring robot of . In Fig. 6(d), the black dot at the center is the real position of the target and the cluster of pink dots are the perceived positions of the target by . This manifests that information noise increases the uncertainty of the perceived information. Although there are fluctuations due to the information noise, the real spacing converges to the expected spacing at each stage (see Fig. 6(c)). Fig. 6(d) shows that the formation spacing changes dynamically as the utility of varies.

5 Concluding Remarks and Future Work

This paper proposes a distributed control law for a multi-robot system to realize circumnavigation process with dynamic spacing based on utilities. Unlike most of the existing study, in this paper, the spacing is not fixed and equal but they are dynamic, which is useful if robots are heterogeneous (e.g. with different kinematics capabilities). There is no assumption that the robots should be initially placed on a prescribed circle nor should they splay evenly on the circle. The control law is distributed and scalable. The theoretical analysis using graph theory along with the simulation and real-robot experiments prove the effectiveness of the proposed circumnavigation control algorithm based on utilities.

Although Theorem 3.2 implies that robots will not collide with each other since their orders are unchanged during the circumnavigation process, this claim is based on the assumption that robots are considered as mass points. The collision avoidance problem taking into account the physical dimensions of robots will be studied in the future.

Our work is supported by National Science Foundation of China (NO. 61503401 and NO. 61773393), and graduate school of National University of Defense Technology.


  • [1] Franchi, A., Stegagno, P., Oriolo, G.: Decentralized multi-robot encirclement of a 3D target with guaranteed collision avoidance. Autonomous Robots 40(2), 245–265 (2016)
  • [2] Horn, R.A., Johnson, C.R.: Matrix analysis. Cambridge university press (2012)
  • [3] Lu, H., Yang, S., Zhang, H., Zheng, Z.: A robust omnidirectional vision sensor for soccer robots. Mechatronics 21(2), 373–389 (2011)
  • [4] Marshall, B.J.A., Broucke, M.E., Francis, B.A.: Formation of vehicles in cyclic pursuit. Automatic Control IEEE Transactions on 49(11), 1963–1974 (2015)
  • [5] Mesbahi, M., Egerstedt, M.: Graph theoretic methods in multiagent networks. Princeton University Press (2010)
  • [6] Minc, H.: Nonnegative matrices. J. Wiley (1988)
  • [7] Olfati-Saber, R., Murray, R.M.: Consensus problems in networks of agents with switching topology and time-delays. IEEE Transactions on Automatic Control 49(9), 1520–1533 (2004)
  • [8] Pavone, M., Frazzoli, E.: Decentralized Policies for Geometric Pattern Formation and Path Coverage. Journal of Dynamic Systems Measurement & Control 129(5), 633–643 (2007)
  • [9] Tang, S., Shinzaki, D., G. Lowe, C., Clark, C.M.: Multi-robot control for circumnavigation of particle distributions. Springer Tracts in Advanced Robotics 104, 149–152 (2014)
  • [10] Wang, C., Xie, G., Cao, M.: Forming Circle Formations of Anonymous Mobile Agents With Order Preservation. IEEE Transactions on Automatic Control 58(12), 3248–3254 (2013)
  • [11] Wang, C., Xie, G., Cao, M.: Controlling anonymous mobile agents with unidirectional locomotion to form formations on a circle. Automatica 50(4), 1100–1108 (2014)
  • [12] Xiong, D., Xiao, J., Lu, H., Zeng, Z., Yu, Q., Huang, K., Yi, X., Zheng, Z.: The design of an intelligent soccer-playing robot. Industrial Robot 43, 91–102 (2016)
  • [13] Yao, W., Dai, W., Xiao, J., Lu, H., Zheng, Z.: A simulation system based on ros and gazebo for robocup middle size league. In: Robotics and Biomimetics (ROBIO), 2015 IEEE International Conference on. pp. 54–59. IEEE (2015)
  • [14] Yao, W., Zeng, Z., Wang, X., Lu, H., Zheng, Z.: Distributed encirclement control with arbitrary spacing for multiple anonymous mobile robots. In: 2017 Chinese Control Conference (CCC). Dalian, China (Jul 2017)
  • [15] Yu, X., Liu, L.: Distributed circular formation control of ring-networked nonholonomic vehicles. Automatica 68, 92–99 (2016)
  • [16] Zheng, R., Lin, Z., Fu, M., Sun, D.: Distributed circumnavigation by unicycles with cyclic repelling strategies. In: Control Conference (ASCC), 2013 9th Asian. pp. 1–6. IEEE (2013)
  • [17] Zheng, R., Liu, Y., Sun, D.: Enclosing a target by nonholonomic mobile robots with bearing-only measurements. Automatica 53, 400–407 (2015)