Mathematical Problems in Engineering

Mathematical Problems in Engineering / 2016 / Article

Research Article | Open Access

Volume 2016 |Article ID 2756046 | 11 pages |

Adaptive Tracking Control of Second-Order Multiagent Systems with Jointly Connected Topologies

Academic Editor: Xuejun Xie
Received07 Apr 2016
Revised23 Jun 2016
Accepted03 Jul 2016
Published07 Aug 2016


This paper considers a consensus problem of leader-following multiagent system with unknown dynamics and jointly connected topologies. The multiagent system includes a self-active leader with an unknown acceleration and a group of autonomous followers with unknown time-varying disturbances; the network topology associated with the multiagent system is time varying and not strongly connected during each time interval. By using linearly parameterized models to describe the unknown dynamics of the leader and all followers, we propose a decentralized adaptive tracking control protocol by using only the relative position measurements and analyze the stability of the tracking error and convergence of the adaptive parameter estimators with the help of Lyapunov theory. Finally, some simulation results are presented to demonstrate the proposed adaptive tracking control.

1. Introduction

As one kind of the major research content of distributed coordination control for multiagent systems, leader-following problem had attracted a host of researchers. For example, Ren proposed and analyzed consensus tracking algorithms in [1] and solved the leader-following problem that only a few agents can obtain a time-varying consensus reference state. Hong et al. investigated the leader-following problem, using an “observer” to solve how to track the leader with unknown velocity in [2]. Hu and Hong considered a leader-following consensus problem of a group of autonomous agents with time-varying coupling delays in [3] and investigated two different cases of coupling topologies. Peng and Yang studied the problem of multiple time-varying delays for second-order multiagent systems in [4]. Song et al. achieved leader-following consensus in a network of agents with nonlinear second-order dynamics in [5] by presenting a pinning control algorithm.

Meanwhile, estimation strategies with partial measurements and adaptive control schemes about unknown disturbances had captured some individuals’ attention. Hong et al. designed the distributed observers for the second-order agents in [6], such that the velocity of the active leader cannot be measured. Hu et al. solved an event-triggered tracking problem in [7] by using an observer-based consensus tracking control, which is designed on the basis of a novel distributed velocity estimation technique. Zhang and Yang proposed two bounded control laws, which are independent of velocity information in [8], to deal with the finite-time consensus tracking problem. Bauso et al. considered stationary consensus protocols for networks of dynamic agents in [9] in which the neighbors’ states are affected by unknown but bounded disturbances. Hu and Zheng just used the relative position measurements to design a dynamic output-feedback tracking control together with decentralized adaptive laws in [10]. Li et al. designed a distributed adaptive consensus protocol in [11] based on the agent dynamics and the relative states of neighboring agents and achieved leader-follower consensus for any communication graph which contains a directed spanning tree with the leader as the root node. Bai et al. considered the situation where the reference velocity information is available only to a leader in [12] and then developed an adaptive design to recover the desired formation.

The work about dynamically changing topologies, such as jointly connected topology, also appeared in some research. In [13] Hong et al. adopted a neighbor-based rule to realize local control strategies for these autonomous agents and made all the agents converge to a common value by using a Lyapunov-based approach. In [14], Lin and Jia investigated consensus problems in networks of continuous-time agents with time delays and jointly connected topologies.

In this paper, we consider a leader-following problem about second-order multiagent system, which has unknown time-varying disturbances and the system is partial measurement.

Different from some existing research, we consider the network of the system is jointly connected and prove a lemma to solve the the jointly connected topologies problem about leader-following system. This method can apply to some other jointly connected problems. Moreover, the leader’s velocity and acceleration in the multiagent system are unknown; we propose a state variable to estimate the relative velocity and design a control law to guarantee the agents to follow the leader by using relative position measurement only. In addition, we propose the decentralized adaptive laws for the unknown disturbances, and with the help of a prudently chosen common Lyapunov function under a persistent excitation condition, we prove both the tracking errors and disturbances parameter estimate errors can converge to zero.

The subsequent sections are organized as follows: In Section 2, we introduce some preliminaries and present the leader-following multiagent model. In Section 3, we propose a dynamic output-feedback tracking control with two decentralized adaptive laws for each follower. Then we analyze the consensus of the system and obtain the main results in Section 4. In Section 5, we give the numerical simulation results. Finally, some conclusions are drawn in Section 6.

2. Problem Statement

2.1. Algebraic Graph Theory

Firstly we introduce the graph theory; we use it to describe the communication between agents in a multiagent system. Consider a tracking problem for a multiagent system about followers and leader. The interconnection topology of followers can be conveniently described by a undirected graph of order , where is the set of nodes, is the set of edges, and is a weighted adjacency matrix. The node indexes belong to a finite index set . An edge of is denoted by . The adjacency elements associated with the edges are positive. The adjacency matrix is defined as and . When node has edge to , , the vertex is called a neighbor of vertex ; it means that agent is communicating to agent , denoted by . Then . The out-degree matrix of is , where are the diagonal elements for . The Laplacian of the undigraph is defined as .

The leader (labeled ) is represented by vertex , and the connection between the followers and the leader is directed. In the context of this paper, there are only parts of the followers having edges to the leader. Then, we have a simple graph with vertex set , which contains graph of followers and the leader with directed edges, if any, from some vertices of to the leader vertex. Use to describe the leader adjacency matrix and , where if the leader is a neighbor of agent and otherwise. When there is at least one directed edge from vertices of the graph to the leader vertex , the graph is said to be connected.

Consider an infinite sequence of nonempty, bounded, and continuous-time intervals , , with , for some constant . Suppose that, in each interval , there is a sequence of nonoverlapping subintervals satisfying , , for some integer and given constant . It is clear that there are subintervals in each interval. During each of the subintervals, the interconnection topology described by is stable and changing at each time .

The graph has the same node set , and the union of the collection is defined as , whose node set is and edge set equals the union of the edge sets of all of the graphs in the collection. However, the graph may be not strongly connected, but its union graph is connected; then we say the network is jointly connected.

Lemma 1 (Godsil and Royle [15]). If the graph is connected, its Laplacian satisfies the following: (1) zero is a simple eigenvalue of , and is the corresponding eigenvector; (2) the remaining eigenvalues are all positive and real.

Lemma 2 (Hong et al. [2]). Denote , where L is the weighted Laplacian of graph and is the leader adjacency matrix as defined in Section 2. If graph is connected, then the symmetric matrix associated with is positive definite. Moreover, matrices are associated with the graphs , respectively; is positive semidefinite because both and are positive semidefinite.

Lemma 3 (Hong et al. [13] and Lin et al. [16]). Graph is jointly connected and has connected topology in each subinterval. The corresponding nodes sets of the connected components are denoted by , denotes the number of nodes in , and . From some knowledge of matrix theory, there exists a permutation matrix , which satisfies

2.2. Problem Statement

In this paper, the dynamics of each agent is described bywhere , are the position and velocity vectors of the th agent, respectively, and is the control input.

is the dynamics of agent , which is assumed to be an unknown time-varying disturbance.

The dynamics of the leader in the multiagent system is described bywhere is an unknown acceleration of the leader.

Our aim is to design a decentralized control scheme for each agent and study under what conditions the agents can follow the leader (i.e., , ).

3. Adaptive Control Design

Before giving the adaptive control law, we propose two variables to estimate and .

For leader-follower system, the acceleration and the disturbances    are unknown. By the techniques in classical adaptive control (Marino and Tomei [17]) and multiagent systems (Bai et al. [12], Hu and Zheng [10]), they can be parameterized, respectively, as follows: where are basis function vectors and are unknown constant parameter vectors that will be estimated.

Each follower estimates the parameter vectors by and estimates , by , and , respectively. So we have for .

Secondly, we define two variables to describe the relative measurement of position and velocity.

The relative position measurement isfor .

The relative velocity measurement isfor .

So from the above definition, the following statements are equivalent:(1) and .(2) and .

Differentiating the two relative measurements and

Thus, we take Then the system can be simplified asFurthermore,

denote a column vector where all the elements are .

( denotes the total number of all possible graphs) is a switching signal that determines the communication topology .

is the Laplacian for the followers; the leader adjacency matrix is an diagonal matrix whose th diagonal element is at time and is utilized to represent the connections between the followers and the leader.

Now, we consider the control protocol.

If , , and are known, we can design the control protocol as but in our cases, , , and are unknown; we define as the estimate of by agent . Then the control protocol is

From (14), is unknown, so we design the parameter input of as

Lemma 4. When (15) is satisfied, without consideration of the parameter error of and , is the estimate of ; that is, .

Proof. From (14) and (15), When and , from (9) It is equal to That is, .
This completes the proof.

In our case, is unknown, so we define a variable for each agent and set and then (15) can be rewritten asFrom (19) and (20), we can use only related position measurement to estimate the relative velocity measurement, so the tracking control isAnd equality iswhere

Thus we have designed the control protocol only using the relative position measurement, and it is similar to the protocol, which Hu and Zheng designed in [10].

Now we design the adaptive laws. Firstly we define two parameter variables and and letThen

Consider . That is to say, we can design the adaptive laws for and to get the value of and .

We design the adaptive laws for the two variables and asEquation (26) can be rewritten as


Then we know and , and adaptive laws (27) can be transformed to

4. Consensus Analysis

From the above design and definition, we can rewrite the system aswhich is equal to

That is, when , then and .

By using the definitions and properties of jointly connected topology, we have

The matrix is a permutation matrix, , so we get

Meanwhile, so where, is the Laplacian of the corresponding connected graph, is the leader adjacency matrix of each connected graph.

Thus .

Each block matrix describes the connection of the corresponding connected components.

According to the discussion above, in each subinterval, the control scheme of each connected component is

Lemma 5. When graphs are jointly connected, the leader connects to one follower at least; then where is the minimum eigenvalue of .

Proof. Assuming the leader is connected to one follower in the th connected components, thus and (); then , and According to Lemmas 1 and 2, and when , . So .
The proof is complete.

Lemma 6. Consider a function , when , and are constants; then

Proof. From Lemma 3 and , thus The proof is complete.

Lemma 7 (Barbalat’s lemma, Popov [18]). If a function is uniformly continuous and exists and is finite, then .

Theorem 8. Consider the leader-follower system (32). The interconnection network of the system is jointly connected across each time interval and , are uniformly bounded. When and satisfy (44), the consensus tracking is achieved:where is the maximal eigenvalue of .

Proof. Consider a common Lyapunov function candidateThen the derivative of along the trajectory of system (32) is given by From Lemma 5,Let From (49), we have, are the maximal eigenvalue of and , respectively.
After calculation, we have , when , , and satisfywhere is the maximal eigenvalue of .
We know , so from (52) and Lemma 4, we getTherefore, exists.
Next, we will show that . Consider the infinite sequence . From the Cauchy convergence criteria, we know, for any , there exists a positive integer such that , . Then we have From (53) and Lemma 5, it follows that which implies that Moreover, from the Lyapunov function and (52), , and are uniformly bounded and is also bounded. By the assumption that and are uniformly bounded, therefore is uniformly continuous. Invoking Barbalat’s lemma (Lemma 7), we getwhich implies that and ; thus the consensus tracking is achieved.

Theorem 9. If the PE condition (61) (which will be mention later) is satisfied and are uniformly bounded, by using adaptive law (26), the parameter estimation errors converge to zero.
Before proving the theorem, we introduce the PE condition. We take The matrix is persistently exciting (PE) (Marino and Tomei [17]); that is, there exist two positive real numbers, and , such that

Proof. We prove Theorem 9 by contradiction. Assume that, for any constant , there exists ; thenFrom Section 2.1, for the infinite sequence of time intervals , has the subintervals , with identical length ; that is, .
Define a functionAnd we haveWe know ; from (59) and (46) we have ; it shows that From (63), for , there exists such thatThe time derivative of at time instant is given by,,, and denote the first and the second integrals in the third equality of (67), respectively.We know is bounded, so and are bounded.
Then we can set two constants , which satisfy and for all .
Meanwhile, and are assumed to be bounded by and , respectively, for all .
Then we have where .
denotes the norm bound of , which depends on , and .
Since , we obtain that ; there exists , such that <