Loading [MathJax]/jax/output/HTML-CSS/fonts/TeX/AMS/Regular/Main.js
Leader-Following Formation Control and Collision Avoidance of Second-Order Multi-Agent Systems With Time Delay | IEEE Journals & Magazine | IEEE Xplore

Leader-Following Formation Control and Collision Avoidance of Second-Order Multi-Agent Systems With Time Delay


The control structure and strategy for formation control with collision avoidance.

Abstract:

In this article, the formation control problem has been considered for second-order multi-agent system with time delay. The involved controller is divided into two parts....Show More

Abstract:

In this article, the formation control problem has been considered for second-order multi-agent system with time delay. The involved controller is divided into two parts. The first part is to design the leader-following and adaptive control strategies that are utilized to achieve the specified formation shape. Based on a potential field function, the second part is applied to realizing the collision avoidance of the agents communicating with each other. By using the Lyapunov theory, some sufficient criteria are derived to ensure the specified formation shape of all agents and collision avoidance of any pair of agents. The derived criteria are formulated in terms of algebraic conditions, in which the control gains play an important role. Finally, a numerical simulation is given to illustrate the effectiveness of the derived results.
The control structure and strategy for formation control with collision avoidance.
Published in: IEEE Access ( Volume: 8)
Page(s): 142571 - 142580
Date of Publication: 10 August 2020
Electronic ISSN: 2169-3536

Funding Agency:


CCBY - IEEE is not the copyright holder of this material. Please follow the instructions via https://creativecommons.org/licenses/by/4.0/ to obtain full-text articles and stipulations in the API documentation.
SECTION I.

Introduction

As a striking way to apply dynamics of autonomous agents in practical problems, distributed formation control strategies of multi-agent systems have been considered in many related fields over the past decades [1]–​[7]. The so-called formation control usually means that all of the agents cooperate with each other by utilizing local information, meanwhile approaching to some desired positions as a geometric shape. As mentioned in [8], many methods have been proposed to realize the desired formation shape, e.g., the position-based formation control scheme in [9], displacement-based scheme in [10], and distance-based scheme in [11]. Among these methods, the displacement-based formation control scheme has become an important and active topic, since the control law is easy to be designed and implemented [10], [12]–​[24].

In practical application, there are many problems to be considered for the distributed formation control, e.g., collision avoidance [25], obstacle avoidance [26], [27], and connectivity assurance [28]. Collision avoidance, as a basic requirement in the design of formation control law, is attributed to some task constraints. Such constraints rely on the implementation of real-world flight vehicles and computer-based simulations offering better reliability. In view of theory analysis, such constraints present a separation control law that affects the distance of between agents in close proximity. The basic idea of this separation control law is that a potential field is utilized for characterizing a repulsive force, such that the collision avoidance among the agents can be achieved. This idea had been introduced for obstacle avoidance of manipulators and mobile robots in [29], and developed to navigate the robot systems in [30], [31]. Recently, several kinds of artificial potential fields have been considered to deal with the collision avoidance or flocking behaviors of multi-agent systems in [6], [25], [32]. For example, in [6], a general potential field function has been constructed for the event-triggered formation control problem of nonlinear uncertain second-order multi-agent. In [32], a kind of formation control problem has been considered in the second-order multi-agent system, where the collision avoidance is described by a sequence of potential fields with respect to estimated position states.

In addition to collision avoidance, time delay is ubiquitous in the control processes. In some cases, it is difficult for the agents with time delay to cooperate with each other, and they may even present oscillation behavior. Therefore, it is crucial to consider time delay into control problem. Recently, many kinds of time delay have been introduced in the distributed control problem of multi-agent systems in [3], [15]–​[17], [33]–​[39]. In these works [3], [15]–​[17], [33]–​[37], time delay has many presentations: a typical example is system delay. The system delay, as an inherent delay, is usually caused by the finite response speed of hardware, such that the control signals in the system may not be instantaneous responses [37]. For example, in [15], formation tracking control problem of second-order multi-agent systems has been investigated, where time delay is introduced into the tracking control law. In [17], the leader-following formation control problem has been studied for nonlinear second-order multi-agent systems with time delay. In [36], the time delay has been considered in consensus problem of the second-order multi-agent system with jointly-connected topologies. In [37], the stability problem has been examined for a type of stochastic delayed systems, which can be readily extended for application to the consensus and formation control problem of multi-agent systems.

On the other hand, the leader-following control problem is one of the most important topics in the field of multi-agent systems [10], [14], [15], [17], [27], [40]–​[46]. Generally, the aim of leader-following control is to design a control law such that all of the agents can track the dynamics of the leader. However, the dynamics of followers not only cooperates with each other under the effects of network communication, but also exhibits their own motions that are acted by the leader. These properties of multi-agent systems reveal that it is possible to control a fraction of agents in order to achieve some final control objectives. This idea is the so-called pinning control strategy. Recently, the pinning control strategy has been utilized to study the leader-following control problem in [10], [47], [48]. For example, in [10], the formation control problem of second-order multi-agent system with fixed and switching topologies has been considered by using a pinning control strategy. In [47], several pinning control strategies have been examined for the synchronization problem of stochastic dynamical networks, where the selection of control nodes is optimized according to the evolutionary algorithms and the convex method.

Although it is important to consider the leader-following formation control and collision avoidance of multi-agent systems with time delay, there are still some difficulties and challenges which remain to be investigated. The primary difficulties and challenges can be listed as three aspects.

  1. There are many recent works that study the formation control and collision avoidance of multi-agent systems in [3], [4], [10]. However, in some works, the potential field function has been designed by only considering the minimum radius of the avoidance region and ignoring radius of the detection region. In this case, how to design an appropriate control protocol that, not only can be utilized to realize the specified formation shape of all the agents and the collision avoidance of any pair of agents, but also considers both the radius of the avoidance region and radius of the detection region, must be determined.

  2. Different from the relevant works in [2], [3], [5], [6], the main aim of this article focuses on the dynamic relationship between the system delay and the control protocol rather than some certain cases, e.g., only studying the collision avoidance or the specified formation shape. Therefore, the relationship between the time delay and the control parameters must be determined.

  3. Due to the requirement of collision avoidance, the common Lyapunov function candidate may be hard to be utilized. Thus, how to apply a decentralized Lyapunov function to deal with the system delay and the potential field in the adaptive control protocol must be determined.

Inspired by the above considerations, the aim of this article is to explore a mathematical framework to describe the relationship among the pinning control strategy, system delay and collision avoidance in the formation control problem. First, the dynamics of each agent is modeled by a nonlinear function with time delay acting on the position and velocity states. Then, a mixed control law is designed, where the pinning and adaptive control strategies are utilized to achieve the specified formation shape. Meanwhile, a typical potential field function is considered for ensuring collision avoidance. Based on the Lyapunov theory, two sufficient criteria are derived to ensure leader-following formation control and collision avoidance of second-order multi-agent systems with time delay. Finally, an example is given to show the effectiveness of results. The contributions of this article are summarized as follows:

  1. Compared with the usual formation control problems in [3], [4], [10], a mathematical framework of formation control and collision avoidance in second-order multi-agent systems with time delay is constructed, in which both the radius of the avoidance region and the detection region are considered for ensuring collision avoidance and connectivity preservation in a unify potential field function.

  2. Different from the formation control problems with collision avoidance [6], [25], [32], time delay, along with pinning and adaptive control strategies are simultaneously considered. Such strategies provide a mixed control approach that, on one hand, the specified formation shape and collision avoidance can be achieved, and on the other hand, the relationship among control parameters can be revealed.

The rest of this article is organized as follows. In Section II, some basic concepts and the control problem are formulated, where the potential field function, as well as pinning and adaptive control strategies are introduced, respectively. In Section III, the main results are presented. In Section IV, an example is given to show the effectiveness of results. In Section V, the conclusion is drawn.

Moreover, throughout this article, \mathbb {R}^{n\times m} indicates the set of the n\times m real matrix, and \mathbb {R}^{n} is the n -dimensional Euclidean space. For matrices X\in \mathbb {R}^{q\times p} and Y\in \mathbb {R}^{n\times m} , X\otimes Y stands for their Kronecker product. For a matrix A\in \mathbb {R}^{n\times m} , the 2-norm of A is \|A\|=\sqrt {\lambda _{\max }(A^{T}A)} , where the superscript “T” means the transpose of matrix A and \lambda _{\max }(\cdot) is the largest eigenvalue. For a vector x\in \mathbb {R}^{n} , \|x\|=\sqrt {x^{T}x} denotes the Euclidean vector norm.

SECTION II.

Model and Control Problem Formulation

Denote an undirected graph \mathcal {G}=(\mathcal {V},\mathcal {E}) as the communication structure among the agents, where \mathcal {V}=\{1,\ldots, N\} stands for the agent set and \mathcal {E}= \{(i,j)\} means the edge set. Let \mathcal {L}=[\ell _{ij}]\in \mathbb {R}^{N\times N} be the Laplacian matrix of graph \mathcal {G} , and the elements of the Laplacian matrix \mathcal {L} be defined as: for i\neq j , \ell _{ij}=\ell _{ji}=-1 holds if (i,j)\in \mathcal {E} ; otherwise \ell _{ij}=\ell _{ji}=0 holds if (i,j)\notin \mathcal {E} , and for i=j , \ell _{ii}=\sum ^{N}_{j\in \mathcal {N}_{i}}\ell _{ij} , where \mathcal {N}_{i}=\{j\in \{(i,j)\}\} is the neighboring set of agent i . In this article, the graph \mathcal {G} is assumed to be undirected, connected and simple (i.e., without multiple edges and self-loops). As shown in [47], if the graph \mathcal {G} is undirected and connected, all eigenvalues of the Laplacian matrix \mathcal {L} can be reordered by 0=\lambda _{1}(\mathcal {L}) < \lambda _{2}(\mathcal {L})\leq \ldots \leq \lambda _{N}(\mathcal {L}) , where \lambda _{i}(\mathcal {L}) means the i -smallest eigenvalue of the Laplacian matrix \mathcal {L} .

Considering a nonlinear second-order multi-agent system, the dynamics of the i -th agent is expressed by \begin{align*} \begin{cases} \dot {x}_{i}(t)=v_{i}(t),\\ \dot {v}_{i}(t)=f(x_{i}(t-\tau),v_{i}(t-\tau))+u_{i}(t), \end{cases} \tag{1}\end{align*}

View SourceRight-click on figure for MathML and additional features. where x_{i}(t)\in \mathbb {R}^{n} means the position state, v_{i}(t)\in \mathbb {R}^{n} is the velocity state, \tau \geq 0 is the bounded system delay, f(x_{i}(t),v_{i}(t)) is a nonlinear function, and u_{i}(t)\in \mathbb {R}^{n} is the formation control law. Moreover, for t\in [\tau,0] , x_{i}(t)=\varrho _{i}(t) and v_{i}(t)=\rho _{i}(t) are the initial functions, where the initial functions \varrho _{i}(t) and \rho _{i}(t) are continuous for all t\in [\tau,0] and i\in \mathcal {V} .

The dynamics of the virtual leader is given by \begin{align*} \begin{cases} \dot {x}_{0}(t)=v_{0}(t),\\ \dot {v}_{0}(t)=f(x_{0}(t-\tau),v_{0}(t-\tau)), \end{cases} \tag{2}\end{align*}

View SourceRight-click on figure for MathML and additional features. where x_{0}(t)\in \mathbb {R}^{n} means the position state of the virtual leader, and v_{0}(t)\in \mathbb {R}^{n} is the velocity state of the virtual leader.

Then, denote \mathcal {P}=\{1,2,\ldots,M\}\,\,(M\leq N) as a fixed pinning set, and therefore, \mathcal {P}\subseteq \mathcal {V} . For i\in \mathcal {P} , the formation control law is designed by \begin{align*} u_{i}(t)=&f(x_{0}(t-\tau),v_{0}(t-\tau))-f(x_{0}(t-\tau) \\[3pt]&+\,d_{i},v_{0}(t-\tau))+\alpha _{i}(t)\sum _{j\in \mathcal {N}_{i} } (x_{j}(t)-x_{i}(t) \\[3pt]&+\,d_{i}-d_{j})+\alpha _{i}(t)\sum _{j\in \mathcal {N}_{i} } (v_{j}(t)-v_{i}(t)) \\[3pt]&+\,u_{i}^{o}(t)+u_{i}^{p}(t), \tag{3}\end{align*}

View SourceRight-click on figure for MathML and additional features. and for i\notin \mathcal {P} , the formation control law is given by \begin{align*} u_{i}(t)=&f(x_{0}(t-\tau),v_{0}(t-\tau))-f(x_{0}(t-\tau) \\[3pt]&+\,d_{i},v_{0}(t-\tau))+\alpha _{i}(t)\sum _{j\in \mathcal {N}_{i} } (x_{j}(t)-x_{i}(t) \\[3pt]&+\,d_{i}-d_{j})+\alpha _{i}(t)\sum _{j\in \mathcal {N}_{i} } (v_{j}(t)-v_{i}(t)) \\[3pt]&+\,u_{i}^{o}(t), \tag{4}\end{align*}
View SourceRight-click on figure for MathML and additional features.
where \alpha _{i}(t) is an adaptive control gain given later, d_{i}\in \mathbb {R}^{n} is an absolute desired position of agent i , u_{i}^{p}(t)\in \mathbb {R}^{n} is a pinning control law, and u_{i}^{o}(t)\in \mathbb {R}^{n} is a collision avoidance control law.

The adaptive control gain \alpha _{i}(t) is updated according to the following form \begin{align*}&\hspace {-0.5pc}\dot {\alpha }_{i}(t)= \alpha \sum _{j\in \mathcal {N}_{i} }(x_{j}(t)-x_{i}(t)+d_{i}-d_{j}+v_{j}(t)-v_{i}(t))^{T} \\& \qquad \qquad \quad\displaystyle {\times \,(x_{j}(t)-x_{i}(t)+d_{i}-d_{j}+v_{j}(t)-v_{i}(t))}, \tag{5}\end{align*}

View SourceRight-click on figure for MathML and additional features. where \alpha >0 .

The pinning control law u_{i}^{p}(t) is written by \begin{equation*} u_{i}^{p}(t)=b_{i} (x_{i}(t)-x_{0}(t)-d_{i}+v_{i}(t)-v_{0}(t)), \tag{6}\end{equation*}

View SourceRight-click on figure for MathML and additional features. where b_{i} is a control gain.

The collision avoidance control law u_{i}^{o}(t) has the following form \begin{equation*} u_{i}^{o}(t)=-\sum _{j=1 }^{N}\frac {\partial W_{ij}^{T}(x_{i}(t),x_{j}(t))}{\partial x_{i}(t)}. \tag{7}\end{equation*}

View SourceRight-click on figure for MathML and additional features. The collision avoidance control law u_{i}^{o}(t) in (3) is composed of a potential field function that is utilized to realize the collision avoidance between any pair of agents. Given two positive parameters r and R , r expresses a minimum radius of the avoidance region, and R means a radius of the detection region, where r\leq \min _{i,j\in \mathcal {V}}\{\|d_{i}-d_{j}\|\} and R\geq r . The potential field function W_{ij} (x_{i}(t),x_{j}(t)) is described by \begin{equation*} W_{ij}(x_{i}(t),x_{j}(t))=\left({\min \left\{{\frac {\|x_{i}(t)-x_{j}(t)\|^{2}-R^{2}}{\|x_{i}(t)-x_{j}(t)\|^{2}-r^{2}},0}\right\}}\right)^{2}.\end{equation*}
View SourceRight-click on figure for MathML and additional features.

Taking the partial differential of the potential field function W_{ij} (x_{i}(t),x_{j}(t)) with respect to x_{i}(t) , for the case of \|x_{i}(t)-x_{j}(t)\|\in [r,R] , one has \begin{align*}&\hspace {-0.5pc}\frac {\partial W_{ij}^{T}(x_{i}(t),x_{j}(t))}{\partial x_{i}(t)}=\frac {4(R^{2}-r^{2})(\|x_{i}(t)-x_{j}(t)\|^{2}-R^{2})}{(\|x_{i}(t)-x_{j}(t)\|^{2}-r^{2})^{3}}\\& \qquad \qquad \qquad \qquad\qquad \qquad\qquad \qquad\qquad \displaystyle {\times \,(x_{i}(t)-x_{j}(t))^{T}, }\end{align*}

View SourceRight-click on figure for MathML and additional features. and for the case of \|x_{i}(t)-x_{j}(t)\|\in (R,\infty] , one gets \begin{equation*} \frac {\partial W_{ij}^{T}(x_{i}(t),x_{j}(t))}{\partial x_{i}(t)}=0.\end{equation*}
View SourceRight-click on figure for MathML and additional features.

Based on the above discussions, the potential field function W_{ij} (x_{i}(t),x_{j}(t)) has the following properties:

  • If the relative distance of any pair of agents i,j is less than r , W_{ij} (x_{i}(t),x_{j}(t)) is not equal to 0.

  • If the relative distance of any pair of agents i,j tends to r , W_{ij} (x_{i}(t),x_{j}(t)) increases.

  • If the relative distance of any pair of agents i,j is larger than r and less than R , W_{ij} (x_{i}(t),x_{j}(t)) increases.

In this case, if the relative distance of any pair of agents i,j belongs to [r,R] , the potential field function W_{ij} (x_{i}(t),x_{j}(t)) can be regarded as an extra control input such that the collision avoidance is realized.

Let e_{i}(t)=x_{i}(t)-d_{i}-x_{0}(t) and \nu _{i}(t)=v_{i}(t)-v_{0}(t) , then the system in (1)–​(7) is transformed into the following form \begin{align*} \begin{cases} \dot {e}_{i}(t)=\nu _{i}(t),\\ \dot {\nu }_{i}(t)=\widetilde {f}(e_{i}(t-\tau),\nu _{i}(t-\tau))-\alpha _{i}(t)\\ \qquad \quad \times \displaystyle \sum \nolimits _{j=1}^{N}\ell _{ij} (e_{j}(t)+\nu _{j}(t))-b_{i}(e_{i}(t)+\nu _{i}(t))\\ \qquad \quad -\displaystyle \sum \nolimits _{j=1 }^{N}\frac {\partial W_{ij}^{T}(x_{i}(t),x_{j}(t))}{\partial x_{i}(t)}, \end{cases} \tag{8}\end{align*}

View SourceRight-click on figure for MathML and additional features. where \widetilde {f}(e_{i}(t-\tau),\nu _{i}(t-\tau))=f(x_{i}(t-\tau),v_{i}(t-\tau))-f(x_{0}(t-\tau)+d_{i},v_{0}(t-\tau)) , and for i\in \mathcal {P} , b_{i}\neq 0 , otherwise, b_{i}=0 .

For the sake of obtaining the main results, the following assumption, lemma and definition are necessary.

Assumption 1:

For any x(t),y(t),v(t),u(t)\in \mathbb {R}^{n} , there exist two nonnegative parameters \varphi and \phi , such that the nonlinear function f(\cdot,\cdot) satisfies the following condition, \begin{equation*} \|f(x(t),v(t))\!-\!f(y(t),u(t))\| \!\leq \!\varphi \|x(t)\!-\!y(t)\| \!+\!\phi \|v(t)\!-\!u(t)\|.\end{equation*}

View SourceRight-click on figure for MathML and additional features.

Lemma 1:

For any vectors X,Y\in \mathbb {R}^{n} , the following inequality holds \begin{equation*} 2X^{T}Y\leq X^{T}X+Y^{T}Y.\end{equation*}

View SourceRight-click on figure for MathML and additional features.

Definition 1:

The leader-following formation control of second-order multi-agent systems with time delay in (11) is said to be ensured, if the following conditions hold \begin{align*}&\lim _{t\rightarrow \infty }\|x_{i}(t)-d_{i}-x_{0}(t) \|=0,\\&\lim _{t\rightarrow \infty }\|v_{i}(t)-v_{0}(t)\|=0.\end{align*}

View SourceRight-click on figure for MathML and additional features.

Remark 1:

In this article, the formation control problem has been considered for a second-order multi-agent system with time delay in (11). Different from the usual formation control problems in [3], [4], [10], the collision avoidance control law in (8) is constructed by a typical potential field function. This potential field function can be regarded as a repulsive force, such that the collision avoidance among any pair of agents can be achieved. Compared with the formation control problems with collision avoidance [6], [25], [32], a mixed control approach is considered. The controller is designed by using this mixed control approach that not only involves the leader-following and adaptive control strategies to ensure the specified formation shape, but also depends on the potential field function in order to guarantee the collision avoidance.

Remark 2:

Recently, the adaptive control strategies have been introduced into many problems of multi-agent system [5], [35], [46]. However, time delay is inevitable due to the finite response speed of hardware. In this article, the adaptive control strategy is utilized to design the formation control protocol in (3) and (4), and the updated law in (5). On the other hand, the pinning control method has been proven to be an effective method which only acts on a small fraction of agents, rather than the whole system in the control process. In this case, this article develops the adaptive control and pinning control methods for application to the formation control problem of second-order multi-agent system with time delay in (11).

Remark 3:

In this article, the time delay \tau has been considered for the second-order multi-agent system in (1). The time delay \tau is molded by a kind of system delay, which is caused by the finite response speed of hardware and is regarded as a signal for an exact amount of time in (1). For this reason, the time delay \tau is assumed to be a same constant in all the leader and follower agents. Although, an ideal time delay in networked systems would be heterogeneous, it may result in some complex mathematical analyses. For the case that the time delay is heterogeneous, we will try to explore these in the following work.

SECTION III.

Formation Control and Collision Avoidance of Second-Order Multi-Agent System

In this section, the formation control problem of the second-order multi-agent system in (11) is studied. The derived results are divided into two cases. The first case considers the second-order multi-agent system in (11) without time delay, and the second case examines the second-order multi-agent system with time delay in (11).

Theorem 1:

Suppose that Assumption 1 and \tau =0 hold. The formation control and collision avoidance of the second-order multi-agent system in (11) are achieved, if there is a positive parameter \widetilde {\alpha } , such that the following condition holds, \begin{equation*} \widetilde {\varphi }-\widetilde {\alpha }\lambda _{1}(\mathcal {L}+B) < 0, \tag{9}\end{equation*}

View SourceRight-click on figure for MathML and additional features. where \widetilde {\varphi }=\max \{1+\varphi +2\phi,3+\phi +2\varphi \}/2 , the matrix B=diag\{b_{1},\ldots,b_{N}\} , and \lambda _{1}(\mathcal {L}+B) is the smallest eigenvalue of matrix \mathcal {L}+B .

Proof:

Denote W_{ij} (x_{i}(t) , x_{j}(t)) as W_{ij}(t) for brevity. Similarly to [38], [39], consider the following Lyapunov function for the system second-order multi-agent system in (8), \begin{align*} V(t)=&\sum _{i\in \mathcal {V}}\sum _{j\in \mathcal {N}_{i} } \widetilde {\alpha } e^{T}_{ji}(t)e_{ji}(t)+\sum _{i\in \mathcal {V}} e^{T}_{i}(t)\nu _{i}(t) \\&+\,\frac {1}{2}\sum _{i\in \mathcal {V}} (e^{T}_{i}(t)e_{i}(t)+\nu ^{T}_{i}(t)\nu _{i}(t)) \\&+\,\frac {1}{2\alpha }\sum _{i\in \mathcal {V}}(\alpha _{i}(t) -\widetilde {\alpha })^{2} + \frac {1}{2}\sum _{i,j\in \mathcal {V}}W_{ij}, \tag{10}\end{align*}

View SourceRight-click on figure for MathML and additional features. where e_{ji}(t)=e_{j}(t)-e_{i}(t) . In view of Schur complement theory [49], the Lyapunov function V(t) can be rewritten by \begin{align*} V(t)=&\sum _{i\in \mathcal {V}}\sum _{j\in \mathcal {N}_{i} } \widetilde {\alpha } e^{T}_{ji}(t)e_{ji}(t)+\frac {1}{2}\sum _{i\in \mathcal {V}} \left [{\begin{array}{cc} e_{i}(t)&\quad \nu _{i}(t)\\ \end{array}}\right] \\&\times \, \left [{\begin{array}{cc} 1&\quad 1\\ 1&\quad 1 \\ \end{array}}\right]\left [{\begin{array}{c} e_{i}(t)\\ \nu _{i}(t) \\ \end{array}}\right]+\frac {1}{2\alpha }\sum _{i\in \mathcal {V}}(\alpha _{i}(t) -\widetilde {\alpha })^{2} \\&+\,\frac {1}{2}\sum _{i,j\in \mathcal {V}}W_{ij}, \tag{11}\end{align*}
View SourceRight-click on figure for MathML and additional features.
which means that the Lyapunov function V(t) is positive definite from (5)–​(8).

For i\neq j , the derivative of V(t) can be obtained as follows \begin{align*} \dot {V}(t)=&2\sum _{i\in \mathcal {V}}\sum _{j\in \mathcal {N}_{i} } \widetilde {\alpha } e^{T}_{ij}(t)\dot {e}_{ij}(t)+\sum _{i\in \mathcal {V}}\Big (\dot {e}^{T}_{i}(t)\nu _{i}(t) \\&+\,e^{T}_{i}(t)\dot {\nu }_{i}(t)\Big)+ \sum _{i\in \mathcal {V}}\Big (e^{T}_{i}(t)\dot {e}_{i}(t)+\nu ^{T}_{i}(t)\dot {\nu }_{i}(t)\Big) \\&+\,\frac {1}{\alpha } \sum _{i\in \mathcal {V}} (\alpha _{i}(t) -\widetilde {\alpha })\dot {\alpha }_{i}(t)+\frac {1}{2} \sum _{i,j\in \mathcal {V}}\Big (\frac {\partial W_{ij}^{T}(t) }{\partial x_{i}(t)} \\&\times \,\dot {x}_{i}(t) +\frac {\partial W_{ij}^{T}(t) }{\partial x_{j}(t)}\dot {x}_{j}(t)\Big) \\\leq&2\sum _{i=1}^{N}\sum _{i=1}^{N}\widetilde {\alpha } e^{T}_{ij}(t)\nu _{ij}(t)+\frac {1}{2}\Big (\sum _{i=1}^{N} e^{T}_{i}(t)e(t) \\&+\,3\nu ^{T}_{i}(t)\nu _{i}(t) \Big)+\sum _{i=1 }^{N}\Big (e_{i}(t)+\nu _{i}(t)\Big)^{T} \\&\times \,\Big (\widetilde {f}(e_{i}(t),\nu _{i}(t))-\alpha _{i}(t)\sum _{j=1}^{N}\ell _{ij}(e_{j}(t)+\nu _{j}(t)) \\&-\,b_{i}(e_{i}(t)+\nu _{i}(t))-\frac {\partial W_{ij}^{T}(t)}{\partial x_{i}(t)}\Big)+ \sum _{i=1}^{N} (\alpha _{i}(t)-\widetilde {\alpha }) \\&\times \,\sum _{j=1}^{N}\Big (e_{ji}(t) +\nu _{ji}(t)\Big)^{T}\Big (e_{ji}(t)+ \nu _{ji}(t)\Big) \\&+\,\frac {1}{2} \sum _{i=1}^{N}\sum _{j=1}^{N}\left({\frac {\partial W_{ij}^{T}(t) }{\partial x_{i}(t)}\dot {x}_{i}(t)+\frac {\partial W_{ij}^{T}(t) }{\partial x_{j}(t)}\dot {x}_{j}(t)}\right),\quad \tag{12}\end{align*}

View SourceRight-click on figure for MathML and additional features. where \nu _{ji}(t)=\nu _{j}(t)-\nu _{i}(t) .

Let e(t)=[e^{T}_{1}(t),\ldots,e^{T}_{N}(t)]^{T} and \nu (t)=[\nu ^{T}_{1}(t),\ldots,\,\,\nu ^{T}_{N}(t)]^{T} . It follows from the definitions of e(t) , \nu (t) and \mathcal {L} that \begin{align*}&\sum _{i=1}^{N}\sum _{j=1}^{N} \widetilde {\alpha } e^{T}_{ij}(t)\nu _{ij}(t) = \widetilde {\alpha }e^{T}(t)(\mathcal {L} \otimes I_{n})\nu (t), \\[-2pt]&\sum _{i=1 }^{N} \Big (e_{i}(t)+\nu _{i}(t)\Big)^{T} \left({\alpha _{i}(t)\sum _{j=1}^{N}\ell _{ij} e_{j}(t)+b_{i}e_{i}(t)}\right) \\[-2pt]=&(e (t)+\nu (t))^{T}((\alpha _{i}(t)\mathcal {L} +B)\otimes I_{n})e (t),\end{align*}

View SourceRight-click on figure for MathML and additional features. and \begin{align*}&\hspace {-0.5pc}\sum _{i=1 }^{N} \Big (e_{i}(t)+\nu _{i}(t)\Big)^{T} \left({\alpha _{i}(t)\sum _{j=1}^{N}\ell _{ij} \nu _{j}(t)+b_{i}\nu _{i}(t)}\right) \\[-2pt]& \qquad \qquad \qquad \qquad\displaystyle {=(e (t)+\nu (t))^{T} ((\alpha _{i}(t)\mathcal {L} +B)\otimes I_{n})\nu (t).}\end{align*}
View SourceRight-click on figure for MathML and additional features.

Using Assumption 1 and Lemma 1, one has the following \begin{align*}&\hspace {-2pc}\sum _{i=1 }^{N} \Big (e_{i}(t)+\nu _{i}(t)\Big)^{T}\widetilde {f}(e_{i}(t),\nu _{i}(t)) \\[-2pt]\leq&\sum _{i=1}^{N} (\|e_{i}(t)\|+\|\nu _{i}(t)\|)(\varphi \|e_{i}(t)\|+ \phi \|\nu _{i}(t)\|) \\[-2pt]\leq&\sum _{i=1 }^{N} \left({\frac {2\varphi + \phi }{2}\|e_{i}(t)\|^{2}+\frac {\varphi +2\phi }{2}\|\nu _{i}(t)\|^{2}}\right). \tag{13}\end{align*}

View SourceRight-click on figure for MathML and additional features.

From the definition of \partial W_{ij}(t) , it is easy to verify that \begin{equation*} \frac {\partial W_{ij} (t)}{\partial x_{i}(t)}=-\frac {\partial W_{ij} (t) }{\partial x_{j}(t)} =\frac {\partial W_{ji} (t) }{\partial x_{i}(t)}=-\frac {\partial W_{ji} (t) }{\partial x_{j}(t)},\end{equation*}

View SourceRight-click on figure for MathML and additional features. which implies that \begin{align*}&\hspace {-2pc}\sum _{i=1}^{N}\nu ^{T}_{i}(t)\sum _{j=1}^{N}\frac {\partial W_{ij}^{T} (t)}{\partial x_{i}(t)} \\[-2pt]=&\frac {1}{2} \sum _{i=1}^{N}\nu ^{T}_{i}(t)\sum _{j=1}^{N}\left({\frac {\partial W_{ij}^{T}(t) }{\partial x_{i}(t)}+\frac {\partial W_{ij}^{T} (t)}{\partial x_{i}(t)}}\right) \\[-2pt]=&\frac {1}{2}\sum _{i=1}^{N}\sum _{j=1}^{N}\left({\frac {\partial W_{ij}^{T} (t)}{\partial x_{i}(t)} \nu _{i}(t)+\frac {\partial W_{ij}^{T} (t) }{\partial x_{j}(t)}\nu _{j}(t)}\right). \tag{14}\end{align*}
View SourceRight-click on figure for MathML and additional features.
Based on the matrix decomposition theory, there is a unitary matrix H such that H^{T}\mathcal {L} H=\Lambda holds, where \Lambda =diag\{0,\lambda _{2}(\mathcal {L}),\ldots,\lambda _{N}(\mathcal {L})\} , H=[H_{1},\ldots,H_{N}] and H_{1}=\textbf {1}_{N}^{T}/\sqrt {N} . Let z(t)=(H^{T}\otimes I_{n})e(t) and y(t)=(H^{T}\otimes I_{n})\nu (t) , where z(t)=[z^{T}_{1}(t),\ldots,z^{T}_{N}(t)]^{T} and y(t)=[y^{T}_{1}(t),\ldots,\,\,y^{T}_{N}(t)]^{T} . Thus, it follows from the equations in (12)–​(19) that \begin{align*} \dot {V}(t)\leq&\sum _{i=1 }^{N} \left({\frac {2\varphi + \phi +1}{2} \|e_{i}(t)\|^{2}+\frac {\varphi +2\phi +3 }{2} \|\nu _{i}(t)\|^{2}}\right) \\[-2pt]&-\,\widetilde {\alpha }e^{T}(t)((\mathcal {L} +B)\otimes I_{n})e(t)-\widetilde {\alpha }\nu ^{T}(t) \\[-2pt]&\times \,((\mathcal {L}+B)\otimes I_{n})\nu (t) \\[-2pt]=&\sum _{i=1 }^{N}\Big [\left({\frac {2\varphi + \phi +1}{2}-\widetilde {\alpha }\lambda _{1}(\mathcal {L}+B)}\right) \|z_{i}(t)\|^{2} \\[-2pt]&+\, \left({\frac {\varphi +2\phi +3}{2}-\widetilde {\alpha }\lambda _{1}(\mathcal {L}+B)}\right)\|y_{i}(t)\|^{2}\Big] \\[-2pt] < &0. \tag{15}\end{align*}
View SourceRight-click on figure for MathML and additional features.

In addition, for i\neq j , it is easy to deduce that \begin{align*}&\lim _{\|x_{i}(t)-x_{j}(t)\|\rightarrow r^{+}}W_{ij}(t)=\infty,\\&\lim _{\|x_{i}(t)-x_{j}(t)\|\rightarrow r^{+}}\frac {\partial W_{ij}(t)}{\partial x_{i}(t)}=\infty.\end{align*}

View SourceRight-click on figure for MathML and additional features. That is, the collision avoidance is ensured. This completes the proof.

Theorem 1 studies the formation control problem of the second-order multi-agent system without time delay in (11). Note that the matrix \mathcal {L}+B is a positive definite matrix, since the Laplacian matrix \mathcal {L} is the positive semi-definite matrix and the matrix B is a positive definite diagonal matrix. Now, time delay is considered in the following theorem.

Theorem 2:

Suppose that Assumption 1 and \tau \neq 0 hold. The formation control and collision avoidance of the second-order multi-agent system in (11) are achieved, if there is a positive parameter \widetilde {\alpha } , such that the following condition holds, \begin{equation*} \widehat { \varphi } -\widetilde {\alpha }\lambda _{1}(\mathcal {L}+B) < 0, \tag{16}\end{equation*}

View SourceRight-click on figure for MathML and additional features. where the matrix B=diag\{b_{1},\ldots,b_{N}\} , \widehat { \varphi } =\phi +\varphi +\tau /2+3/2 , and \lambda _{1}(\mathcal {L}+B) is the smallest eigenvalue of matrix \mathcal {L}+B .

Proof:

Consider the following Lyapunov function for the system second-order multi-agent system in (8), \begin{align*} V(t)=&\sum _{i\in \mathcal {V}}\sum _{j\in \mathcal {N}_{i} } \widetilde {\alpha } e^{T}_{ji}(t)e_{ji}(t)+\sum _{i\in \mathcal {V}} e^{T}_{i}(t)\nu _{i}(t) \\&+\,\frac {1}{2}\sum _{i\in \mathcal {V}} (e^{T}_{i}(t)e_{i}(t)+\nu ^{T}_{i}(t)\nu _{i}(t)) \\&+\,\frac {1}{2\alpha }\sum _{i\in \mathcal {V}}(\alpha _{i}(t) -\widetilde {\alpha })^{2} + \frac {1}{2}\sum _{i,j\in \mathcal {V}}W_{ij}(t) \\&+\,\sum _{i\in \mathcal {V}} \frac {\varphi +\phi }{2}\int _{t-\tau }^{t}(e^{T}_{i}(\theta) e_{i}(\theta)+\nu ^{T}_{i}(\theta)\nu _{i}(\theta))d\theta \\&+\,\sum _{i\in \mathcal {V}}\int _{0}^{\tau }\int _{t-\theta }^{t}(e^{T}_{i}(\vartheta)e_{i}(\vartheta)+\nu ^{T}_{i}(\vartheta)\nu _{i}(\vartheta))d\vartheta d\theta.\end{align*}

View SourceRight-click on figure for MathML and additional features. Based on the similar discussions of (14), the above Lyapunov function is positive. Then, for i\neq j , the derivative of V(t) can be obtained as follows \begin{align*} \dot {V}(t)\leq&2\sum _{i=1}^{N}\sum _{i=1}^{N}\widetilde {\alpha } e^{T}_{ij}(t)\nu _{ij}(t)+\frac {1}{2}\sum _{i=1}^{N}\Big (e^{T}_{i}(t)e_{i}(t) \\&+\,3\nu ^{T}_{i}(t)\nu _{i}(t)\Big)+\sum _{i=1 }^{N}\Big (e_{i}(t)+\nu _{i}(t)\Big)^{T} \\&\times \,\Big (\widetilde {f}(e_{i}(t-\tau),\nu _{i}(t-\tau)) -\alpha _{i}(t)\sum _{j=1}^{N}\ell _{ij}(e_{j}(t) \\&+\,\nu _{j}(t))-b_{i}(e_{i}(t)+\nu _{i}(t))-\frac {\partial W_{ij}^{T}(t)}{\partial x_{i}(t)}\Big) \\&+\, \sum _{i=1}^{N} (\alpha _{i}(t)-\widetilde {\alpha })\sum _{j=1}^{N} \Big (e_{ji}(t) +\nu _{ji}(t)\Big)^{T}\Big (e_{ji}(t) \\&+\, \nu _{ji}(t)\Big)+\frac {1}{2} \sum _{i=1}^{N}\sum _{j=1}^{N}\Big (\frac {\partial W_{ij}^{T} (t)}{\partial x_{i}(t)}\dot {x}_{i}(t) \\&+\,\frac {\partial W_{ij}^{T} (t)}{\partial x_{j}(t)}\dot {x}_{j}(t)\Big)+\frac {\varphi +\phi }{2}\sum _{i=1}^{N}\Big (e^{T}_{i}(t)e_{i}(t) \\&-\,e^{T}_{i}(t-\tau)e_{i}(t-\tau)+\nu ^{T}_{i}(t)\nu _{i}(t) \\&-\,\nu ^{T}_{i}(t-\tau) \nu _{i}(t-\tau)\Big)+\sum _{i=1}^{N}\Big (\tau (e^{T}_{i}(t)e_{i}(t) \\&+\,\nu ^{T}_{i}(t)\nu _{i}(t))- \int _{t-\tau }^{t}(e^{T}_{i}(\theta)e_{i}(\theta)+\nu ^{T}_{i}(\theta) \\&\times \,\nu _{i}(\theta))d\theta. \tag{17}\end{align*}
View SourceRight-click on figure for MathML and additional features.
Using Assumption 1 and Lemma 1, one has the following \begin{align*}&\hspace {-2pc}\sum _{i=1 }^{N} \Big (e_{i} (t)+\nu _{i}(t)\Big)^{T}\widetilde {f}(e_{i}(t-\tau),\nu _{i}(t-\tau)) \\\leq&\sum _{i=1}^{N} (\|e_{i}(t)\|+\|\nu _{i}(t)\|)(\varphi \|e_{i}(t-\tau)\| \\&+\, \phi \|\nu _{i}(t-\tau)\|) \\\leq&\sum _{i=1 }^{N} \frac {\varphi +\phi }{2}(\|e_{i}(t)\|^{2}+ \|e_{i}(t-\tau)\|^{2} \\&+\,\|\nu _{i}(t)\|^{2}+\|\nu _{i}(t-\tau)\|^{2}). \tag{18}\end{align*}
View SourceRight-click on figure for MathML and additional features.
Similar to (20), based on the matrix decomposition theory, there is a unitary matrix H such that H^{T}\mathcal {L} H=\Lambda holds, where \Lambda =diag\{0,\lambda _{2}(\mathcal {L}),\ldots,\lambda _{N}(\mathcal {L})\} , H=[H_{1},\ldots,H_{N}] and H_{1}=\textbf {1}_{N}^{T}/\sqrt {N} . Let z(t)=(H^{T}\otimes I_{n})e(t) and y(t)=(H^{T}\otimes I_{n})\nu (t) , where z(t)=[z^{T}_{1}(t),\ldots,z^{T}_{N}(t)]^{T} and y(t)=[y^{T}_{1}(t),\ldots,\,\,y^{T}_{N}(t)]^{T} . Moreover, it is easy to check that the last term in satisfies - \int _{t-\tau }^{t}(e^{T}_{i}(\theta)e_{i}(\theta)+\nu ^{T}_{i}(\theta)\nu _{i}(\theta))d\theta \leq 0 . In this case, it is not hard to obtain that \begin{align*} \dot {V}(t)\leq&\frac {1}{2}\sum _{i=1 }^{N} \Big ((1+\tau +2\varphi +2\phi) \|e_{i}(t)\|^{2}+ (3+\tau +2\varphi \\&+\,2\phi)\|\nu _{i}(t)\|^{2}\Big)-\widetilde {\alpha }e^{T}(t)((\mathcal {L} +B)\otimes I_{n})e(t) \\&-\,\widetilde {\alpha }\nu ^{T}(t)((\mathcal {L} +B)\otimes I_{n})\nu (t) \\=&\frac {1}{2}\sum _{i=1 }^{N}\Big [\Big ((1+\tau +2\varphi +2\phi)-\widetilde {\alpha }\lambda _{1}(\mathcal {L}+B)\Big) \\&\times \,\|z_{i}(t)\|^{2}+ \Big ((3+\tau +2\varphi +2\phi)-\widetilde {\alpha }\lambda _{1}(\mathcal {L}+B)\Big) \\&\times \,\|y_{i}(t)\|^{2}\Big] \\ < &0. \tag{19}\end{align*}
View SourceRight-click on figure for MathML and additional features.
In addition, for i\neq j , it is easy to know that \begin{align*}&\lim _{\|x_{i}(t)-x_{j}(t)\|\rightarrow r^{+}}W_{ij(t)}=\infty,\\&\lim _{\|x_{i}(t)-x_{j}(t)\|\rightarrow r^{+}}\frac {\partial W_{ij}(t)}{\partial x_{i}(t)}=\infty.\end{align*}
View SourceRight-click on figure for MathML and additional features.
Thus, the proof is completed.

Remark 4:

Note that the sufficient criteria in Theorems 1 2 are presented by the algebraic conditions instead of the terms of linear matrix inequalities. This means that the sufficient criteria in Theorems 1 and 2 are easier for calculation and simulation. Particularly, it can be anticipated that the calculation of the obtained criteria only depends on the size of matrix \mathcal {L}+B if applying large-scale system. On the other hand, in many works of pinning control, the number of pinning nodes can be solved or optimized. However, the best solution of pinning nodes cannot be solved in this article. In our future works, we will attempt to investigate this problem.

Remark 5:

In views of Theorems 1 and 2, it has been proved that for i\in \mathcal {V} , all the states x_{i}(t) and v_{i}(t) approach to x_{0}(t)+d_{i} and v_{0}(t) , respectively. Thus, the control gain \alpha _{i}(t) in (5) is convergent for all i\in \mathcal {V} . Actually, it can be anticipated that there exist two positive constants T_{0} and \hat {\alpha } , such that \int _{t}^{t+T_{0}}\sum _{i\in \mathcal {V}}\chi ^{T}_{i}(\tau)\chi _{i}(\tau)d\tau \geq \hat {\alpha }I_{2N} holds if all conditions in Theorems 1 and 2 are satisfied, where \chi _{i}(t)=[e_{i}^{T}(t),\nu _{i}^{T}(t)]^{T} and \hat {\alpha } is a constant depended on \widetilde {\alpha } in Theorems 1 and 2. At this stage, \widetilde {\alpha }>0 can be regarded as a special case of persistent excitation (PE) condition which has been investigated in many adaptive problems. For more details of PE condition, the reference [50] is recommended.

Remark 6:

Note that the Lyapunov method plays an important role in the proof of Theorems 1 and 2. When constructing these Lyapunov functions, the primary aim is to consider the dynamic relationship among the parameters of multi-agent system in (11). In this case, the first challenge is how to apply a Lyapunov function that can reflect the system delay \tau , the control gains \alpha _{i}(t) and b_{i} , and the topological structure. Inspired by [3], [5], [33], [36], the Lyapunov functions in the proof of Theorems 1 and 2 have been constructed. Then, the second challenge is how to design an appropriate potential field function of the avoidance control (8) into the Lyapunov functions in the proof of Theorems 1 and 2. It is worth highlighting that the derivative of the potential field function W_{ij}(t) between any pair of agents i,j will approach to zero as time evolves. It means that the derivative of these Lyapunov functions is always negative definite.

Remark 7:

Recently, there are many leader-following control methods that have been considered for multi-agent systems [41]–​[46]. Compared with these works, in this article, the leader-following control method is designed for formation control problem with collision avoidance and time delay. In this control method, on one hand, the pinning and adaptive control strategies have considered to achieve the specified formation shape, and on the other hand, the relationship among control parameters is shown. Moreover, a typical potential field function has designed in this leader-following control method. Although, this potential field function, as a collision avoidance control law, is irrelevant to the leader, it can be utilized for ensuring collision avoidance.

Remark 8:

This article studies the formation control and collision avoidance problem of second-order multi-agent systems with time delay, where the time delay is modeled by system delay. The main idea of this article is to construct an appropriate Lyapunov function. This Lyapunov function in Theorem 2 contains some relevant terms, where the integral items \sum _{i\in \mathcal {V}} \frac {\varphi +\phi }{2}\int _{t-\tau }^{t}(e^{T}_{i}(\theta) e_{i}(\theta)+\nu ^{T}_{i}(\theta)\nu _{i}(\theta))d\theta and \sum _{i\in \mathcal {V}}\int _{0}^{\tau }\int _{t-\theta }^{t}(e^{T}_{i}(\vartheta)e_{i}(\vartheta)+\nu ^{T}_{i}(\vartheta)\nu _{i}(\vartheta))d\vartheta d\theta are utilized to deal with the time delay. In this case, this method focuses more on the mathematical techniques, but may not reveal the relationship among the parameters of system.

SECTION IV.

Example

Example 1:

An example is given to show the formation control and collision avoidance problem of a second-order multi-agent system with four agents. The communication graph is a globally coupled network, which is drawn in Fig. 1.

FIGURE 1. - The communication structure with 4 agents.
FIGURE 1.

The communication structure with 4 agents.

The control gains are \alpha =0.81 and b_{i}=1 for all i\in \mathcal {V} . The nonlinear function is f(x_{i}(t-\tau),v_{i}(t-\tau))=0.2\sin (x_{i}(t-2))+0.1v_{i}(t-2) , which means that \varphi =0.2 and \phi =0.1 . Now, denote the desired position as a square with side length 20, the minimum radius r of the avoidance region is 3, and the radius R of the detection region is 70. In this case, it is easy to check that \lambda _{i}(\mathcal {L}+B)=1 , which means that all of the conditions in Theorem 1 are satisfied if choosing \widetilde {\alpha }>3 . Therefore, the formation control of second-order multi-agent system with four agents is ensured, and the collision avoidance can be avoided. The relative positions x_{i1}(t)-x_{0}(t)-d_{i1} of all agents approach to zero in Fig. 2 as well as the relative positions x_{i2}(t)-x_{0}(t)-d_{i2} of all agents. In Fig. 3, the relative velocities v_{i1}(t)-v_{0}(t) and v_{i2}(t)-v_{0}(t) converge to zero. In Fig. 4, the position trajectories of all the agents are drawn, it can be observed that all of the agents approach to the desired position of the square. The relative distances \|x_{i1}(t)-x_{j1}(t)\| and \|x_{i2}(t)-x_{j2}(t)\| are shown in Fig. 5.

FIGURE 2. - The relative positions 
$x_{i1}(t)-x_{0}(t)-d_{i1}$
 and 
$x_{i2}(t)-x_{0}(t)-d_{i2}$
 of formation control and collision avoidance in second-order multi-agent system.
FIGURE 2.

The relative positions x_{i1}(t)-x_{0}(t)-d_{i1} and x_{i2}(t)-x_{0}(t)-d_{i2} of formation control and collision avoidance in second-order multi-agent system.

FIGURE 3. - The relative velocities 
$v_{i1}(t)-v_{0}(t)$
 and 
$v_{i2}(t)-v_{0}(t)$
 of formation control and collision avoidance in second-order multi-agent system.
FIGURE 3.

The relative velocities v_{i1}(t)-v_{0}(t) and v_{i2}(t)-v_{0}(t) of formation control and collision avoidance in second-order multi-agent system.

FIGURE 4. - The trajectories of all the agents under the formation control law with collision avoidance.
FIGURE 4.

The trajectories of all the agents under the formation control law with collision avoidance.

FIGURE 5. - The relative distances 
$\|x_{i1}(t)-x_{j1}(t)\|$
 and 
$\|x_{i2}(t)-x_{j2}(t)\|$
 of formation control and collision avoidance in second-order multi-agent system.
FIGURE 5.

The relative distances \|x_{i1}(t)-x_{j1}(t)\| and \|x_{i2}(t)-x_{j2}(t)\| of formation control and collision avoidance in second-order multi-agent system.

SECTION V.

Conclusion

This article studies the formation control and collision avoidance problem for a second-order multi-agent system with time delay. To achieve the specified formation shape, the leader-following control method utilizing the distributed adaptive control law is considered. Then, a kind of potential field function is applied to avoid the collision avoidance. Based on the Lyapunov theory, two sufficient criteria are obtained in terms of algebraic conditions such that the formation control and collision avoidance of the second-order multi-agent system are ensured. Subsequently, a numerical simulation is given to illustrate the effectiveness of the obtained results. Our further works including formation control protocol with collision and obstacle avoidance will be carried out.

References

References is not available for this document.