# Consensus Tracking for Multiagent Systems with Nonlinear Dynamics

Authors: Runsha Dong
Journal: The Scientific World Journal
 (2014)

---

## Abstract

This paper concerns the problem of consensus tracking for multiagent systems with a dynamical leader. In particular, it proposes the corresponding explicit control laws for multiple first-order nonlinear systems, second-order nonlinear systems, and quite general nonlinear systems based on the leader-follower and the tree shaped network topologies. Several numerical simulations are given to verify the theoretical results.


---

## Body

## 1. Introduction

There have been a lot of recent researches paying attention to the problem of multiagent cooperative control which means a group of agents working cooperatively to achieve coverage, formation, and consensus [1–5]. The consensus problem, known as agreement on certain quantities of interest for groups of agents, is one of the major research directions. Consensus tracking means consensus with a dynamical leader [6, 7]. It is considered as a manner of cooperative behaviors and has also drawn far more attention.In the pioneering work on consensus tracking of Ren [8], consensus with a constant reference state and with a time-varying reference state is analyzed for the first-order integrator systems. However, even in the second case, the dynamics of the time-varying reference state is assumed to have no explicit external input. Later, many variants of the consensus tracking algorithms are developed for various system models. In [9], a control algorithm is proposed for the problems of consensus tracking while those homogenous follower agents are with dynamics of first-order linear integrator and the leader is governed by the different dynamics. In [10], a consensus tracking algorithm is proposed and analyzed for the second-order integrator dynamics which is also a linear system model. And in [6], the author designs several consensus tracking algorithms for the agents with first-order (and second-order) integrator dynamics. We note that both the follower agents and the leader are with linear dynamics, and the leader has an upper bounded external input.Li et al. [11] propose an observer-based algorithm for the problem of consensus tracking for multiagent systems with general linear dynamics. In the recent literature [12], the problem of multiple first-order nonlinear systems tracking several leaders is studied under the assumption that these leaders have no explicit external input. In [13], the consensus tracking problem is studied for the case that the dynamics of both the leader and the followers are of the second-order nonlinearity, under the assumption that the leader has no external input.Nonlinear dynamics are now studied in the consensus problem from various perspectives such as [14–17]. In [16, 17], the effective consensus tracking laws are developed for multiagent systems modeled as higher-order dynamics with nonlinear terms under switching directed topologies. By contrast, this paper discusses the consensus tracking problem for multiagent systems with general nonlinear systems and the very special cases (the first-order and the second-order nonlinear systems) under tree topologies. The network of groups of nonlinear systems is a kind of coupled nonlinear systems with linear coupling (linearly coupled ordinary differential equations) [18] which is widely used in nature and engineering to describe the models of spike-burst neural activity, the transitions of n-patch metapopulation, the dynamics of linearly coupled Chua circuits [13, 18], the coupled oscillator systems [19], epidemiology, ecology [20], and so on.In those papers mentioned above, some focus on the problem that the linear follower agents track a leader who is governed by an external input, yet others focus on the problem that the nonlinear follower agents track a leader who has no explicit external input. In the practical network with a linear or a nonlinear leader, the external input is unavoidable or even is important for guiding the group to behave correctly. Thus, the study of consensus tracking for a group of nonlinear agents with the leader having an external input will be significative. In this paper, we consider the problem of consensus tracking for the network of a group ofN
+
1 identical nonlinear agents, in which one agent indexed by r and governed by its external input is assigned to be the leader, and the other agents indexed by 1
,
…
,
N are regarded as the followers. The nonlinear dynamics of agents in this paper are described by the first-order (resp., the second-order and the general) nonlinear equations like (1) in [12] (resp., (3) in [21] and (1) in [22]) which will be introduced later.We have noted that the intrinsic dynamics of the leader in [12] which is specified by x
˙
r
=
f
(
t
,
x
r
) have no explicit external input, where x
r is the state of the leader, f is the nonlinear vector field, and t is the time. However, it can be interpreted as the fact that each follower has known the detailed measurements of the leader’s external input u
(
t
) all the time and the consensus algorithm for the follower could cancel out the impact of the leader’s external input. Though the equation f
(
t
,
x
r
) is theoretically capable of including the situation of f
(
t
,
x
r
)
+
u
(
t
), the given Lipschitz condition for the f in [12] will limit the choice of the control input u
(
t
) or sometimes there will even be no choice. However, in this paper, we relax this condition and assume that each follower only knows the upper bound of the leader’s input in advance and there are no other limitations. There is a similar situation in [21].Due to the existence of nonlinearity in the agents’ dynamics and the external input of the leader, the existing consensus algorithms are not applicable to our problem. By synthetically using the Lipschitz conditions, the variable structure technique [6], the feedback linearization technique [22], and the Lyapunov theory, all three control algorithms for consensus tracking under the undirect or the tree shaped communication topology are effectively designed.The remainder of the paper is organized as follows. In Section2, some notations and basic concepts in graph theory that will be used in this paper are introduced. Section 3 is the main text that establishes the consensus tracking algorithms for nonlinear systems. Section 4 shows several simulation results. Finaly, Section 5 draws conclusions to this paper.


## 2. Background and Preliminaries

We use∥
·
∥ to denote the Euclidean norm and ∥
·
∥
1 1-norm. Let 1
n, 0
n denote n
×
1 column vectors with all components being ones and zeros, respectively. I
n is used to denote the n
×
n identity matrix. And ⊗ stands for the kronecker product. A function f is said to be of class C
k if the derivatives f
′
,
f
′
′
,
…
,
f
(
k
) exist and are continuous. The superscript T means the transpose of a matrix. For a matrix M, M
>
0 denotes that M is positive definite.Since graph theory plays an important role in modeling the communication topology of the network of the multiagent systems, some basic concepts in graph theory that will be used in this paper are introduced in the following.In the problem of nonlinear consensus tracking, a kind of communication topology ofN follower agents is modeled as an undirected graph G
=
{
V
,
E
,
A
}, where V
=
{
1,2
,
…
,
i
,
…
,
N
} is a set of N integers, with the number i which means the ith vertex representing the ith agent, and E
⊂
V
×
V is an edge set in which each edge is denoted by a pair of vertices (
i
,
j
). In an undirected graph, (
i
,
j
)
∈
E is equivalent to (
j
,
i
)
∈
E. The set of neighbors of agent i is denoted by N
i
=
{
j
∈
V
:
(
i
,
j
)
∈
E
}. A
=
[
a
i
j
]
∈
R
N
×
N is a weighted adjacency matrix of G, where a
i
i
=
0 and a
i
j
=
1 if (
i
,
j
)
∈
V or 0 otherwise. The Laplacian of G is defined as L
=
D
-
A, where D
=
diag
⁡
(
de
g
1
,
…
,
de
g
N
) and de
g
i
=
∑
j
=
1
N
a
i
j [23]. A path in an undirected graph G is a sequence of edges in the form of  (
i
1
,
i
2
)
,
(
i
2
,
i
3
)
,
…, where i
k
∈
V. An undirected graph is connected if there exists a path between every two vertices.For a directed graph,(
i
,
j
)
∈
E does not necessarily mean (
j
,
i
)
∈
E. A directed path is a sequence of directed edges in the form of (
i
1
,
i
2
)
,
(
i
2
,
i
3
)
,
…, where i
k
∈
V. The tree shaped communication topology is modeled as the tree shaped graph (a directed graph) in which each vertex has only one parent vertex except for one vertex called the root. To study the problem of nonlinear consensus tracking, a leader adjacency matrix H is defined as H
=
diag
⁡
(
h
1
,
h
2
,
…
,
h
i
,
…
,
h
N
), where h
i
=
1 if the leader’s information is available to the ith follower agent and h
i
=
0 otherwise. The undirect graph G with one additional vertex representing a leader is used to model the leader-follower communication topologies in this paper.


## 3. Nonlinear Consensus Tracking

### 3.1. Consensus Tracking for the First-Order Nonlinear Dynamics

We start by considering the first-order nonlinearity case:N followers labeled as 1,2
,
…
,
N are described by the following first-order nonlinear ordinary differential equation:
(1)
x
˙
i
=
f
(
t
,
x
i
)
+
u
i
,
i
=
1
,
…
,
N
,
where x
i
∈
R
n is the state vector representing the position of agent i, f
:
R
n
×
R
→
R
n is a uniformly continuously differentiable vector-valued function, and u
i
∈
R
n is the control input. The communication topology of these N followers is modeled as an undirected graph G
=
{
V
,
E
,
A
}. The corresponding Laplacian matrix and adjacency matrix are denoted by L and A. We aim to design a control algorithm u
i, i
=
1
,
…
,
N, such that
(2)
lim
⁡
t
→
∞
∥
x
i
(
t
)
-
x
r
(
t
)
∥
=
0
,
where x
r
∈
R
n is the state vector representing the position of the leader which is specified by
(3)
x
˙
r
=
f
(
t
,
x
r
)
+
u
r
.
Note that u
r is the external input of the leader and u
r
≠
0
n. If the limit (2) is finally achieved, then we say that the first-order nonlinear followers (1) with the control algorithm asymptotically track the leader (3).As in most existing works on networks of nonlinear agents [12, 13, 21, 24], we give an assumption of Lipschitz-like condition as follows.Assumption 1.
There existsρ
>
0 such that the vector field f
:
R
n
×
R
→
R
n satisfies ∥
f
(
t
,
p
)
-
f
(
t
,
q
)
∥
≤
ρ
∥
p
-
q
∥, for all p, q
∈
R
n.In order to guarantee theseN followers could track the leader, the necessary connectivity is required from the point of view of graph theory. For this, we further make the following assumption.Assumption 2.
The undirected graphG which models the network topology of N followers is connected and at least one follower is informed about the state of the leader.To deal with the problem of consensus tracking for the network with the first-order nonlinear agents, we propose a control algorithm for (1) as
(4)
u
i
=
-
α
i
(
t
)
[
∑
j
∈
N
i
‍
(
x
i
-
x
j
)
+
h
i
(
x
i
-
x
r
)
]
-
ω
sgn
⁡
[
∑
j
∈
N
i
‍
(
x
i
-
x
j
)
+
h
i
(
x
i
-
x
r
)
]
,
where α
i
(
t
) is the adaptive gain [13] for agent i and it is specified by
(5)
α
˙
i
(
t
)
=
β
i
[
∑
j
∈
N
i
‍
(
x
i
-
x
j
)
+
h
i
(
x
i
-
x
r
)
]
T
×
[
∑
j
∈
N
i
‍
(
x
i
-
x
j
)
+
h
i
(
x
i
-
x
r
)
]
,
where sgn
⁡
(
·
) is the signum function, ω
>
∥
u
r
∥, β
i is any positive constant, and h
i is used for describing whether agent i is informed about the state of the leader, as we introduced in Section 2, and we denote that H
=
diag
⁡
(
h
1
,
h
2
,
…
,
h
i
,
…
,
h
N
). The column stack vectors of x
i
(
i
∈
V
) and f
(
t
,
x
i
)
(
i
∈
V
) are denoted by x and F
(
t
,
x
), respectively. By applying the control algorithms (4) and (5) into the input of the system (1), the closed-loop system is then rewritten as follows:
(6)
x
˙
=
-
(
α
(
t
)
⊗
I
n
)
[
(
L
⊗
I
n
)
x
+
(
H
⊗
I
n
)
(
x
-
(
1
N
⊗
I
n
)
x
r
)
]
-
ω
sgn
⁡
[
(
L
⊗
I
n
)
x
+
(
H
⊗
I
n
)
(
x
-
(
1
N
⊗
I
n
)
x
r
)
]
+
F
(
t
,
x
)
,
where α
(
t
)
≜
diag
⁡
(
α
1
(
t
)
,
α
2
(
t
)
,
…
,
α
N
(
t
)
).Then, the main result on the problem of consensus tracking for the network with first-order nonlinear agents is proposed by the following theorem.Theorem 3.
If Assumptions1 and 2 are satisfied, then the first-order nonlinear followers (1) with the control algorithms (4) and (5) asymptotically track the leader (3).Proof.
Letx
~
i
=
x
i
-
x
r and x
~
≜
[
x
~
1
,
x
~
2
,
…
,
x
~
N
]
T. Then, we have
(7)
x
~
˙
=
F
(
t
,
x
)
-
1
N
⊗
f
(
t
,
x
r
)
-
(
α
(
t
)
⊗
I
n
)
[
(
L
+
H
)
⊗
I
n
]
x
~
-
ω
sgn
⁡
(
[
(
L
+
H
)
⊗
I
n
]
x
~
)
-
(
1
N
⊗
I
n
)
u
r
.
From Assumption 2 and Lemma  1 in [13], the matrix M
≜
L
+
H is positive definite. Consider a Lyapunov function candidate
(8)
V
=
1
2
x
~
T
(
M
⊗
I
n
)
x
~
+
∑
i
=
1
N
‍
1
2
β
i
(
α
i
(
t
)
-
α
0
)
2
,
where α
0 is chosen such that
(9)
α
0
≥
ρ
λ
max
⁡
(
M
)
λ
min
⁡
(
M
)
2
.
The derivative of V along the system (7) satisfies
(10)
V
˙
(
t
)
=
x
~
T
(
M
⊗
I
n
)
x
~
˙
+
1
β
i
∑
i
=
1
n
‍
(
α
i
(
t
)
-
α
0
)
α
˙
i
(
t
)
=
x
~
T
(
M
⊗
I
n
)
[
F
(
t
,
x
)
-
1
N
⊗
f
(
t
,
x
r
)
]
-
[
(
M
⊗
I
n
)
x
~
]
T
(
α
(
t
)
⊗
I
n
)
(
M
⊗
I
n
)
x
~
-
ω
[
(
M
⊗
I
n
)
x
~
]
T
[
sgn
⁡
(
(
M
⊗
I
n
)
x
~
)
+
(
1
N
⊗
I
n
)
u
r
]
+
[
(
M
⊗
I
n
)
x
~
]
T
(
α
(
t
)
⊗
I
n
)
[
(
M
⊗
I
n
)
x
~
]
-
α
0
[
(
M
⊗
I
n
)
x
~
]
T
[
(
M
⊗
I
n
)
x
~
]
≤
ρ
λ
max
⁡
(
M
)
∥
x
~
∥
2
-
(
ω
-
∥
u
r
∥
)
∥
(
M
⊗
I
n
)
x
~
∥
1
-
α
0
λ
min
⁡
(
M
)
2
∥
x
~
∥
2
.
From (9) and ω
>
∥
u
r
∥, it is easy to obtain that V
˙
<
0. Therefore, x
~
→
0 as t
→
∞. It follows that lim
⁡
t
→
∞
∥
x
i
(
t
)
-
x
r
(
t
)
∥
=
0. That is, the first-order nonlinear followers (1) track the leader (3) asymptotically.


### 3.2. Consensus Tracking for the Second-Order Nonlinear Dynamics

Next, we discuss the second-order nonlinearity case. Suppose that each of theN followers is described by
(11)
x
˙
i
=
v
i
,
v
˙
i
=
f
(
t
,
x
i
,
v
i
)
+
u
i
,
where, i
=
1
,
…
,
N, x
i
∈
R and v
i
∈
R are the state representing the position and the velocity of agent i, respectively. f
:
R
×
R
×
R
→
R is the intrinsic dynamics. u
i
∈
R is the control input. The problem is to design u
i for each of the N followers to track the leader which is specified by
(12)
x
˙
r
=
v
r
,
v
˙
r
=
f
(
t
,
x
r
,
v
r
)
+
u
r
,
such that, for each agent i,
(13)
lim
⁡
t
→
∞
∥
x
i
(
t
)
-
x
r
(
t
)
∥
=
0
,
lim
⁡
t
→
∞
∥
v
i
(
t
)
-
v
r
(
t
)
∥
=
0
,
where x
r
∈
R and v
r
∈
R are, respectively, the position and velocity of the leader. If limits (13) are finally achieved, then we say that the second-order nonlinear followers (11) with the designed control algorithm asymptotically track the leader (12). Before studying this problem, we give some assumptions.Assumption 4.
There existρ
1
>
0 and ρ
2
>
0 such that the vector field f
:
R
×
R
×
R
→
R satisfies ∥
f
(
t
,
x
,
y
)
-
f
(
t
,
z
,
w
)
∥
≤
ρ
1
∥
x
-
z
∥
+
ρ
2
∥
y
-
w
∥, for all x
,
y
,
z
,
w
∈
R.Remark 5.
Compared with Assumption1, it is easy to see that both of the assumptions are Lipschitz-like conditions.Similar to the first-order case in Section3.1, we give the same assumption on communication topology of the network as Assumption 2 to guarantee these N followers with dynamics of (11) could track the leader with dynamics of (12). And M
=
L
+
H here also represents the communication topology of the network, where L and H are the same as in Section 3.1.Then, we propose the following control algorithm applied for the system (11):
(14)
u
i
=
-
∑
j
=
1
N
‍
a
i
j
[
(
x
i
-
x
j
)
+
α
(
v
i
-
v
j
)
]
-
h
i
[
(
x
i
-
x
r
)
+
α
(
v
i
-
v
r
)
]
-
w
sgn
⁡
{
∑
j
=
1
N
‍
a
i
j
[
γ
(
x
i
-
x
j
)
+
(
v
i
-
v
j
)
]
h
h
h
h
h
h
h
h
h
h
+
h
i
[
γ
(
x
i
-
x
r
)
+
(
v
i
-
v
r
)
]
∑
j
=
1
N
‍
a
i
j
}
,
where α
>
0 is a constant gain, γ is a positive constant which is to be designed, and ω is a constant that satisfies ω
>
∥
u
r
∥. Before going any further, we define two matrices P
γ and Q
γ associated with γ. For a matrix M (let λ
M be the maximal eigenvalue of the M
) and the constants α
>
0, ρ
1
>
0 and ρ
2
>
0, P
γ, and Q
γ are defined by
(15)
P
γ
≜
[
1
2
(
M
2
-
γ
λ
M
I
-
λ
M
ρ
1
ρ
2
I
-
α
γ
M
2
)
γ
2
M
γ
2
M
1
2
M
]
,
Q
γ
≜
[
γ
M
2
-
λ
M
2
γ
2
I
-
λ
M
2
ρ
1
2
I
0
N
×
N
0
N
×
N
α
M
2
-
γ
M
-
λ
M
2
I
-
λ
M
2
ρ
2
2
I
]
.
Then, we have the following lemma.Lemma 6.
Given the matrixM and the constants ρ
1
>
0, ρ
2
>
0, for any constant α
>
0, if γ satisfies
(16)
γ
∈
{
γ
∣
max
⁡
(
0
,
c
4
)
<
γ
<
min
⁡
{
c
1
,
c
2
,
c
3
,
c
5
,
c
6
}
}
or
(17)
γ
∈
{
γ
∣
max
⁡
(
0
,
c
4
,
c
5
,
c
6
)
<
γ
<
min
⁡
{
c
1
,
c
2
,
c
3
}
}
,
then P
γ
=
P
γ
T
>
0 and Q
γ
=
Q
γ
T
>
0, where
(18)
c
1
≜
1
+
λ
M
-
ρ
1
ρ
2
1
+
α
λ
M
,
c
2
≜
(
1
+
α
λ
M
)
2
4
+
λ
M
-
ρ
1
ρ
2
-
(
1
+
α
λ
M
)
2
,
c
3
≜
λ
M
2
+
2
(
α
-
1
)
λ
M
-
(
ρ
1
2
+
ρ
2
2
)
+
(
λ
M
-
1
)
,
c
4
≜
λ
M
-
λ
M
2
-
ρ
1
2
,
c
5
≜
λ
M
+
λ
M
2
-
ρ
1
2
,
c
6
≜
α
λ
M
-
1
2
(
1
+
ρ
1
2
)
.Proof.
SinceM is a positive definite matrix, it can be diagonalized as M
=
Γ
-
1
Λ
Γ, where Λ
=
diag
⁡
(
λ
1
,
λ
2
,
…
,
λ
N
) and λ
1
≥
λ
2
≥
⋯
≥
λ
N. We define that
(19)
Γ
~
=
[
Γ
0
N
×
N
0
N
×
N
Γ
]
.
It then follows that
(20)
P
γ
=
Γ
~
-
1
[
1
2
(
Λ
2
-
γ
λ
M
I
-
λ
M
ρ
1
ρ
2
I
-
α
γ
Λ
2
)
γ
2
Λ
γ
2
Λ
1
2
Λ
]
︸
P
~
γ
Γ
~
.
Let η be any eigenvalue of the matrix P
~
γ. Since Λ is a diagonal matrix and P
~
γ is symmetric, it follows that η is real and satisfies
(21)
[
η
-
1
2
(
λ
i
2
-
γ
λ
M
-
λ
M
ρ
1
ρ
2
-
α
γ
λ
i
2
)
]
[
η
-
1
2
λ
i
]
-
γ
2
4
λ
i
2
=
0
.
That is,
(22)
η
2
-
[
1
2
(
λ
i
2
-
γ
λ
M
-
λ
M
ρ
1
ρ
2
-
α
γ
λ
i
2
)
+
1
2
λ
i
]
η
+
1
4
λ
i
(
λ
i
2
-
γ
λ
M
-
λ
M
ρ
1
ρ
2
-
α
γ
λ
i
2
)
-
γ
2
4
λ
i
2
=
0
.
Note that η
>
0 if and only if
(23)
1
2
(
λ
i
2
-
γ
λ
M
-
λ
M
ρ
1
ρ
2
-
α
γ
λ
i
2
)
+
1
2
λ
i
>
0
,
1
4
λ
i
(
λ
i
2
-
γ
λ
M
-
λ
M
ρ
1
ρ
2
-
α
γ
λ
i
2
)
-
γ
2
4
λ
i
2
>
0
,
which means
(24)
γ
<
1
+
λ
M
-
ρ
1
ρ
2
1
+
α
λ
M
≜
c
1
,
γ
<
(
1
+
α
λ
M
)
2
4
+
λ
M
-
ρ
1
ρ
2
-
(
1
+
α
λ
M
)
2
≜
c
2
.
By a similar analysis, we have
(25)
Q
γ
=
Γ
~
-
1
[
γ
Λ
2
-
λ
M
2
γ
2
-
λ
M
2
ρ
1
2
0
N
×
N
0
N
×
N
α
Λ
2
-
γ
Λ
-
λ
M
2
-
λ
M
2
ρ
2
2
]
︸
Q
~
γ
Γ
~
.
Let μ be any eigenvalue of the matrix Q
~
γ. Then, one has
(26)
[
μ
-
(
γ
λ
i
2
-
λ
M
2
γ
2
-
λ
M
2
ρ
1
2
)
]
×
[
μ
-
(
α
λ
i
2
-
γ
λ
i
-
λ
M
2
-
λ
M
2
ρ
2
2
)
]
=
0
.
And μ
>
0 if and only if
(27)
γ
λ
i
2
-
λ
M
2
γ
2
-
λ
M
2
ρ
1
2
+
α
λ
i
2
-
γ
λ
i
-
λ
M
2
-
λ
M
2
ρ
2
2
>
0
,
(
γ
λ
i
2
-
λ
M
2
γ
2
-
λ
M
2
ρ
1
2
)
(
α
λ
i
2
-
γ
λ
i
-
λ
M
2
-
λ
M
2
ρ
2
2
)
>
0
,
which means
(28)
γ
<
λ
M
2
+
2
(
α
-
1
)
λ
M
-
(
ρ
1
2
+
ρ
2
2
)
+
(
λ
M
-
1
)
≜
c
3
,
c
4
≜
λ
M
-
λ
M
2
-
ρ
1
2
<
γ
<
λ
M
+
λ
M
2
-
ρ
1
2
≜
c
5
,
γ
<
α
λ
M
-
1
2
(
1
+
ρ
1
2
)
≜
c
6
,
or
(29)
γ
<
λ
M
2
+
2
(
α
-
1
)
λ
M
-
(
ρ
1
2
+
ρ
2
2
)
+
(
λ
M
-
1
)
≜
c
3
,
γ
>
λ
M
+
λ
M
2
-
ρ
1
2
≜
c
5
,
γ
>
α
λ
M
-
1
2
(
1
+
ρ
1
2
)
≜
c
6
.
In summary, if γ satisfies γ
∈
{
γ
∣
max
⁡
(
0
,
c
4
)
<
γ
<
min
⁡
{
c
1
,
c
2
,
c
3
,
c
5
,
c
6
}
} or γ
∈
{
γ
∣
max
⁡
(
0
,
c
5
,
c
6
)
<
γ
<
min
⁡
{
c
1
,
c
2
,
c
3
}
}, then both the matrix P
~
γ and the matrix Q
~
γ are positive definite. Since P
~
γ and Q
~
γ have the same eigenvalues as that of P
γ and Q
γ, we have P
γ
=
P
γ
T
>
0 and Q
γ
=
Q
γ
T
>
0 when γ satisfies γ
∈
{
γ
∣
max
⁡
(
0
,
c
4
)
<
γ
<
min
⁡
{
c
1
,
c
2
,
c
3
,
c
5
,
c
6
}
} or γ
∈
{
γ
∣
max
⁡
(
0
,
c
5
,
c
6
)
<
γ
<
min
⁡
{
c
1
,
c
2
,
c
3
}
}.Then, the main result follows.Theorem 7.
Suppose that Assumptions2 and 4 are satisfied; if α
>
0 and γ
∈
{
max
⁡
{
0
,
c
4
}
<
γ
<
min
⁡
{
c
1
,
c
2
,
c
3
,
c
5
,
c
6
}
}
∪
{
max
⁡
(
0
,
c
5
,
c
6
)
<
γ
<
min
⁡
{
c
1
,
c
2
,
c
3
}
}, where c
i
,
i
=
1,2
,
…
,
6, are defined as in Lemma 6, then the second-order nonlinear followers (11) with the control algorithms (14) asymptotically track the leader (12).Proof.
Letx
~
i
=
x
i
-
x
r and v
~
i
=
v
i
-
v
r. And let x
~
=
[
x
~
1
,
x
~
2
,
…
,
x
~
N
]
T, v
~
=
[
v
~
1
,
v
~
2
,
…
,
v
~
N
]
T. We rewrite the closed-loop system of (11) using the control algorithm (14) as
(30)
x
~
˙
=
v
~
,
v
~
˙
=
F
(
t
,
x
,
v
)
-
1
N
⊗
f
(
t
,
x
r
,
v
r
)
-
M
x
~
-
α
M
v
~
-
β
sgn
⁡
{
M
(
γ
x
~
+
v
~
)
}
-
1
N
⊗
u
r
,
where
(31)
F
(
t
,
x
,
v
)
=
[
f
(
t
,
x
1
,
v
1
)
,
f
(
t
,
x
2
,
v
2
)
,
…
,
f
(
t
,
x
N
,
v
N
)
]
T
.
Consider a Lyapunov function candidate
(32)
V
=
[
x
~
T
v
~
T
]
P
γ
[
x
~
v
~
]
=
1
2
x
~
T
(
M
2
-
γ
λ
M
I
-
λ
M
ρ
1
ρ
2
I
-
α
γ
M
2
)
x
~
+
x
~
T
γ
M
v
~
+
1
2
v
~
T
M
v
~
.
From Lemma 6, one has V
>
0. The derivative of V along the system (30) is
(33)
V
˙
=
x
~
T
(
M
2
-
γ
λ
M
I
-
λ
M
ρ
1
ρ
2
I
-
α
γ
M
2
)
v
~
+
v
~
T
γ
M
v
~
T
+
x
~
T
γ
M
v
~
˙
+
v
~
T
M
v
~
˙
=
x
~
T
(
M
2
-
γ
λ
M
I
-
λ
M
ρ
1
ρ
2
I
-
α
γ
M
2
)
v
~
+
v
~
T
γ
M
v
~
T
+
(
γ
x
~
T
+
v
~
T
)
M
×
{
F
(
t
,
x
,
v
)
-
1
N
⊗
f
(
t
,
x
r
,
v
r
)
}
-
(
γ
x
~
T
+
v
~
T
)
M
(
M
x
~
+
α
M
v
~
)
-
(
γ
x
~
T
+
v
~
T
)
M
{
β
sgn
⁡
[
M
(
γ
x
~
+
v
~
)
]
+
1
N
⊗
u
r
}
.
For the vectors x
,
y
∈
R
N and the matrix 0
<
M
=
M
T
∈
R
N
×
N, we define
(34)
〈
x
,
y
〉
=
x
T
M
y
,
∥
x
∥
M
=
〈
x
,
x
〉
1
/
2
=
(
x
T
M
x
)
1
/
2
.
From Cauchy-Schwarz inequality, one has
(35)
∥
x
y
∥
M
2
≤
∥
x
∥
M
∥
y
∥
M
,
x
T
M
y
≤
(
x
T
M
x
)
1
/
2
×
(
y
T
M
y
)
1
/
2
,
(
a
b
)
1
/
2
≤
1
2
(
a
+
b
)
.
It follows that
(36)
(
γ
x
~
T
+
v
~
T
)
M
{
F
(
t
,
x
,
v
)
-
1
N
⊗
f
(
t
,
x
r
,
v
r
)
}
≤
(
γ
x
~
T
+
v
~
T
)
M
(
γ
x
~
+
v
~
)
(
ρ
1
x
~
T
+
ρ
2
v
~
T
)
M
(
ρ
1
x
~
+
ρ
2
v
~
)
≤
λ
M
2
×
(
γ
2
x
~
T
x
~
+
2
γ
x
~
T
v
~
+
v
~
T
v
~
+
ρ
1
2
x
~
T
x
~
+
2
ρ
1
ρ
2
x
~
T
v
~
+
ρ
2
2
v
~
T
v
~
)
=
λ
M
γ
2
2
x
~
T
x
~
+
λ
M
γ
x
~
T
v
~
+
λ
M
2
v
~
T
v
~
+
λ
M
2
ρ
1
2
x
~
T
x
~
+
λ
M
ρ
1
ρ
2
x
~
T
v
~
+
λ
M
2
ρ
2
2
v
~
T
v
~
,
V
˙
≤
x
~
T
(
M
2
-
γ
λ
M
I
-
λ
M
ρ
1
ρ
2
I
-
α
γ
M
2
)
v
~
+
v
~
T
γ
M
v
~
T
-
(
γ
x
~
T
+
v
~
T
)
M
2
(
x
~
+
α
v
~
)
+
λ
M
γ
2
2
x
~
T
x
~
+
λ
M
γ
x
~
T
v
~
+
λ
M
2
v
~
T
v
~
+
λ
M
2
ρ
1
2
x
~
T
x
~
+
λ
M
ρ
1
ρ
2
x
~
T
v
~
+
λ
M
2
ρ
2
2
v
~
T
v
~
-
(
γ
x
~
T
+
v
~
T
)
M
{
β
sgn
⁡
{
M
(
γ
x
~
+
v
~
)
}
+
1
N
⊗
u
r
}
=
x
~
T
M
2
v
~
-
γ
λ
M
x
~
T
v
~
-
λ
M
ρ
1
ρ
2
x
~
T
v
~
-
α
γ
x
~
T
M
2
v
~
+
v
~
T
γ
M
v
~
T
-
γ
x
~
T
M
2
x
~
-
x
~
T
M
2
v
~
-
γ
α
x
~
T
M
2
v
~
-
α
v
~
T
M
2
v
~
+
λ
M
γ
2
2
x
~
T
x
~
+
λ
M
γ
x
~
T
v
~
+
λ
M
2
v
~
T
v
~
+
λ
M
2
ρ
1
2
x
~
T
x
~
+
λ
M
ρ
1
ρ
2
x
~
T
v
~
+
λ
M
2
ρ
2
2
v
~
T
v
~
-
(
β
-
∥
u
r
∥
)
∥
M
(
γ
x
~
+
v
~
)
∥
1
=
-
[
x
~
T
v
~
T
]
Q
γ
[
x
~
v
~
]
-
(
β
-
∥
u
r
∥
)
∥
M
(
γ
x
~
+
v
~
)
∥
1
.
From Lemma 6 that Q
γ
>
0 and β
-
∥
u
r
∥
>
0, we have V
˙
<
0. Equivalently, it follows that as t
→
∞, x
~
i
→
0, v
~
i
→
0, which means x
i
→
x
r, v
i
→
v
r as t
→
∞. And then the second-order nonlinear followers (11) with the control algorithms (14) asymptotically track the leader (12).Remark 8.
In order to deal with the nonlinear term of the agents’ dynamics in Theorem7, one key procedure is the definition of the inner product (34) and the application of Cauchy-Schwarz inequality.Remark 9.
The result in Theorem7 for multiagent systems with x
i
∈
R and v
i
∈
R is also suitable for agents with dynamics evolved in higher-order dimension; that is, x
i
∈
R
n and v
i
∈
R
n.


### 3.3. Consensus Tracking for the General Nonlinear Dynamics

In the general nonlinear case, suppose that a network system withN followers represented by the following nonlinear equation:
(37)
x
˙
i
=
f
(
x
i
,
u
i
)
,
i
=
1,2
,
…
,
N
,
where x
i
∈
R
n is the state vector of the ith follower and u
i
∈
R
p is the control input. And a leader is given by
(38)
x
˙
r
=
f
(
x
r
,
u
r
)
,
where x
r
∈
R
n and u
r
∈
R
p are, respectively, the state and the control input of the leader. The function f
(
x
i
,
u
i
) will be C
2 with regard to x
i and u
i, and so is f
(
x
r
,
u
r
). We aim to give an explicit control law u
i for each follower such that
(39)
lim
⁡
t
→
∞
∥
x
i
(
t
)
-
x
r
(
t
)
∥
=
0
.
If the limit (39) is finally achieved, then we say that the general nonlinear followers (37) with the control algorithm asymptotically track the leader  (38).Remark 10.
Note that the differential equation (37) can describe the models of many kinds of mechanical system such as nonholonomic system and underactuated system.Throughout the subsequent analysis we assume that the network topology satisfies the following two assumptions.Assumption 11.
The graph of the network topology is tree shaped with the leader as the root node, where the tree shaped graph means each node has only one parent node except the root node.Assumption 12.
For the network system, each agent knows the measurement of the control input of its parent agent at the same time.Assumption12 illustrates that each agent is a cooperative partner with its neighbors. Due to the very general nonlinear dynamics and the goal of nonlinear consensus tracking, it is necessary for an agent to know the input of its parent agent. Motivated by the consensus analysis in [25], where the tool of incidence matrix is used to model the error system, we number the edges in the tree shaped graph according to the length of the path which is indirectly connected to the root node shown in Figure 4.In order to propose the consensus tracking algorithm for agents (37), we make some preparation. The following analysis is based on theproposition
1 in [22]. For the tree shaped graph, each follower node i in the form of (37) tracks the trajectory of its parent node j in the form of (37) (or (38)), where both x
i
(
t
), x
j
(
t
) and u
i
(
t
), u
j
(
t
) are bounded. And we denote
(40)
A
i
j
(
t
)
:
=
∂
f
∂
x
i
(
x
j
(
t
)
,
u
j
(
t
)
)
,
B
i
j
(
t
)
:
=
∂
f
∂
u
i
(
x
j
(
t
)
,
u
j
(
t
)
)
.LetΦ
i
j
(
t
,
t
0
)
∈
R
n
×
n
×
R be the state transition matrix of A
i
j
(
t
); that is, Φ
i
j
(
t
,
t
0
) satisfies Φ
˙
i
j
(
t
,
t
0
)
=
A
i
j
(
t
)
Φ
i
j
(
t
,
t
0
) with Φ
i
j
(
t
0
,
t
0
)
=
I. Further, for a given constant α
>
0, we define
(41)
H
i
j
(
t
0
,
t
)
=
∫
t
0
t
‍
exp
⁡
(
6
α
(
t
0
-
τ
)
)
Φ
i
j
(
t
0
,
τ
)
B
i
j
(
τ
)
B
i
j
(
τ
)
T
Φ
i
j
(
t
0
,
τ
)
T
d
τ
.
If there exists a constant δ such that H
i
j
(
t
,
t
+
δ
) is bounded away from singularity uniformly in t, then define P
i
j
(
t
) as follows:
(42)
P
i
j
(
t
)
:
=
H
i
j
-
1
(
t
,
t
+
δ
)
.If there exist two numbersp
i
j
m and p
i
j
M such that
(43)
0
<
p
i
j
m
I
<
P
i
j
(
t
)
<
p
i
j
M
I
,
∀
t
∈
R
+
,
then, for any function γ
i
j
(
t
)
:
R
+
→
[
1
/
2
,
∞
), continuous and bounded, we propose the following linear time-varying feedback control law:
(44)
u
i
(
t
)
=
u
j
(
t
)
-
γ
i
j
(
t
)
B
i
j
(
t
)
T
P
i
j
(
t
)
[
x
i
(
t
)
-
x
j
(
t
)
]
.
Now we have the main result as follows.Theorem 13.
If Assumptions11 and 12 are satisfied, then the general nonlinear followers (37) with the control algorithms (44) asymptotically track the leader (38).Proof.
Let(45)
x
i
(
t
)
-
x
j
(
t
)
=
x
~
i
j
(
t
)
,
u
i
(
t
)
-
u
j
(
t
)
=
u
~
i
j
(
t
)
,
where x
j and u
j are the state and the input of agent j and the agent j is the parent agent of agent i. For simplicity, we denote x
~
i
j
(
t
) in the multiagent systems by e
k
(
t
), k
=
1,2
,
…
,
m, like in Figure 4, where m is the number of edges in the graph of the network topology, and e
=
[
e
1
,
e
2
,
…
,
e
m
]
T. Similarly, let P
(
t
)
=
diag
⁡
(
P
1
(
t
)
,
P
2
(
t
)
,
…
,
P
m
(
t
)
), where P
k
(
t
), k
=
1,2
,
…
,
m, represent the matrix P
i
j
(
t
), i
∈
V
,
j
∈
V
∪
{
r
} (r represents the leader in the network), and each is described by (42). Consider a Lyapunov function candidate
(46)
V
=
∑
k
=
1
m
‍
V
k
=
∑
k
=
1
m
‍
e
k
T
P
k
e
k
.
Note that
(47)
u
~
k
(
t
)
=
u
~
i
j
(
t
)
=
-
γ
i
j
(
t
)
B
i
j
(
t
)
T
P
i
j
(
t
)
x
~
i
j
(
t
)
=
-
γ
k
(
t
)
B
k
(
t
)
T
P
k
(
t
)
e
k
(
t
)
.
In addition, one has
(48)
e
˙
k
(
t
)
=
A
k
(
t
)
e
k
(
t
)
+
B
k
(
t
)
u
~
k
(
t
)
+
o
(
e
k
(
t
)
,
u
~
k
(
t
)
,
t
)
,
P
˙
k
(
t
)
=
-
P
k
(
t
)
H
˙
k
(
t
)
P
k
(
t
)
,
H
˙
k
(
t
)
=
H
˙
i
j
(
t
,
t
+
δ
)
=
6
α
H
k
(
t
)
+
A
k
(
t
)
H
k
(
t
)
+
H
k
(
t
)
A
k
(
t
)
T
+
exp
⁡
(
-
6
α
δ
)
Φ
k
(
t
,
t
+
δ
)
B
k
(
t
+
δ
)
×
B
k
(
t
+
δ
)
T
Φ
k
(
t
,
t
+
δ
)
T
-
B
k
(
t
)
B
k
(
t
)
T
.
Since γ
k
(
t
)
≥
1
/
2, k
=
1,2
,
…
,
m, from the control algorithm (44) and the notation (45) and
(49)
∥
u
~
k
∥
=
∥
-
γ
k
B
k
T
P
k
e
k
∥
≤
K
∥
e
k
∥
,
K
<
∞
,
we have
(50)
o
(
e
k
(
t
)
,
u
~
k
(
t
)
,
t
)
=
o
^
(
e
k
(
t
)
,
t
)
,
lim
⁡
∥
e
k
∥
→
0
sup
⁡
t
≥
0
∥
o
^
(
e
k
(
t
)
,
t
)
∥
∥
e
k
(
t
)
∥
=
0
.
Then,
(51)
V
˙
k
(
e
k
,
t
)
=
-
e
k
(
t
)
T
6
α
P
k
(
t
)
e
k
(
t
)
-
e
k
(
t
)
T
(
2
γ
k
(
t
)
-
1
)
P
k
(
t
)
B
k
(
t
)
B
k
(
t
)
T
P
k
(
t
)
e
k
(
t
)
-
e
k
(
t
)
T
[
×
B
k
(
t
+
δ
)
T
Φ
k
(
t
,
t
+
δ
)
T
P
k
(
t
)
exp
⁡
(
-
6
α
δ
)
P
k
(
t
)
Φ
k
(
t
,
t
+
δ
)
B
k
(
t
+
δ
)
hhhhhhhhh
h
×
B
k
(
t
+
δ
)
T
Φ
k
(
t
,
t
+
δ
)
T
P
k
(
t
)
]
e
k
(
t
)
+
2
e
k
(
t
)
T
P
k
(
t
)
o
^
(
e
k
(
t
)
,
t
)
≤
-
4
α
p
k
m
∥
e
k
∥
2
.
It follows that V
˙
<
0 and x
~
i
j
→
0, u
~
i
j
→
0 as t
→
∞. At the same time, lim
⁡
t
→
∞
∥
x
i
(
t
)
-
x
r
(
t
)
∥
=
0 is satisfied and the consensus tracking problem is solved.Remark 14.
For an undirected connected graph which contains a tree shaped subgraph, or a directed graph which contains a directed spanning tree, we can choose such a tree as Assumption11 required. However, such a directed tree is unfavorable for implementing the distributed control since in such case each follower has to know the information of the global communication topology. So, it is worth discussing the general undirected (or directed) communication topologies and it will be a direction of the future research.Remark 15.
It has been shown that systems (1) and (11) are the special cases of system (37). However, the analysis for convergence of closed system is completely different. Though, in each case, the communication topologies are relatively simple.


## 3.1. Consensus Tracking for the First-Order Nonlinear Dynamics

We start by considering the first-order nonlinearity case:N followers labeled as 1,2
,
…
,
N are described by the following first-order nonlinear ordinary differential equation:
(1)
x
˙
i
=
f
(
t
,
x
i
)
+
u
i
,
i
=
1
,
…
,
N
,
where x
i
∈
R
n is the state vector representing the position of agent i, f
:
R
n
×
R
→
R
n is a uniformly continuously differentiable vector-valued function, and u
i
∈
R
n is the control input. The communication topology of these N followers is modeled as an undirected graph G
=
{
V
,
E
,
A
}. The corresponding Laplacian matrix and adjacency matrix are denoted by L and A. We aim to design a control algorithm u
i, i
=
1
,
…
,
N, such that
(2)
lim
⁡
t
→
∞
∥
x
i
(
t
)
-
x
r
(
t
)
∥
=
0
,
where x
r
∈
R
n is the state vector representing the position of the leader which is specified by
(3)
x
˙
r
=
f
(
t
,
x
r
)
+
u
r
.
Note that u
r is the external input of the leader and u
r
≠
0
n. If the limit (2) is finally achieved, then we say that the first-order nonlinear followers (1) with the control algorithm asymptotically track the leader (3).As in most existing works on networks of nonlinear agents [12, 13, 21, 24], we give an assumption of Lipschitz-like condition as follows.Assumption 1.
There existsρ
>
0 such that the vector field f
:
R
n
×
R
→
R
n satisfies ∥
f
(
t
,
p
)
-
f
(
t
,
q
)
∥
≤
ρ
∥
p
-
q
∥, for all p, q
∈
R
n.In order to guarantee theseN followers could track the leader, the necessary connectivity is required from the point of view of graph theory. For this, we further make the following assumption.Assumption 2.
The undirected graphG which models the network topology of N followers is connected and at least one follower is informed about the state of the leader.To deal with the problem of consensus tracking for the network with the first-order nonlinear agents, we propose a control algorithm for (1) as
(4)
u
i
=
-
α
i
(
t
)
[
∑
j
∈
N
i
‍
(
x
i
-
x
j
)
+
h
i
(
x
i
-
x
r
)
]
-
ω
sgn
⁡
[
∑
j
∈
N
i
‍
(
x
i
-
x
j
)
+
h
i
(
x
i
-
x
r
)
]
,
where α
i
(
t
) is the adaptive gain [13] for agent i and it is specified by
(5)
α
˙
i
(
t
)
=
β
i
[
∑
j
∈
N
i
‍
(
x
i
-
x
j
)
+
h
i
(
x
i
-
x
r
)
]
T
×
[
∑
j
∈
N
i
‍
(
x
i
-
x
j
)
+
h
i
(
x
i
-
x
r
)
]
,
where sgn
⁡
(
·
) is the signum function, ω
>
∥
u
r
∥, β
i is any positive constant, and h
i is used for describing whether agent i is informed about the state of the leader, as we introduced in Section 2, and we denote that H
=
diag
⁡
(
h
1
,
h
2
,
…
,
h
i
,
…
,
h
N
). The column stack vectors of x
i
(
i
∈
V
) and f
(
t
,
x
i
)
(
i
∈
V
) are denoted by x and F
(
t
,
x
), respectively. By applying the control algorithms (4) and (5) into the input of the system (1), the closed-loop system is then rewritten as follows:
(6)
x
˙
=
-
(
α
(
t
)
⊗
I
n
)
[
(
L
⊗
I
n
)
x
+
(
H
⊗
I
n
)
(
x
-
(
1
N
⊗
I
n
)
x
r
)
]
-
ω
sgn
⁡
[
(
L
⊗
I
n
)
x
+
(
H
⊗
I
n
)
(
x
-
(
1
N
⊗
I
n
)
x
r
)
]
+
F
(
t
,
x
)
,
where α
(
t
)
≜
diag
⁡
(
α
1
(
t
)
,
α
2
(
t
)
,
…
,
α
N
(
t
)
).Then, the main result on the problem of consensus tracking for the network with first-order nonlinear agents is proposed by the following theorem.Theorem 3.
If Assumptions1 and 2 are satisfied, then the first-order nonlinear followers (1) with the control algorithms (4) and (5) asymptotically track the leader (3).Proof.
Letx
~
i
=
x
i
-
x
r and x
~
≜
[
x
~
1
,
x
~
2
,
…
,
x
~
N
]
T. Then, we have
(7)
x
~
˙
=
F
(
t
,
x
)
-
1
N
⊗
f
(
t
,
x
r
)
-
(
α
(
t
)
⊗
I
n
)
[
(
L
+
H
)
⊗
I
n
]
x
~
-
ω
sgn
⁡
(
[
(
L
+
H
)
⊗
I
n
]
x
~
)
-
(
1
N
⊗
I
n
)
u
r
.
From Assumption 2 and Lemma  1 in [13], the matrix M
≜
L
+
H is positive definite. Consider a Lyapunov function candidate
(8)
V
=
1
2
x
~
T
(
M
⊗
I
n
)
x
~
+
∑
i
=
1
N
‍
1
2
β
i
(
α
i
(
t
)
-
α
0
)
2
,
where α
0 is chosen such that
(9)
α
0
≥
ρ
λ
max
⁡
(
M
)
λ
min
⁡
(
M
)
2
.
The derivative of V along the system (7) satisfies
(10)
V
˙
(
t
)
=
x
~
T
(
M
⊗
I
n
)
x
~
˙
+
1
β
i
∑
i
=
1
n
‍
(
α
i
(
t
)
-
α
0
)
α
˙
i
(
t
)
=
x
~
T
(
M
⊗
I
n
)
[
F
(
t
,
x
)
-
1
N
⊗
f
(
t
,
x
r
)
]
-
[
(
M
⊗
I
n
)
x
~
]
T
(
α
(
t
)
⊗
I
n
)
(
M
⊗
I
n
)
x
~
-
ω
[
(
M
⊗
I
n
)
x
~
]
T
[
sgn
⁡
(
(
M
⊗
I
n
)
x
~
)
+
(
1
N
⊗
I
n
)
u
r
]
+
[
(
M
⊗
I
n
)
x
~
]
T
(
α
(
t
)
⊗
I
n
)
[
(
M
⊗
I
n
)
x
~
]
-
α
0
[
(
M
⊗
I
n
)
x
~
]
T
[
(
M
⊗
I
n
)
x
~
]
≤
ρ
λ
max
⁡
(
M
)
∥
x
~
∥
2
-
(
ω
-
∥
u
r
∥
)
∥
(
M
⊗
I
n
)
x
~
∥
1
-
α
0
λ
min
⁡
(
M
)
2
∥
x
~
∥
2
.
From (9) and ω
>
∥
u
r
∥, it is easy to obtain that V
˙
<
0. Therefore, x
~
→
0 as t
→
∞. It follows that lim
⁡
t
→
∞
∥
x
i
(
t
)
-
x
r
(
t
)
∥
=
0. That is, the first-order nonlinear followers (1) track the leader (3) asymptotically.


## 3.2. Consensus Tracking for the Second-Order Nonlinear Dynamics

Next, we discuss the second-order nonlinearity case. Suppose that each of theN followers is described by
(11)
x
˙
i
=
v
i
,
v
˙
i
=
f
(
t
,
x
i
,
v
i
)
+
u
i
,
where, i
=
1
,
…
,
N, x
i
∈
R and v
i
∈
R are the state representing the position and the velocity of agent i, respectively. f
:
R
×
R
×
R
→
R is the intrinsic dynamics. u
i
∈
R is the control input. The problem is to design u
i for each of the N followers to track the leader which is specified by
(12)
x
˙
r
=
v
r
,
v
˙
r
=
f
(
t
,
x
r
,
v
r
)
+
u
r
,
such that, for each agent i,
(13)
lim
⁡
t
→
∞
∥
x
i
(
t
)
-
x
r
(
t
)
∥
=
0
,
lim
⁡
t
→
∞
∥
v
i
(
t
)
-
v
r
(
t
)
∥
=
0
,
where x
r
∈
R and v
r
∈
R are, respectively, the position and velocity of the leader. If limits (13) are finally achieved, then we say that the second-order nonlinear followers (11) with the designed control algorithm asymptotically track the leader (12). Before studying this problem, we give some assumptions.Assumption 4.
There existρ
1
>
0 and ρ
2
>
0 such that the vector field f
:
R
×
R
×
R
→
R satisfies ∥
f
(
t
,
x
,
y
)
-
f
(
t
,
z
,
w
)
∥
≤
ρ
1
∥
x
-
z
∥
+
ρ
2
∥
y
-
w
∥, for all x
,
y
,
z
,
w
∈
R.Remark 5.
Compared with Assumption1, it is easy to see that both of the assumptions are Lipschitz-like conditions.Similar to the first-order case in Section3.1, we give the same assumption on communication topology of the network as Assumption 2 to guarantee these N followers with dynamics of (11) could track the leader with dynamics of (12). And M
=
L
+
H here also represents the communication topology of the network, where L and H are the same as in Section 3.1.Then, we propose the following control algorithm applied for the system (11):
(14)
u
i
=
-
∑
j
=
1
N
‍
a
i
j
[
(
x
i
-
x
j
)
+
α
(
v
i
-
v
j
)
]
-
h
i
[
(
x
i
-
x
r
)
+
α
(
v
i
-
v
r
)
]
-
w
sgn
⁡
{
∑
j
=
1
N
‍
a
i
j
[
γ
(
x
i
-
x
j
)
+
(
v
i
-
v
j
)
]
h
h
h
h
h
h
h
h
h
h
+
h
i
[
γ
(
x
i
-
x
r
)
+
(
v
i
-
v
r
)
]
∑
j
=
1
N
‍
a
i
j
}
,
where α
>
0 is a constant gain, γ is a positive constant which is to be designed, and ω is a constant that satisfies ω
>
∥
u
r
∥. Before going any further, we define two matrices P
γ and Q
γ associated with γ. For a matrix M (let λ
M be the maximal eigenvalue of the M
) and the constants α
>
0, ρ
1
>
0 and ρ
2
>
0, P
γ, and Q
γ are defined by
(15)
P
γ
≜
[
1
2
(
M
2
-
γ
λ
M
I
-
λ
M
ρ
1
ρ
2
I
-
α
γ
M
2
)
γ
2
M
γ
2
M
1
2
M
]
,
Q
γ
≜
[
γ
M
2
-
λ
M
2
γ
2
I
-
λ
M
2
ρ
1
2
I
0
N
×
N
0
N
×
N
α
M
2
-
γ
M
-
λ
M
2
I
-
λ
M
2
ρ
2
2
I
]
.
Then, we have the following lemma.Lemma 6.
Given the matrixM and the constants ρ
1
>
0, ρ
2
>
0, for any constant α
>
0, if γ satisfies
(16)
γ
∈
{
γ
∣
max
⁡
(
0
,
c
4
)
<
γ
<
min
⁡
{
c
1
,
c
2
,
c
3
,
c
5
,
c
6
}
}
or
(17)
γ
∈
{
γ
∣
max
⁡
(
0
,
c
4
,
c
5
,
c
6
)
<
γ
<
min
⁡
{
c
1
,
c
2
,
c
3
}
}
,
then P
γ
=
P
γ
T
>
0 and Q
γ
=
Q
γ
T
>
0, where
(18)
c
1
≜
1
+
λ
M
-
ρ
1
ρ
2
1
+
α
λ
M
,
c
2
≜
(
1
+
α
λ
M
)
2
4
+
λ
M
-
ρ
1
ρ
2
-
(
1
+
α
λ
M
)
2
,
c
3
≜
λ
M
2
+
2
(
α
-
1
)
λ
M
-
(
ρ
1
2
+
ρ
2
2
)
+
(
λ
M
-
1
)
,
c
4
≜
λ
M
-
λ
M
2
-
ρ
1
2
,
c
5
≜
λ
M
+
λ
M
2
-
ρ
1
2
,
c
6
≜
α
λ
M
-
1
2
(
1
+
ρ
1
2
)
.Proof.
SinceM is a positive definite matrix, it can be diagonalized as M
=
Γ
-
1
Λ
Γ, where Λ
=
diag
⁡
(
λ
1
,
λ
2
,
…
,
λ
N
) and λ
1
≥
λ
2
≥
⋯
≥
λ
N. We define that
(19)
Γ
~
=
[
Γ
0
N
×
N
0
N
×
N
Γ
]
.
It then follows that
(20)
P
γ
=
Γ
~
-
1
[
1
2
(
Λ
2
-
γ
λ
M
I
-
λ
M
ρ
1
ρ
2
I
-
α
γ
Λ
2
)
γ
2
Λ
γ
2
Λ
1
2
Λ
]
︸
P
~
γ
Γ
~
.
Let η be any eigenvalue of the matrix P
~
γ. Since Λ is a diagonal matrix and P
~
γ is symmetric, it follows that η is real and satisfies
(21)
[
η
-
1
2
(
λ
i
2
-
γ
λ
M
-
λ
M
ρ
1
ρ
2
-
α
γ
λ
i
2
)
]
[
η
-
1
2
λ
i
]
-
γ
2
4
λ
i
2
=
0
.
That is,
(22)
η
2
-
[
1
2
(
λ
i
2
-
γ
λ
M
-
λ
M
ρ
1
ρ
2
-
α
γ
λ
i
2
)
+
1
2
λ
i
]
η
+
1
4
λ
i
(
λ
i
2
-
γ
λ
M
-
λ
M
ρ
1
ρ
2
-
α
γ
λ
i
2
)
-
γ
2
4
λ
i
2
=
0
.
Note that η
>
0 if and only if
(23)
1
2
(
λ
i
2
-
γ
λ
M
-
λ
M
ρ
1
ρ
2
-
α
γ
λ
i
2
)
+
1
2
λ
i
>
0
,
1
4
λ
i
(
λ
i
2
-
γ
λ
M
-
λ
M
ρ
1
ρ
2
-
α
γ
λ
i
2
)
-
γ
2
4
λ
i
2
>
0
,
which means
(24)
γ
<
1
+
λ
M
-
ρ
1
ρ
2
1
+
α
λ
M
≜
c
1
,
γ
<
(
1
+
α
λ
M
)
2
4
+
λ
M
-
ρ
1
ρ
2
-
(
1
+
α
λ
M
)
2
≜
c
2
.
By a similar analysis, we have
(25)
Q
γ
=
Γ
~
-
1
[
γ
Λ
2
-
λ
M
2
γ
2
-
λ
M
2
ρ
1
2
0
N
×
N
0
N
×
N
α
Λ
2
-
γ
Λ
-
λ
M
2
-
λ
M
2
ρ
2
2
]
︸
Q
~
γ
Γ
~
.
Let μ be any eigenvalue of the matrix Q
~
γ. Then, one has
(26)
[
μ
-
(
γ
λ
i
2
-
λ
M
2
γ
2
-
λ
M
2
ρ
1
2
)
]
×
[
μ
-
(
α
λ
i
2
-
γ
λ
i
-
λ
M
2
-
λ
M
2
ρ
2
2
)
]
=
0
.
And μ
>
0 if and only if
(27)
γ
λ
i
2
-
λ
M
2
γ
2
-
λ
M
2
ρ
1
2
+
α
λ
i
2
-
γ
λ
i
-
λ
M
2
-
λ
M
2
ρ
2
2
>
0
,
(
γ
λ
i
2
-
λ
M
2
γ
2
-
λ
M
2
ρ
1
2
)
(
α
λ
i
2
-
γ
λ
i
-
λ
M
2
-
λ
M
2
ρ
2
2
)
>
0
,
which means
(28)
γ
<
λ
M
2
+
2
(
α
-
1
)
λ
M
-
(
ρ
1
2
+
ρ
2
2
)
+
(
λ
M
-
1
)
≜
c
3
,
c
4
≜
λ
M
-
λ
M
2
-
ρ
1
2
<
γ
<
λ
M
+
λ
M
2
-
ρ
1
2
≜
c
5
,
γ
<
α
λ
M
-
1
2
(
1
+
ρ
1
2
)
≜
c
6
,
or
(29)
γ
<
λ
M
2
+
2
(
α
-
1
)
λ
M
-
(
ρ
1
2
+
ρ
2
2
)
+
(
λ
M
-
1
)
≜
c
3
,
γ
>
λ
M
+
λ
M
2
-
ρ
1
2
≜
c
5
,
γ
>
α
λ
M
-
1
2
(
1
+
ρ
1
2
)
≜
c
6
.
In summary, if γ satisfies γ
∈
{
γ
∣
max
⁡
(
0
,
c
4
)
<
γ
<
min
⁡
{
c
1
,
c
2
,
c
3
,
c
5
,
c
6
}
} or γ
∈
{
γ
∣
max
⁡
(
0
,
c
5
,
c
6
)
<
γ
<
min
⁡
{
c
1
,
c
2
,
c
3
}
}, then both the matrix P
~
γ and the matrix Q
~
γ are positive definite. Since P
~
γ and Q
~
γ have the same eigenvalues as that of P
γ and Q
γ, we have P
γ
=
P
γ
T
>
0 and Q
γ
=
Q
γ
T
>
0 when γ satisfies γ
∈
{
γ
∣
max
⁡
(
0
,
c
4
)
<
γ
<
min
⁡
{
c
1
,
c
2
,
c
3
,
c
5
,
c
6
}
} or γ
∈
{
γ
∣
max
⁡
(
0
,
c
5
,
c
6
)
<
γ
<
min
⁡
{
c
1
,
c
2
,
c
3
}
}.Then, the main result follows.Theorem 7.
Suppose that Assumptions2 and 4 are satisfied; if α
>
0 and γ
∈
{
max
⁡
{
0
,
c
4
}
<
γ
<
min
⁡
{
c
1
,
c
2
,
c
3
,
c
5
,
c
6
}
}
∪
{
max
⁡
(
0
,
c
5
,
c
6
)
<
γ
<
min
⁡
{
c
1
,
c
2
,
c
3
}
}, where c
i
,
i
=
1,2
,
…
,
6, are defined as in Lemma 6, then the second-order nonlinear followers (11) with the control algorithms (14) asymptotically track the leader (12).Proof.
Letx
~
i
=
x
i
-
x
r and v
~
i
=
v
i
-
v
r. And let x
~
=
[
x
~
1
,
x
~
2
,
…
,
x
~
N
]
T, v
~
=
[
v
~
1
,
v
~
2
,
…
,
v
~
N
]
T. We rewrite the closed-loop system of (11) using the control algorithm (14) as
(30)
x
~
˙
=
v
~
,
v
~
˙
=
F
(
t
,
x
,
v
)
-
1
N
⊗
f
(
t
,
x
r
,
v
r
)
-
M
x
~
-
α
M
v
~
-
β
sgn
⁡
{
M
(
γ
x
~
+
v
~
)
}
-
1
N
⊗
u
r
,
where
(31)
F
(
t
,
x
,
v
)
=
[
f
(
t
,
x
1
,
v
1
)
,
f
(
t
,
x
2
,
v
2
)
,
…
,
f
(
t
,
x
N
,
v
N
)
]
T
.
Consider a Lyapunov function candidate
(32)
V
=
[
x
~
T
v
~
T
]
P
γ
[
x
~
v
~
]
=
1
2
x
~
T
(
M
2
-
γ
λ
M
I
-
λ
M
ρ
1
ρ
2
I
-
α
γ
M
2
)
x
~
+
x
~
T
γ
M
v
~
+
1
2
v
~
T
M
v
~
.
From Lemma 6, one has V
>
0. The derivative of V along the system (30) is
(33)
V
˙
=
x
~
T
(
M
2
-
γ
λ
M
I
-
λ
M
ρ
1
ρ
2
I
-
α
γ
M
2
)
v
~
+
v
~
T
γ
M
v
~
T
+
x
~
T
γ
M
v
~
˙
+
v
~
T
M
v
~
˙
=
x
~
T
(
M
2
-
γ
λ
M
I
-
λ
M
ρ
1
ρ
2
I
-
α
γ
M
2
)
v
~
+
v
~
T
γ
M
v
~
T
+
(
γ
x
~
T
+
v
~
T
)
M
×
{
F
(
t
,
x
,
v
)
-
1
N
⊗
f
(
t
,
x
r
,
v
r
)
}
-
(
γ
x
~
T
+
v
~
T
)
M
(
M
x
~
+
α
M
v
~
)
-
(
γ
x
~
T
+
v
~
T
)
M
{
β
sgn
⁡
[
M
(
γ
x
~
+
v
~
)
]
+
1
N
⊗
u
r
}
.
For the vectors x
,
y
∈
R
N and the matrix 0
<
M
=
M
T
∈
R
N
×
N, we define
(34)
〈
x
,
y
〉
=
x
T
M
y
,
∥
x
∥
M
=
〈
x
,
x
〉
1
/
2
=
(
x
T
M
x
)
1
/
2
.
From Cauchy-Schwarz inequality, one has
(35)
∥
x
y
∥
M
2
≤
∥
x
∥
M
∥
y
∥
M
,
x
T
M
y
≤
(
x
T
M
x
)
1
/
2
×
(
y
T
M
y
)
1
/
2
,
(
a
b
)
1
/
2
≤
1
2
(
a
+
b
)
.
It follows that
(36)
(
γ
x
~
T
+
v
~
T
)
M
{
F
(
t
,
x
,
v
)
-
1
N
⊗
f
(
t
,
x
r
,
v
r
)
}
≤
(
γ
x
~
T
+
v
~
T
)
M
(
γ
x
~
+
v
~
)
(
ρ
1
x
~
T
+
ρ
2
v
~
T
)
M
(
ρ
1
x
~
+
ρ
2
v
~
)
≤
λ
M
2
×
(
γ
2
x
~
T
x
~
+
2
γ
x
~
T
v
~
+
v
~
T
v
~
+
ρ
1
2
x
~
T
x
~
+
2
ρ
1
ρ
2
x
~
T
v
~
+
ρ
2
2
v
~
T
v
~
)
=
λ
M
γ
2
2
x
~
T
x
~
+
λ
M
γ
x
~
T
v
~
+
λ
M
2
v
~
T
v
~
+
λ
M
2
ρ
1
2
x
~
T
x
~
+
λ
M
ρ
1
ρ
2
x
~
T
v
~
+
λ
M
2
ρ
2
2
v
~
T
v
~
,
V
˙
≤
x
~
T
(
M
2
-
γ
λ
M
I
-
λ
M
ρ
1
ρ
2
I
-
α
γ
M
2
)
v
~
+
v
~
T
γ
M
v
~
T
-
(
γ
x
~
T
+
v
~
T
)
M
2
(
x
~
+
α
v
~
)
+
λ
M
γ
2
2
x
~
T
x
~
+
λ
M
γ
x
~
T
v
~
+
λ
M
2
v
~
T
v
~
+
λ
M
2
ρ
1
2
x
~
T
x
~
+
λ
M
ρ
1
ρ
2
x
~
T
v
~
+
λ
M
2
ρ
2
2
v
~
T
v
~
-
(
γ
x
~
T
+
v
~
T
)
M
{
β
sgn
⁡
{
M
(
γ
x
~
+
v
~
)
}
+
1
N
⊗
u
r
}
=
x
~
T
M
2
v
~
-
γ
λ
M
x
~
T
v
~
-
λ
M
ρ
1
ρ
2
x
~
T
v
~
-
α
γ
x
~
T
M
2
v
~
+
v
~
T
γ
M
v
~
T
-
γ
x
~
T
M
2
x
~
-
x
~
T
M
2
v
~
-
γ
α
x
~
T
M
2
v
~
-
α
v
~
T
M
2
v
~
+
λ
M
γ
2
2
x
~
T
x
~
+
λ
M
γ
x
~
T
v
~
+
λ
M
2
v
~
T
v
~
+
λ
M
2
ρ
1
2
x
~
T
x
~
+
λ
M
ρ
1
ρ
2
x
~
T
v
~
+
λ
M
2
ρ
2
2
v
~
T
v
~
-
(
β
-
∥
u
r
∥
)
∥
M
(
γ
x
~
+
v
~
)
∥
1
=
-
[
x
~
T
v
~
T
]
Q
γ
[
x
~
v
~
]
-
(
β
-
∥
u
r
∥
)
∥
M
(
γ
x
~
+
v
~
)
∥
1
.
From Lemma 6 that Q
γ
>
0 and β
-
∥
u
r
∥
>
0, we have V
˙
<
0. Equivalently, it follows that as t
→
∞, x
~
i
→
0, v
~
i
→
0, which means x
i
→
x
r, v
i
→
v
r as t
→
∞. And then the second-order nonlinear followers (11) with the control algorithms (14) asymptotically track the leader (12).Remark 8.
In order to deal with the nonlinear term of the agents’ dynamics in Theorem7, one key procedure is the definition of the inner product (34) and the application of Cauchy-Schwarz inequality.Remark 9.
The result in Theorem7 for multiagent systems with x
i
∈
R and v
i
∈
R is also suitable for agents with dynamics evolved in higher-order dimension; that is, x
i
∈
R
n and v
i
∈
R
n.


## 3.3. Consensus Tracking for the General Nonlinear Dynamics

In the general nonlinear case, suppose that a network system withN followers represented by the following nonlinear equation:
(37)
x
˙
i
=
f
(
x
i
,
u
i
)
,
i
=
1,2
,
…
,
N
,
where x
i
∈
R
n is the state vector of the ith follower and u
i
∈
R
p is the control input. And a leader is given by
(38)
x
˙
r
=
f
(
x
r
,
u
r
)
,
where x
r
∈
R
n and u
r
∈
R
p are, respectively, the state and the control input of the leader. The function f
(
x
i
,
u
i
) will be C
2 with regard to x
i and u
i, and so is f
(
x
r
,
u
r
). We aim to give an explicit control law u
i for each follower such that
(39)
lim
⁡
t
→
∞
∥
x
i
(
t
)
-
x
r
(
t
)
∥
=
0
.
If the limit (39) is finally achieved, then we say that the general nonlinear followers (37) with the control algorithm asymptotically track the leader  (38).Remark 10.
Note that the differential equation (37) can describe the models of many kinds of mechanical system such as nonholonomic system and underactuated system.Throughout the subsequent analysis we assume that the network topology satisfies the following two assumptions.Assumption 11.
The graph of the network topology is tree shaped with the leader as the root node, where the tree shaped graph means each node has only one parent node except the root node.Assumption 12.
For the network system, each agent knows the measurement of the control input of its parent agent at the same time.Assumption12 illustrates that each agent is a cooperative partner with its neighbors. Due to the very general nonlinear dynamics and the goal of nonlinear consensus tracking, it is necessary for an agent to know the input of its parent agent. Motivated by the consensus analysis in [25], where the tool of incidence matrix is used to model the error system, we number the edges in the tree shaped graph according to the length of the path which is indirectly connected to the root node shown in Figure 4.In order to propose the consensus tracking algorithm for agents (37), we make some preparation. The following analysis is based on theproposition
1 in [22]. For the tree shaped graph, each follower node i in the form of (37) tracks the trajectory of its parent node j in the form of (37) (or (38)), where both x
i
(
t
), x
j
(
t
) and u
i
(
t
), u
j
(
t
) are bounded. And we denote
(40)
A
i
j
(
t
)
:
=
∂
f
∂
x
i
(
x
j
(
t
)
,
u
j
(
t
)
)
,
B
i
j
(
t
)
:
=
∂
f
∂
u
i
(
x
j
(
t
)
,
u
j
(
t
)
)
.LetΦ
i
j
(
t
,
t
0
)
∈
R
n
×
n
×
R be the state transition matrix of A
i
j
(
t
); that is, Φ
i
j
(
t
,
t
0
) satisfies Φ
˙
i
j
(
t
,
t
0
)
=
A
i
j
(
t
)
Φ
i
j
(
t
,
t
0
) with Φ
i
j
(
t
0
,
t
0
)
=
I. Further, for a given constant α
>
0, we define
(41)
H
i
j
(
t
0
,
t
)
=
∫
t
0
t
‍
exp
⁡
(
6
α
(
t
0
-
τ
)
)
Φ
i
j
(
t
0
,
τ
)
B
i
j
(
τ
)
B
i
j
(
τ
)
T
Φ
i
j
(
t
0
,
τ
)
T
d
τ
.
If there exists a constant δ such that H
i
j
(
t
,
t
+
δ
) is bounded away from singularity uniformly in t, then define P
i
j
(
t
) as follows:
(42)
P
i
j
(
t
)
:
=
H
i
j
-
1
(
t
,
t
+
δ
)
.If there exist two numbersp
i
j
m and p
i
j
M such that
(43)
0
<
p
i
j
m
I
<
P
i
j
(
t
)
<
p
i
j
M
I
,
∀
t
∈
R
+
,
then, for any function γ
i
j
(
t
)
:
R
+
→
[
1
/
2
,
∞
), continuous and bounded, we propose the following linear time-varying feedback control law:
(44)
u
i
(
t
)
=
u
j
(
t
)
-
γ
i
j
(
t
)
B
i
j
(
t
)
T
P
i
j
(
t
)
[
x
i
(
t
)
-
x
j
(
t
)
]
.
Now we have the main result as follows.Theorem 13.
If Assumptions11 and 12 are satisfied, then the general nonlinear followers (37) with the control algorithms (44) asymptotically track the leader (38).Proof.
Let(45)
x
i
(
t
)
-
x
j
(
t
)
=
x
~
i
j
(
t
)
,
u
i
(
t
)
-
u
j
(
t
)
=
u
~
i
j
(
t
)
,
where x
j and u
j are the state and the input of agent j and the agent j is the parent agent of agent i. For simplicity, we denote x
~
i
j
(
t
) in the multiagent systems by e
k
(
t
), k
=
1,2
,
…
,
m, like in Figure 4, where m is the number of edges in the graph of the network topology, and e
=
[
e
1
,
e
2
,
…
,
e
m
]
T. Similarly, let P
(
t
)
=
diag
⁡
(
P
1
(
t
)
,
P
2
(
t
)
,
…
,
P
m
(
t
)
), where P
k
(
t
), k
=
1,2
,
…
,
m, represent the matrix P
i
j
(
t
), i
∈
V
,
j
∈
V
∪
{
r
} (r represents the leader in the network), and each is described by (42). Consider a Lyapunov function candidate
(46)
V
=
∑
k
=
1
m
‍
V
k
=
∑
k
=
1
m
‍
e
k
T
P
k
e
k
.
Note that
(47)
u
~
k
(
t
)
=
u
~
i
j
(
t
)
=
-
γ
i
j
(
t
)
B
i
j
(
t
)
T
P
i
j
(
t
)
x
~
i
j
(
t
)
=
-
γ
k
(
t
)
B
k
(
t
)
T
P
k
(
t
)
e
k
(
t
)
.
In addition, one has
(48)
e
˙
k
(
t
)
=
A
k
(
t
)
e
k
(
t
)
+
B
k
(
t
)
u
~
k
(
t
)
+
o
(
e
k
(
t
)
,
u
~
k
(
t
)
,
t
)
,
P
˙
k
(
t
)
=
-
P
k
(
t
)
H
˙
k
(
t
)
P
k
(
t
)
,
H
˙
k
(
t
)
=
H
˙
i
j
(
t
,
t
+
δ
)
=
6
α
H
k
(
t
)
+
A
k
(
t
)
H
k
(
t
)
+
H
k
(
t
)
A
k
(
t
)
T
+
exp
⁡
(
-
6
α
δ
)
Φ
k
(
t
,
t
+
δ
)
B
k
(
t
+
δ
)
×
B
k
(
t
+
δ
)
T
Φ
k
(
t
,
t
+
δ
)
T
-
B
k
(
t
)
B
k
(
t
)
T
.
Since γ
k
(
t
)
≥
1
/
2, k
=
1,2
,
…
,
m, from the control algorithm (44) and the notation (45) and
(49)
∥
u
~
k
∥
=
∥
-
γ
k
B
k
T
P
k
e
k
∥
≤
K
∥
e
k
∥
,
K
<
∞
,
we have
(50)
o
(
e
k
(
t
)
,
u
~
k
(
t
)
,
t
)
=
o
^
(
e
k
(
t
)
,
t
)
,
lim
⁡
∥
e
k
∥
→
0
sup
⁡
t
≥
0
∥
o
^
(
e
k
(
t
)
,
t
)
∥
∥
e
k
(
t
)
∥
=
0
.
Then,
(51)
V
˙
k
(
e
k
,
t
)
=
-
e
k
(
t
)
T
6
α
P
k
(
t
)
e
k
(
t
)
-
e
k
(
t
)
T
(
2
γ
k
(
t
)
-
1
)
P
k
(
t
)
B
k
(
t
)
B
k
(
t
)
T
P
k
(
t
)
e
k
(
t
)
-
e
k
(
t
)
T
[
×
B
k
(
t
+
δ
)
T
Φ
k
(
t
,
t
+
δ
)
T
P
k
(
t
)
exp
⁡
(
-
6
α
δ
)
P
k
(
t
)
Φ
k
(
t
,
t
+
δ
)
B
k
(
t
+
δ
)
hhhhhhhhh
h
×
B
k
(
t
+
δ
)
T
Φ
k
(
t
,
t
+
δ
)
T
P
k
(
t
)
]
e
k
(
t
)
+
2
e
k
(
t
)
T
P
k
(
t
)
o
^
(
e
k
(
t
)
,
t
)
≤
-
4
α
p
k
m
∥
e
k
∥
2
.
It follows that V
˙
<
0 and x
~
i
j
→
0, u
~
i
j
→
0 as t
→
∞. At the same time, lim
⁡
t
→
∞
∥
x
i
(
t
)
-
x
r
(
t
)
∥
=
0 is satisfied and the consensus tracking problem is solved.Remark 14.
For an undirected connected graph which contains a tree shaped subgraph, or a directed graph which contains a directed spanning tree, we can choose such a tree as Assumption11 required. However, such a directed tree is unfavorable for implementing the distributed control since in such case each follower has to know the information of the global communication topology. So, it is worth discussing the general undirected (or directed) communication topologies and it will be a direction of the future research.Remark 15.
It has been shown that systems (1) and (11) are the special cases of system (37). However, the analysis for convergence of closed system is completely different. Though, in each case, the communication topologies are relatively simple.


## 4. Simulation Results

In this section, three numerical simulation examples are given to illustrate the theoretical results. Consider the first example, a network of three followers with a leader shown in Figure1. Assume that the dynamics of the follower agents with n
=
2 are described by the following equations:
(52)
f
(
t
,
x
i
)
=
(
x
i
1
sin
t
x
i
2
cos
⁡
t
)
,
f
(
t
,
x
r
)
=
(
x
r
1
sin
t
x
r
2
cos
⁡
t
)
.
The control input of the leader is given by u
r
=
[
1,1
]
T. Choose β
i
=
1 for i
=
1,2
,
3 and ω
=
1.5. Note that 1.5
>
∥
u
r
∥
=
2. The initial values of the error between the multiple followers and the leader, which is described by x
~
i
j
=
x
i
j
-
x
r
j, i
=
1,2
,
3, j
=
1,2, are given as [
0.1
,
-
0.2,0.3
,
-
0.1,0.4,0.2
]
T. Then the results of consensus tracking are shown in Figure 2, where x
1
=
[
x
11
,
x
21
,
x
31
]
T and x
2
=
[
x
12
,
x
22
,
x
32
]
T. Since x
~
i
j
→
0 as t moves on, consensus tracking is finally achieved.Figure 1
The undirected graph for a group of three followers with a leader. HereL
0 denotes the leader and F
i, i
=
1,2
,
3, denote the followers. The direct arrows represent the information flow from the leader to the follower and the indirect edges represent the bidirectional information flow between followers.Consensus tracking for the first-order nonlinear systems.
(a)
(b)The second example is also given for the graph in Figure1, which characterizes the communication channel among the three followers and a leader. The dynamics of each follower and the leader are specified by the following equations, respectively:
(53)
x
˙
i
=
v
i
,
v
˙
i
=
x
i
sin
(
t
)
+
v
i
cos
⁡
(
t
)
+
u
i
,
x
˙
r
=
v
r
,
v
˙
r
=
x
r
sin
(
t
)
+
v
r
cos
⁡
(
t
)
+
u
r
.
Note that
(54)
M
=
[
2
0
-
1
0
2
-
1
-
1
-
1
2
]
,
and λ
M
=
3.4142, ρ
1
=
ρ
2
=
1. Choose α
=
1; then it is easy to compute that
(55)
c
1
=
0.7735
,
c
2
=
0.4921
,
c
3
=
5.5217
,
c
4
=
0.1497
,
c
5
=
6.6787
,
c
6
=
2.4142
.
Choose γ
=
0.45
∈
{
γ
∣
max
⁡
(
0
,
c
4
)
<
γ
<
min
⁡
{
c
1
,
c
2
,
c
3
,
c
5
,
c
6
}
}. Given the initial values as x
~
1
(
0
)
=
1, x
~
2
(
0
)
=
2, x
~
3
(
0
)
=
3, v
~
1
(
0
)
=
4, v
~
2
(
0
)
=
5, and v
~
3
(
0
)
=
6, the results of consensus tracking are shown in Figure 3.Figure 3
Consensus tracking for the second-order nonlinear systems.Figure 4
The tree shaped graph for a network of four followers with a leader, whereL
0 denotes the leader and F
i, i
=
1,2
,
3,4, denote the followers. The direct arrows represent the information flow from the parent agent to the child agent.Now let us see the third example. In the case of the general nonlinear dynamics, the graph of the network topology is shown in Figure4.We consider each agent’s dynamics to be a simple nonholonomic system specified by the equations as follows:(56)
x
˙
1
=
u
1
,
x
˙
2
=
u
2
,
x
˙
3
=
x
2
u
1
.
Assume that the trajectory and the control input of the leader are, respectively, described by x
L
0
=
(
0
,
t
,
0
) and u
L
0
=
(
0,1
), where the superscript L
0 means the leader. Choose δ
=
0.1 and γ
i
j
(
t
)
=
1. For the initial value of F
i, i
=
1,2
,
3,4, given by x
F
1
(
0
)
=
(
0.4
,
-
0.6,0.4
), x
F
2
(
0
)
=
(
-
0.8,1.2,1.8
), x
F
3
(
0
)
=
(
0,2.4,1.4
), and x
F
4
(
0
)
=
(
1
,
-
3.8,2.8
), the norm results of tracking error e
1
(
t
)
=
x
F
1
-
x
L
0, e
2
(
t
)
=
x
F
2
-
x
L
0, e
3
(
t
)
=
x
F
3
-
x
F
2, and e
4
(
t
)
=
x
F
4
-
x
F
2 are shown in Figure 5.Figure 5
The norm of errore
i, i
=
1,2
,
3,4, versus time.Sincee
i, i
=
1,2
,
3,4, converge to 0 as time moves on, consensus tracking is achieved asymptotically.


## 5. Conclusion

In this paper, we studied the problem of nonlinear consensus tracking via the variable structure technique, the feedback linearization technique, and the Lyapunov theory when there is a leader governed by the external input. Suppose that the leader’s external input is upper bounded and a connectivity requirement for the network topology is satisfied; we proposed the consensus tracking algorithms for the followers with the first-order nonlinear dynamics, the second-order nonlinear dynamics, and the general nonlinear dynamics to asymptotically track the corresponding nonlinear leader. And several numerical simulations were given to show the effectiveness of our algorithms. The future works include the study of nonlinear consensus tracking in the general directed network topologies.



---

*Source: 130643-2014-08-14.xml*