# Finite-Time Cooperative Tracking Control Algorithm for Multiple Surface Vessels

Authors: Jianfang Jiao; Mingyu Fu
Journal: Abstract and Applied Analysis
 (2014)

---

## Abstract

We investigate the problem of finite-time cooperative tracking for multiple surface vessels in the presence of external
disturbances. A robust finite-time cooperative tracking algorithm based on terminal sliding-mode control is proposed for multiple surface vessels. In light of the leader-follower strategy, a virtual leader vessel is defined to provide reference point for other surface vessels to form the desired formation. Specifically, the proposed algorithm only requires the communication topology among the surface vessels to be a directed graph with a directed spanning tree. The robustness is achieved by compensating the upper bound
of external disturbance in the control input, and the global finite-time stability is proved by Lyapunov stability theory. Finally, the effectiveness of the proposed finite-time cooperative tracking control algorithm is demonstrated by simulation results.


---

## Body

## 1. Introduction

With the rapid development of marine technology, the cooperative motion control for multiple vessels has received increasing attention during the last decades. The cooperative formation of multiple vessels has become popular for military and commercial applications. For example, coast patrol requires multiple vessels to perform cooperative tracking operation while maintaining a desired formation pattern. During winter, the tanker must be escorted by icebreakers, which requires the tanker to keep a fixed distance to the icebreakers. Besides, underway replenishment is performed by coordinating one or more supply vessels and the receiving vessel such that all vessels maintain the desired relative distances and hold the equal course and forward speed. These complicated operations of multiple vessels are carried out by moving collectively as a whole formation. Compared with individual vessel, cooperative operations of multiple vessels have higher operational efficiency, larger serve areas, better fault-tolerant property, and stronger robustness [1]. Based on these broad applications and several superiorities mentioned above, study on cooperative control algorithm for multiple surface vessels is important and significative.With respect to the cooperative control issues, formation control as a special case, a large number of studies have been widely reported in existing publications. The formation strategies mainly include leader-follower strategy, virtual structures strategy, and behavioral strategy [2]. In order to achieve robustness and improve cooperative performance, some robust control approaches had been proposed, such as model predictive control [3], Lagrangian method [4], and null-space-based behavioral control [5]. Some advanced cooperative control approaches had also been investigated, such as graph theory [6], passivity-based control [7, 8], and hybrid control [9], to name just a few. In particular, the leader-follower strategy is utilized widely in practice due to its easy manipulation and implementation. For maritime applications, Kyrkjebø et al. proposed a leader-follower synchronization algorithm to solve the ship underway replenishment, which realizes feedback control law by estimating velocity and acceleration of all ships based on nonlinear observers [10]. Breivik et al. proposed a guided leader-follower approach for ship formation control using integrator backstepping and cascade theory [11]. Thorvaldsen and Skjetne researched the formation control of fully actuated marine vessels and proposed group agreement protocols based on leader-follower strategy [7]. Overall, the cooperative task based on leader-follower strategy is achieved through that the appointed leaders track the predefined desired paths or trajectories, while the followers track the leaders. However, the main shortcoming of this formation strategy in the aforementioned studies is that it depends heavily on the leader. The formation task cannot be achieved if the leader has failure in the process of operations. To avoid this problem, the concept of virtual leader is introduced and used to solve the formation control of multiagent systems [12, 13]. It is a good choice to design cooperative control algorithm based on the virtual leader strategy.When multiple agents are to be coordinated to perform complicated task, information exchange between them is a necessary condition. In order to accomplish cooperative tracking operations, both position and velocity information need to be shared. In practice, the communication topology among these agents might be directed as a result of the external disturbances. That means one agent might receive the information from neighbors but cannot send his own information to the neighbors. Under directed communication topologies, Ren had studied the consensus tracking algorithm for multiagent with single-integrator kinematics [14]. Yu et al. provided a consensus algorithm for multiagent systems with nonlinear dynamics [15, 16]. Zhang et al. studied the cooperative control problem of multiple uncertain Lagrangian systems [17]. Besides, Fu et al. proposed a coordinated formation control algorithm under directed communication topology for multiple surface vessels [18]. However, it is still a big problem to design a cooperative control algorithm under directed communication for the leader-follower multiagent systems, especially in the case that the information of the leader is not available to all the followers; that is, only a portion of followers can communicate with the leader and the communication links are directed.For marine control, finite-time control is quite desirable when considering the huge inertia of the surface vessels. Compared to asymptotic stability control, the convergence rate of finite-time control is faster, and the system with finite-time convergence has better disturbance rejection properties and robustness against uncertainties [19]. However, a common trait of the existing cooperative tracking control algorithms for multiple surface vessels is that they only provide asymptotic stability [9, 20]. In other words, the cooperative operations can be achieved in infinite time, which may not be applicable to practical operation. So the finite-time cooperative control has received considerable attention. Wang and Xiao and Khoo et al. developed finite-time consensus algorithm for multiagent systems in [21, 22]. The finite-time formation control algorithms had been investigated for multiagent systems in [23, 24]. Furthermore, both finite-time position consensus and collision avoidance problems had been investigated for multiple autonomous underwater vehicle [25]. The cooperative performance of multiple surface vessels is often influenced by the environmental disturbances; therefore, robust cooperative tracking algorithm is significative, and the real-time implementation of fault-tolerant control is also important [26–29]. The sliding-mode control is a better method for solving this problem, which possesses the robustness to external disturbances [30]. A robust tracking control algorithm is proposed based on sliding-mode control for a single surface vessel to achieve robustness to the wind, wave, and current environment disturbances in [31, 32]. The sliding-mode control approach is also used to design the robust cooperative control algorithm in [20, 33, 34]. The terminal sliding-mode control can be achieved by the finite-time cooperative operations [35], which motivates the research of the finite-time cooperative tracking for multiple surface vessels.In this paper, the problem of robust cooperative tracking control for multiple surface vessels is considered, and the communication topology among these surface vessels is directed graph which has a directed spanning tree. The finite-time cooperative tracking control algorithm is designed using the terminal sliding-mode control method, and the desired formation configuration is achieved using the virtual leader-follower strategy. The rest of this paper is organized as follows. In Section2, the basic notations for the graph theory are introduced and the vessel mathematic model is established. Section 3 describes a detailed algorithm of the finite-time cooperative tracking control for multiple surface vessels. The simulation is carried out to demonstrate the validity of the proposed cooperative control algorithm in Section 4. At last, we draw conclusion in Section 5.


## 2. Preliminaries

### 2.1. Vessel Model

With respect to the surface vessels, only the motions on the surge, sway, and yaw are considered. If we define the generalized position and orientation which are expressed in the inertial reference frame asη=[n,e,ψ]T, the linear-angular velocity vector expressed in the body-fixed reference frame is denoted as v=[u,v,r]T. Then we can obtain the 3 degrees of freedom (DOF) mathematical model for the surface vessels as follows [36]:
(1)η˙=R(ψ)v,Mvv˙+Cv(v)v+Dv(v)v=τv+R-T(ψ)ω,
where R(ψ) is a transformation matrix from the body-fixed reference to the inertial reference frame and the form is
(2)R(ψ)=[cos⁡(ψ)-sin(ψ)0sin(ψ)cos⁡(ψ)0001].
It is obvious that Ri-1(ψi)=RiT(ψi),for all  ψi.M
v denotes a positive definite matrix of inertia mass which includes added mass. Cv(v) is a matrix which arises from the coriolis and centripetal forces and Dv(v) represents a damping matrix. The detailed expression of the above three matrices can be seen in [36]. τv represents the forces and torques input vector from the thruster system. ω denoted the forces and torques input vector from the external disturbances. And we assume that the disturbances are bounded; |ω|<ωmax⁡∈ℝ3.In order to design the tracking controller for surface vessels in the sequel, the expression of vessel model can be transformed as(3)M(η)η¨+C(η,η˙)η˙+D(η,η˙)η˙=τ+ω.
The above expression is vessel mathematic model in the inertial reference frame, which is obtained by using the following transformations:
(4)M(η)=R-T(ψ)MvR-1(ψ),C(η,η˙)=R-T(ψ)[Cv(v)-MvR-1(ψ)R˙(ψ)]R-1(ψ),D(η,η˙)=R-T(ψ)Dv(v)R-1(ψ),τ=R-T(ψ)τv.
The vessel model as (3) holds the following properties. (1)
Inertia mass matrixM(η) is symmetric positive definite and satisfies
(5)λmin⁡(M)I≤M(η)≤λmax⁡(M)I,whereλmin⁡(M) represents the minimum eigenvalue of the matrix M and λmax⁡(M) represents the maximal eigenvalue of the matrix M;(2)
M˙(η)-2C(η,η˙) satisfies
(6)ηT(M˙(η)-2C(η,η˙))η=0,∀η∈ℝ3which means it is skew symmetric;(3)
D(η,η˙) is positive definite matrix which satisfies
(7)ηTD(η,η˙)η>0,∀η≠0.


### 2.2. Notations

In order to model the information transmit relationship between the group of surface vessels, several basic concepts of directed graph are given here [20]. If we define ν as a set of vertices and define ε∈ν2 as a set of edges, then we can represent a directed graph as G=(ν,ε). Furthermore, the edges of directed graph are directed. The directed edge 〈i,j〉∈ε can represent the information that flows from vertex j to vertex i, and 〈j,i〉∈ε represents the information that flows from vertex i to vertex j. Let A∈ℝn×n be the adjacent matrix of a directed graph G. The matrix A is defined as follows: the off-diagonal entries are aij=1if〈i,j〉∈ε and 0; otherwise, the diagonal entries are 0. D∈ℝn×n is called the degree matrix, which is defined as follows: off-diagonal entries are 0 and diagonal entries are dii=∑j≠iaij. The Laplacian matrix can be calculated as L=D-A∈ℝn×n. The matrix L=[lij]∈ℝn×n is defined as follows: lii=∑j≠iaij,lij=-aij.Let one vertex represent one vessel in the group and the edges represent information exchange links by available directed communication; then the communication relationship between the group of vessels is described by a directed graph. Specially, in this paper we consider the communication topology as a directed graph with a directed spanning tree; that is, the digraph has at least one vertex with a directed path to all other vertexes.Define the Kronecker product of two matricesA∈ℝn×n and B∈ℝp×q as
(8)A⊗B=[a11B⋯a1nB⋮⋱⋮am1B⋯amnB]∈ℝmp×nq.
The Kronecker product holds the following properties: (1)
(A⊗B)T=AT⊗BT;(2)
C(A⊗B)=(CA)⊗B=A⊗(CB);(3)
(A⊗Ip)(C⊗Ip)=AC⊗Ip,Ip∈ℝp×p.Given a variable vectorx=[x1,…,xn]T∈ℝn and an integer α, define xα=[x1α,…,xnα]T, diag⁡(x)=[x1⋱xn].


### 2.3. Some Lemmas

Lemma 1 (see [14]).
Let the Laplacian matrix of a directed graph G be defined asL=[lij]∈ℝp×p, where L is not necessarily symmetric. The Laplacian matrix satisfies the following conditions:
(9)lij≤0,i≠j;∑j=1p‍lij=0,i=1,…p.
The Laplacian matrix L of a directed graph G has a simple zero eigenvalue with an associated eigenvector 1p, and all the other eigenvalues have positive real parts if and only if the directed graph has a directed spanning tree. Furthermore, if Laplacian matrix L has a simple zero eigenvalue, then Rank(L)=p-1.Lemma 2 (see [37]).
For the non-Lipschitz system(10)x˙=f(x),f(0)=0,x∈ℝn,
where f(·) is a continuous nonlinear function on an open neighborhood U of the origin x=0 in ℝn. Suppose there exist a continuous function V(x):U→ℝ, real numbers C>0 and 0<α<1, and an open neighborhood U0⊂U of x=0, such that (1)
V(x) is positive definite;(2)
V˙(x)+C(V(x))α≤0,x∈U0∖{0}.Then the origin x=0 is a finite-time stable equilibrium of system (10). Furthermore, if U=U0=ℝn, the origin x=0 is a globally finite-time stable equilibrium of system (10). And the finite settling time satisfies T≤V1-α(x0)/C(1-α), where x0 is the initial state of the system.


## 2.1. Vessel Model

With respect to the surface vessels, only the motions on the surge, sway, and yaw are considered. If we define the generalized position and orientation which are expressed in the inertial reference frame asη=[n,e,ψ]T, the linear-angular velocity vector expressed in the body-fixed reference frame is denoted as v=[u,v,r]T. Then we can obtain the 3 degrees of freedom (DOF) mathematical model for the surface vessels as follows [36]:
(1)η˙=R(ψ)v,Mvv˙+Cv(v)v+Dv(v)v=τv+R-T(ψ)ω,
where R(ψ) is a transformation matrix from the body-fixed reference to the inertial reference frame and the form is
(2)R(ψ)=[cos⁡(ψ)-sin(ψ)0sin(ψ)cos⁡(ψ)0001].
It is obvious that Ri-1(ψi)=RiT(ψi),for all  ψi.M
v denotes a positive definite matrix of inertia mass which includes added mass. Cv(v) is a matrix which arises from the coriolis and centripetal forces and Dv(v) represents a damping matrix. The detailed expression of the above three matrices can be seen in [36]. τv represents the forces and torques input vector from the thruster system. ω denoted the forces and torques input vector from the external disturbances. And we assume that the disturbances are bounded; |ω|<ωmax⁡∈ℝ3.In order to design the tracking controller for surface vessels in the sequel, the expression of vessel model can be transformed as(3)M(η)η¨+C(η,η˙)η˙+D(η,η˙)η˙=τ+ω.
The above expression is vessel mathematic model in the inertial reference frame, which is obtained by using the following transformations:
(4)M(η)=R-T(ψ)MvR-1(ψ),C(η,η˙)=R-T(ψ)[Cv(v)-MvR-1(ψ)R˙(ψ)]R-1(ψ),D(η,η˙)=R-T(ψ)Dv(v)R-1(ψ),τ=R-T(ψ)τv.
The vessel model as (3) holds the following properties. (1)
Inertia mass matrixM(η) is symmetric positive definite and satisfies
(5)λmin⁡(M)I≤M(η)≤λmax⁡(M)I,whereλmin⁡(M) represents the minimum eigenvalue of the matrix M and λmax⁡(M) represents the maximal eigenvalue of the matrix M;(2)
M˙(η)-2C(η,η˙) satisfies
(6)ηT(M˙(η)-2C(η,η˙))η=0,∀η∈ℝ3which means it is skew symmetric;(3)
D(η,η˙) is positive definite matrix which satisfies
(7)ηTD(η,η˙)η>0,∀η≠0.


## 2.2. Notations

In order to model the information transmit relationship between the group of surface vessels, several basic concepts of directed graph are given here [20]. If we define ν as a set of vertices and define ε∈ν2 as a set of edges, then we can represent a directed graph as G=(ν,ε). Furthermore, the edges of directed graph are directed. The directed edge 〈i,j〉∈ε can represent the information that flows from vertex j to vertex i, and 〈j,i〉∈ε represents the information that flows from vertex i to vertex j. Let A∈ℝn×n be the adjacent matrix of a directed graph G. The matrix A is defined as follows: the off-diagonal entries are aij=1if〈i,j〉∈ε and 0; otherwise, the diagonal entries are 0. D∈ℝn×n is called the degree matrix, which is defined as follows: off-diagonal entries are 0 and diagonal entries are dii=∑j≠iaij. The Laplacian matrix can be calculated as L=D-A∈ℝn×n. The matrix L=[lij]∈ℝn×n is defined as follows: lii=∑j≠iaij,lij=-aij.Let one vertex represent one vessel in the group and the edges represent information exchange links by available directed communication; then the communication relationship between the group of vessels is described by a directed graph. Specially, in this paper we consider the communication topology as a directed graph with a directed spanning tree; that is, the digraph has at least one vertex with a directed path to all other vertexes.Define the Kronecker product of two matricesA∈ℝn×n and B∈ℝp×q as
(8)A⊗B=[a11B⋯a1nB⋮⋱⋮am1B⋯amnB]∈ℝmp×nq.
The Kronecker product holds the following properties: (1)
(A⊗B)T=AT⊗BT;(2)
C(A⊗B)=(CA)⊗B=A⊗(CB);(3)
(A⊗Ip)(C⊗Ip)=AC⊗Ip,Ip∈ℝp×p.Given a variable vectorx=[x1,…,xn]T∈ℝn and an integer α, define xα=[x1α,…,xnα]T, diag⁡(x)=[x1⋱xn].


## 2.3. Some Lemmas

Lemma 1 (see [14]).
Let the Laplacian matrix of a directed graph G be defined asL=[lij]∈ℝp×p, where L is not necessarily symmetric. The Laplacian matrix satisfies the following conditions:
(9)lij≤0,i≠j;∑j=1p‍lij=0,i=1,…p.
The Laplacian matrix L of a directed graph G has a simple zero eigenvalue with an associated eigenvector 1p, and all the other eigenvalues have positive real parts if and only if the directed graph has a directed spanning tree. Furthermore, if Laplacian matrix L has a simple zero eigenvalue, then Rank(L)=p-1.Lemma 2 (see [37]).
For the non-Lipschitz system(10)x˙=f(x),f(0)=0,x∈ℝn,
where f(·) is a continuous nonlinear function on an open neighborhood U of the origin x=0 in ℝn. Suppose there exist a continuous function V(x):U→ℝ, real numbers C>0 and 0<α<1, and an open neighborhood U0⊂U of x=0, such that (1)
V(x) is positive definite;(2)
V˙(x)+C(V(x))α≤0,x∈U0∖{0}.Then the origin x=0 is a finite-time stable equilibrium of system (10). Furthermore, if U=U0=ℝn, the origin x=0 is a globally finite-time stable equilibrium of system (10). And the finite settling time satisfies T≤V1-α(x0)/C(1-α), where x0 is the initial state of the system.


## 3. Finite-Time Cooperative Tracking Controller Design

In this section, we will design the finite-time cooperative tracking controller based on terminal sliding-mode control. Here we considern vessels to perform the cooperative tracking task with desired formation. And these vessels are identified by the index set I=[1,2,…n]. We define the communication topology relationship among these vessels as a directed graph G; then the adjacent matrix of G is
(11)A=[a11a12⋯a1n⋮⋮⋮⋮an1an2⋯ann]∈ℝn×n.
The degree matrix is defined as D=diag⁡{d1d2⋯dn}∈ℝn×n; then we can know that the Laplacian matrix is L=D-A.The desired formation pattern among the surface vessels is established based on the leader-follower strategy. The leader vessel is virtual and it is labeled by 0. Then the communication topology among all the vessels (include the virtual leader) is described by a directed graphG¯; the adjacent matrix of G¯ is denoted as
(12)A¯=[0000a10a11⋯a1n⋮⋮⋮⋮an0an1⋯ann]∈ℝ(n+1)×(n+1).
The connected relationship between the leader vessel and the practical vessels is denoted by B=diag⁡{b1b2⋯bn}.Remark 3.
Consider the following.(13)aij={1,if(j,i)∈ε0,otherwise,bi={1,ifvesselicanreceivetheleader'sinformation0,otherwise.
We assume that the position of the virtual leader vessel is denoted asη0 and the desired trajectory of the whole formation is given by the leader vessel. Here we define the desired trajectory of the leader as ηd, where ηd=[nd(t),ed(t),ψd(t)]T, nd(t),ed(t) are sufficiently smooth functions, and the motion direction of the virtual leader vessel can be chosen as the tangential vector of its desired trajectory; that is, ψd(t)=arctan(e˙d(t)/n˙d(t)). In order to form the desired formation, we define the relative distance between the ith follower vessel and the virtual leader vessel as li=[x0i,y0i,ψ0i]T and ψ0i=0; then we can define the formation reference point of the ith vessel as xi=ηi+li. It is obvious that l0=0; then x0=η0. In order to maintain the desired formation among these surface vessels, it is necessary for all the formation reference points to synchronize. That is, x1=⋯=xi=⋯=xn=η0. And the cooperative tracking while keeping the desired formation is achieved by x1=⋯=xi=⋯=xn=ηd.
The virtual vessel is free to external disturbances, so the leader vessel model in the inertial reference frame can be written as(14)M0(η0)η¨0+C0(η0,η˙0)η˙0+D0(η0,η˙0)η˙0=τ0.
Design the tracking control law τ0 using the backstepping control approach to make η0→ηd as in the literature [20].
We assume that the position of the virtual vessel and its velocity are available to its neighbors only and the control force inputτ0 is unknown to any practical vessels, but its upper bound τ¯0 is available to its neighbors. The detailed design process of the finite-time cooperative tracking algorithm is as follows.
Define the relative position error of the formation reference point for theith vessel as
(15)e1i=∑j=1n‍aij(xi-xj)+bi(xi-x0)=∑j=1n‍aij(ηi+li-ηj-lj)+bi(ηi+li-η0).
Define the the relative velocity error of the formation reference point for for the ith vessel in the inertial reference frame as
(16)e2i=∑j=1n‍aij(x˙i-x˙j)+bi(x˙i-x˙0)=∑j=1n‍aij(η˙i-η˙j)+bi(η˙i-η˙0)=(∑j=1n‍aij)η˙i-(∑j=1n‍aij)η˙j+biη˙i-biη˙0.
Define the terminal sliding-mode surface of the ith vessel as
(17)si=e1i+(e2i)α,
where (e2i)α=[(e2i(1))α(e2i(2))α(e2i(3))α]T. The real-time control input τ0 of the virtual leader is unknown to any following vessels due to time delay or information transmission failure in the communication channel; while the upper bound of the control input τ¯0 is available to the adjacent vessels. The control input of each vessel can be chosen as
(18)τi=Ci(ηi,η˙i)η˙i+Di(ηi,η˙i)η˙i+∑j=1,j≠in‍(aij+bi)-1Mi×{(e2i)2-αα+∑j=1,j≠in‍aijMj-1×[-Cj(ηj,η˙j)η˙j-Dj(ηj,η˙j)η˙j+τj]+biM0-1[-C0(η0,η˙0)η˙0-D0(η0,η˙0)η˙0]-diag⁡(2nMmin⁡-1ωmax⁡+biMmin⁡-1τ¯0+κ1)×sign⁡(si)(e2i)2-αα},
where κ1∈ℝ3×1 is positive vector and 0<Mmin⁡≤min⁡{M1,…Mn}.Theorem 4.
Consider the vessel with the nonlinear model as in (1) and (3), if the communication topology among all the vessels (include the virtual leader) is a directed graph which has a directed spanning tree and the terminal sliding-mode surface is defined as (17), the control input force is chosen as (18). Then, the cooperative tracking of multiple surface vessels can be reached in finite time.Proof.
The Laplacian matrix of the communication graph among these surface vessels is(19)L=D-A=[(∑j=1n‍a1j)-a11⋯-a1n⋮⋱⋮-an1⋯(∑j=1n‍anj)-ann].
The connected relationship between the leader vessel and the practical vessels is denoted as
(20)B=[b1⋱bn].
If we define(21)E1=[e11⋯e1n]T∈ℝ3n×1,E2=[e21⋯e2n]T∈ℝ3n×1,η=[η1⋯ηn]T∈ℝ3n×1,1n=[1,…,1]T∈ℝn×1,I3=diag⁡(111)∈ℝ3×3,
then the error dynamics of multiple surface vessels can be written in terms of matrix and vector:
(22)E˙1=E2,E˙2=[(L+B)⊗I3]η¨-(B⊗I3)(1n⊗η¨0).
For representing conveniently, we define
(23)η=[η1Tη2T⋯ηnT]T;l=[l1Tl2T⋯lnT]T;τ=[τ1Tτ2T⋯τnT]T;M(η)=diag⁡(M1(η1)⋯Mn(ηn)),C(η,η˙)=diag⁡(C1(η1,η˙1)⋯Cn(ηn,η˙n)),D(η,η˙)=diag⁡(D1(η1,η˙1)⋯Dn(ηn,η˙n)).
We can redefine the error dynamics with the matrix or vector form with the vessel model; then we can obtain that
(24)E˙1=E2,E˙2=[(L+B)⊗I3]×[M-1(η)×(τ+ω-C(η,η˙)η˙-D(η,η˙)η˙)]-(B⊗I3)×{1n⊗[M0-1(η0)×(τ0-C0(η0,η˙0)η˙0-D0(η0,η˙0)η˙0)M0-1(η0)][M0-1(η0)}.
The terminal sliding-mode variable vector can be written as S=[s1⋯sn]T; then we can obtain that
(25)S=E1+E2α.
Consider the Lyapunov function
(26)V=12STS.
Differentiating V with respect to time, we can obtain that
(27)V˙=STS˙=ST[E2+αdiag⁡(E2α-1)E˙2]=ST{E2+αdiag⁡(E2α-1)×[M0-1(η0)((L+B)⊗I3)×(M-1(η)(τ+ω-C(η,η˙)η˙-D(η,η˙)η˙))-(B⊗I3)×(1n⊗(M0-1(η0)×(τ0-C0(η0,η˙0)η˙0-D0(η0,η˙0)η˙0)M0-1(η0)))](E2α-1)}.
The control input vector of all these vessels can be written as(28)τ=C(η,η˙)η˙+D(η,η˙)η˙+[(D+B)-1⊗I3]M×{(E2)2-αα+(A⊗I3)M-1×(τ-C(η,η˙)η˙-D(η,η˙)η˙)+(B⊗I3)×(1n⊗M0-1(-C0(η0,η˙0)η˙0-D0(η0,η˙0)η˙0))-diag⁡{diag⁡(Mmin⁡-1(2nωmax⁡+biτ¯0)+κ1),…,diag⁡(Mmin⁡-1(2nωmax⁡+biτ¯0)+κ1)}×sign⁡(S)(E2)2-αα}.
We can note that
(29)I3n-{[(D+B)-1⊗I3]M(A⊗I3)M-1}=MM-1-{[(D+B)-1⊗I3]M(A⊗I3)M-1}=M[(D+B)-1⊗I3][(D+B)⊗I3]M-1-{[(D+B)-1⊗I3]M(A⊗I3)M-1}=M[(D+B)-1⊗I3][(D+B)⊗I3-(A⊗I3)]M-1=M[(D+B)-1⊗I3][(D+B-A)⊗I3]M-1=M[(D+B)-1⊗I3][(L+B)⊗I3]M-1.
Then the control input can be rewritten as
(30)τ=M((L+B)-1⊗I3)×((D+B)⊗I3)M-1×{sign⁡(S)(E2)2-αα}C(η,η˙)η˙+D(η,η˙)η˙+((D+B)-1⊗I3)M×{(E2)2-αα+(A⊗I3)M-1×(τ-C(η,η˙)η˙-D(η,η˙)η˙)+(B⊗I3)×(1n⊗M0-1(-C0(η0,η˙0)η˙0-D0(η0,η˙0)η˙0))-diag⁡{diag⁡(Mmin⁡-1(2nωmax⁡+biτ¯0)+κ1),…,diag⁡(Mmin⁡-1(2nωmax⁡+biτ¯0)+κ1)}×sign⁡(S)(E2)2-αα}}.
Substituting the control input (30) into (27), then
(31)V˙=ST×{αdiag⁡(E2α-1)×[((L+B)⊗I3)M-1(η)ω-(B⊗I3)(1n⊗(M0-1(η0)τ0))-diag⁡{diag⁡(Mmin⁡-1(2nωmax⁡+biτ¯0)+κ1),…,diag⁡(Mmin⁡-1(2nωmax⁡+biτ¯0)+κ1)}×sign⁡(S)((L+B)⊗I3)M-1](E2α-1)}=-α∑i=1n‍[siT(e2i)α-1×diag⁡(Mmin⁡-1(2nωmax⁡+biτ¯0)+κ1)×sign⁡(si)siT(e2i)α-1]+α∑i=1n‍[(∑j=1,j≠in‍aij+bi)siT(e2i)α-1×((∑j=1,j≠in‍aij+bi)(Mi-1(ηi)|ωi|)+∑j=1,j≠in‍aij(Mj-1(ηj)|ωj|))+biMi-1(ηi)|τ0|(∑j=1,j≠in‍aij+bi)]≤-α∑i=1n‍[|siT|(e2i)α-1×diag⁡(Mmin⁡-1(2nωmax⁡+biτ¯0)+κ1)13(e2i)α-1]+α∑i=1n‍[+∑j=1,j≠in‍aij(Mj-1(ηj)|ωj|))|siT|(e2i)α-1×((∑j=1,j≠in‍aij+bi)(Mi-1(ηi)|ωi|)+∑j=1,j≠in‍aij(Mj-1(ηj)|ωj|))+biMi-1(ηi)|τ0|+∑j=1,j≠in‍aij(Mj-1(ηj)|ωj|))]≤-α∑i=1n‍|siT|(e2i)α-1κ1.
Let(32)ρ(E2)=min⁡[α(e21(k))α-1κ1(k),…α(e2n(k))α-1κ1(k)︸n,k=1,2,3].
For e2k≠0,k=1,2,…,n, ρ(E2)>0, then we have
(33)V˙≤-α∑i=1n‍|siT|(e2i)α-1κ1≤-ρ(E2)∑l=13n‍|S(l)|≤-ρ(E2)(∑l=13n‍|S(l)|2)1/2=-21/2ρ(E2)V1/2.
Therefore, we can know that the terminal sliding surface S=0 can be reached in a finite time for the case of e2k≠0,k=1,2,…,n, because the condition of finite-time stability is satisfied.
Substituting the control input (30) into the error dynamics (24), then
(34)E˙2=-(E2)2-αα-(diag⁡(2nωmax⁡+κ1)+(B⊗I3)(1n⊗τ0))×sign⁡(S)+(L+B)ω+(B⊗I3)(1n⊗τ0).
If S≠0, e˙2i≤-κ1 or e˙2i≥κ1, we can know that E2=0 is not an attractor.
However, on this new terminal sliding-mode surface, that is,S=0, E1+E2α=0, so E2=-E11/α.
Define the Lyapunov function as(35)VE1=12E1TE1.
And it follows that
(36)V˙E1=-E1TE11/α≤-2(1+α)/2α(VE1)(1+α)/2α.
In light of Lemma 2, the error functions E1 and E2 will converge to zero in finite time.


## 4. Simulation Results

In this section, simulation results are presented to evaluate the performance of the proposed finite-time cooperative formation control algorithm. We consider four surface vessels to perform the cooperative tracking task. For detailed system parameters matrices of vessel mathematic model, we can refer to the literature [7]. Here, we suppose that the information of virtual leader is available only to vessel 3 and vessel 4. The information exchange topology among all the vessels (including the virtual vessel) can be denoted as a directed graph in Figure 1.Figure 1
The information exchange topology among all the vessels.From the above information exchange topology graph, we can know that the adjacent matrix of the graph is as follows:(37)A¯=[0000000111000101010010000].Then the Laplacian matrix of the information exchange topology graph of the practical vessels can be written as(38)L=[3-1-1-101-100-1100000].
And the matrix for the communication relationship between the virtual vessel and the practical vessels is
(39)B=diag⁡(0011).The initial conditions areη0(0)=[27782-π/3]T, η1(0)=[80831-7π/30]T, η2(0)=[-94753-π/2]T, η3(0)=[40700-π/4]T and η4(0)=[-50800-π/3]T, respectively. The desired trajectory for the virtual vessel is chosen as ηd(t)=[ndedψd]T, and the detailed expressions are nd=t,ed=800sin(t/800), and ψd=arctan(e˙d/n˙d). In order to maintain the desired formation pattern, the relative distance between the practical vessels and the virtual leader vessel is defined as l1=[01000]T, l2=[0-1000]T, l3=[0500]T, and l4=[0-500]T, respectively.With the proposed finite-time cooperative tracking control law, the dynamic trajectory of each vessel is shown in Figure2. It can be seen that these vessels move collectively along the sinusoid with maintaining a beeline formation pattern in the plane. The heading consensus for these vessels is achieved in finite time as shown in Figure 3. Furthermore, in the process of cooperative tracking, the surge velocities, the sway velocities, and the angular velocities of all these surface vessels converge to the desired values as a whole in finite time, which are presented in Figures 4, 5, and 6, respectively. From Figure 4, it is clearly seen that the surge velocities consensus of these vessels cannot be achieved absolutely at the inflexion of the curves. This is a natural phenomenon because all the desired trajectories are curve and all the curvatures are distinct.Figure 2
The dynamic trajectory of each vessel.Figure 3
The heading consensus for these vessels.Figure 4
The surge velocities consensus of the vessels.Figure 5
The sway velocities consensus of the vessels.Figure 6
The angular velocities consensus of the vessels.Based on the above simulation results, we can know that the cooperative tracking task of multiple surface vessels is achieved by the proposed finite-time cooperative control algorithm. That means that these surface vessels can form the desired formation and perform the cooperative tracking as a whole formation in finite time. Overall, the proposed finite-time cooperative tracking control algorithm for multiple surface vessels is effective and satisfactory.


## 5. Conclusion

In this paper, the finite-time cooperative tracking control scheme for multiple surface vessels has been proposed. The cooperative formation is achieved by defining the formation reference point of each vessel based on the virtual leader-follower strategy. Furthermore, the communication topology among these vessels (include the virtual leader) is only the directed graph with a directed spanning tree. The cooperative tracking control scheme is designed using the terminal sliding-mode control approach which requires defining a nonlinear sliding variable function. In addition, the robustness against the external disturbances is achieved by compensating for the upper bound in the control input. It is proved that the cooperative tracking with desired formation can be achieved in finite time. Finally, the effectiveness of the proposed finite-time cooperative tracking control algorithm is validated by the simulation results.



---

*Source: 807102-2014-03-04.xml*