Mathematical Problems in Engineering

Mathematical Problems in Engineering / 2017 / Article

Research Article | Open Access

Volume 2017 |Article ID 5091756 | 15 pages | https://doi.org/10.1155/2017/5091756

Distributed Robust Consensus Control for Uncertain Multiagent Systems with State and Input Delays

Academic Editor: Jean Jacques Loiseau
Received06 Dec 2016
Revised17 Mar 2017
Accepted29 Mar 2017
Published24 Apr 2017

Abstract

Robust consensus control problem is investigated for multiagent systems. Each agent is tackled in a more generalized form, which includes parameter uncertainties, external disturbances, nonidentical time-varying state, and input delays. Firstly, a distributed control protocol based on state feedback of neighbors is designed. By a decoupling method, consensus control problem for multiagent systems is transformed into control problem for the decoupling subsystems. Then employing Lyapunov-Krasovskii functional and free-weighting matrices, a lower conservative bounded real lemma (BRL) is derived in terms of linear matrix inequalities (LMIs) such that a class of time-delay system is guaranteed to be globally asymptotically stable with the desired performance index. Extending BRL, a sufficient delay-dependent condition of lower complexity in terms of the matrix inequalities is obtained to make all agents asymptotically reach consensus with the desired performance index. Furthermore, an algorithm is elaborately designed to get feasible solution to this condition. Extending this algorithm, an optimization algorithm for control protocol parameter is proposed to improve the disturbance attenuation capacity or allowable delay bounds. Finally, simulation results are provided to illustrate the correctness of the theoretical results and the effectiveness of the algorithms.

1. Introduction

Consensus problem has attracted a great deal of attention due to its enormous potential applications in many areas such as flocking and swarming modeling [1], cooperative control of unmanned air vehicles [2], and formation control of multirobot systems [3]. In the past decade, a large number of results have been obtained for consensus problem of various multiagent systems, for example, consensus problems of multiagent systems with different dynamics such as double-integrator dynamics in [4] and Lipschitz nonlinear dynamics in [5], consensus problems of multiagent systems with the different network topologies such as random networks in [6] and switching topology in [7], and consensus problems of multiagent systems with the different time-delay such as nonuniform time-varying delays in [8] and input and communication delays in [9].

In practical applications, multiagent systems often have disturbances, uncertainties and time-delay such as communication noise, and uncertainties in network parameters and time-delay caused by communication or measuring. Moreover, the existence of these facts might destroy the convergence properties of multiagent systems. Therefore, it is significant to investigate robust consensus problems of multiagent systems, which reflects the effects of these facts on the behaviour of multiagent systems. In the past decade, some interesting results have been obtained for robust consensus problems. Lin et al. investigated robust consensus analysis of directed networks of first-order agents with time-delay and a class of second-order multiagent systems with uncertainty in [10] and [11], respectively. Li et al. investigated the distributed and control problems for multiagent systems with linear or linearized dynamics in [12]. Liu and Jia investigated consensus control problem for multiagent systems with linear coupling dynamics and communication delays in [13]. Wang et al. investigated distributed robust control problem synthesized with transient performance for a group of autonomous agents governed by uncertain general linear node dynamics in [14]. Hu et al. investigated the consensus problem for multiagent systems by means of a simultaneous stabilization approach in [15]. Shi and Qin studied rotational motion of multiagent systems with nonuniform time-delays in [16]. Li et al. investigated distributed robust rotating consensus control problem for directed networks of second-order agents with mixed uncertainties and time-delay in [17]. However, in [10, 11, 17], we could obtain the sufficient conditions where the parameters of the control protocols should be satisfied but their calculation method was not directly given. In [12, 13, 15], the parameter uncertainties and time-varying delay were not considered. In [16], uncertainty and external disturbance were not considered. In [14], time-delay was not considered. In addition, in practical applications, on one hand, each agent itself may be a time-delay system, which includes the state delay itself. On the other hand, due to the introduction of the control protocol, the system often contains the input delay. Furthermore, the state and input delays often are nonidentical and time variant, which makes the control problem more challenging. So far, there exists rare work dealing with robust consensus control problem for uncertain multiagent systems with nonidentical time-varying state and input delays.

Motivated by the previous observations, this paper investigates robust consensus control problem for uncertain multiagent systems, which is subject to parameter uncertainties, external disturbances, and nonidentical time-varying state and input delays. Firstly, a distributed control protocol based on state feedback of neighbors is designed and the closed-loop dynamics is built. By applying matrix theory tools, multiagent system is decoupled and consensus control problem for multiagent systems is transformed into control problem for the decoupling subsystems. Then employing Lyapunov-Krasovskii functional, Jensen integral inequality, and Newton-Leibnitz formula with free-weighting matrices, a lower conservative bounded real lemma (BRL) is derived in terms of LMIs such that a class of time-delay system is guaranteed to be globally asymptotically stable with the desired performance index. Extending BRL, a sufficient delay-dependent condition in terms of the matrix inequalities, whose complexity is lower because the system is decoupled, is obtained to make all agents asymptotically reach consensus with the desired performance index. Furthermore, an algorithm is elaborately designed to get feasible solution to this condition by the cone-complementary method. Extending this algorithm, an optimization algorithm for control protocol parameter is proposed to improve the disturbance attenuation capacity or allowable delay bounds. At last, simulation results are provided to illustrate the correctness of the theoretical results and the effectiveness of the algorithms.

The following notations will be used throughout this paper. denotes the corresponding column vectors whose elements are all zeros. and denote identity matrix and zero value or zero matrix with appropriate dimensions, respectively. and denote the identity matrix and the zero matrix, respectively. and denote the -dimensional and the -dimensional Euclidean spaces, respectively. refers to the standard Euclidean norm for vectors. The notations and denote the vector product and the Kronecker product, respectively. The superscript and stand for matrix transposition and matrix inverse, respectively. In symmetric block matrices, is used as an ellipsis for terms induced by symmetry. The notation denotes a block diagonal matrix whose diagonal blocks are given by .

2. Preliminaries

In this section, some preliminary knowledge of graph theory is introduced for the following analysis (referring to [18]). Let be an 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 , where the first element of is said to be the tail of the edge and the other to be the head. The adjacency elements are defined as and . if and only if there is an edge between node and node . The Laplacian of the undirected graph is defined as , where is a diagonal matrix with . The set of neighbors of node is denoted by . If there is a path from every node to every other node, the graph is said to be connected.

3. Problem Statement

Consider a multiagent system consisting of agents. Each agent is regarded as a node in a graph . Each edge corresponds to an available information channel between agents and . Suppose that the th agent has the dynamics as follows: where denotes the state of the th agent , denotes the control input (or control protocol) of the th agent , and , , , and are constant matrices with compatible dimensions. denotes the state delay of the system itself, which can be considered as the summation of computation time and execution time. denotes the input delay, which is caused by communication and measuring. denotes the external disturbances belonging to . and are matrix valued function representing time-varying parameter uncertainties. The parameter uncertainties are assumed to be norm bounded and and , where , , , and are known constant matrices with appropriate dimensions, which represent the structure of uncertainties, and is an unknown matrix function with Lebesgue measurable elements satisfying for all .

Remark 1. The system model (1) is a more generalized form. On one hand, it can cover the first-order dynamics in [10], second-order dynamics in [4, 11], and high-order dynamics in [19]. On the other hand, compared with [12, 13, 15], it includes the parameter uncertainties and nonidentical time-varying delay, and compared with [8, 9, 16], it includes parameter uncertainties and external disturbance.

Definition 2. The multiagent system (1) reaches consensus, if and only if the states of agents satisfy.

Define a vector function , where measures the disagreement of the state of the th agent to the average state of all agents for and its value is as follows:

Note that if can be satisfied, then holds . That is to say, the multiagent system (1) reaches consensus. This implies that can quantitatively reflect the disagreement degree of all agents on their states and the norm of indicates consensus performance. Therefore, is defined as the controlled output of the multiagent system (1) for analysing its consensus behaviour.

LetThen combining the dynamic equation (1) with controlled output defined in (5) yields the following system in matrix form:where

According to robust control theory, the attenuating ability of consensus performance for the multiagent system (1) against external disturbances can be quantitatively measured by the norm of the closed-loop transfer function matrix from the external disturbance to the controlled output . In order to obtain prescribed performance against external disturbances, we need to design a distributed state feedback protocol such thatholds for a prescribed disturbance attenuation index , or equivalently, the closed-loop system satisfies the following dissipation inequality:

4. Main Results

In this section, we will solve consensus control problem for multiagent systems (7). Firstly, we will design a distributed control protocol with an undetermined feedback matrix and build the closed-loop dynamics of the system. By applying matrix theory tools, multiagent system is decoupled and consensus control problem for multiagent systems is transformed into control problem for the decoupling subsystems. Then employing Lyapunov-Krasovskii functional and free-weighting matrices, a BRL will be derived in terms of LMIs such that a class of time-delay system is guaranteed to be globally asymptotically stable with the desired performance index. Extending BRL, a sufficient delay-dependent condition in terms of the matrix inequalities is obtained to make all agents asymptotically reach consensus with the desired performance index. Furthermore, an algorithm is elaborately designed to get feasible solution to this condition. Extending this algorithm, an optimization algorithm for control protocol parameter is proposed to improve the disturbance attenuation capacity or allowable delay bounds.

4.1. Protocol Design

To solve consensus control problem for the multiagent systems (1), the distributed control protocol is given asfor , where is an undetermined feedback matrix and are the adjacency elements of interaction graph .

By substituting the protocol (11) into system (7), the closed-loop dynamics of system (1) can be written as where is the Laplacian matrix of the graph .

On the basis of the above analysis, it is clear that the multiagent system (1) reaches consensus while satisfying the desired disturbance attenuation index by control protocol (11), if and only if the closed-loop system (12) reaches consensus with the desired disturbance attenuation index . In the next section, we will find design rules for such that system (1) reaches consensus with the disturbance attenuation index .

4.2. Some Necessary Lemma

Lemma 3 (see [20]). Let be the Laplacian of an undirected graph . Then has at least one zero eigenvalue and all of the nonzero eigenvalues are positive. Furthermore, matrix has exactly one zero eigenvalue if and only if the graph is connected, and the eigenvector associated with zero is .

Lemma 4 (see [10]). Consider the matrix . The following statements hold.(a)The eigenvalues of are 1 with multiplicity and 0 with multiplicity 1. The vectors and are the left and right eigenvectors of associated with the zero eigenvalue, respectively.(b)There exists an orthogonal matrix such that and the column is . Let be the Laplacian of any directed graph; then .For convenience, denote , where is the last column of and is the remaining part.

Lemma 5 (Schur complement formula [21]). For a given symmetric matrix with the form , , , and ; then if and only if and  or and .

4.3. System Decoupling

Theorem 6 (system decoupling). Assume that the interaction graph is connected. For a given , the closed-loop system (12) can reach consensus with the desired disturbance attenuation index , if the following subsystems are simultaneously asymptotically stable with for .where are the positive eigenvalues of the Laplacian matrix and , , .

Proof. See Appendix.

4.4. Delay-Dependent Control

In order to investigate the stability, let us consider a class of time-delay system as follows:A bounded real lemma (BRL) will be derived in the following part.

Lemma 7 (BRL). For a given , the time-delay system (14) is asymptotically stable with , if there exist positive definite matrices , , , , , , and and matrices , , , , , , , and with appropriate dimensions such thatwhere ,

Proof. See  Appendix.

Theorem 8. Assume that the interaction graph is connected. For given positive scalar constants , by distributed protocol (11), the multiagent system (1) can reach consensus with the desired disturbance attenuation index , if there exist positive definite matrices , matrices ,  , and positive scalars , such that where Furthermore, the feedback matrix in the proposed control protocol (11) can be designed by .

Proof. See Appendix.

4.5. Algorithm of Solving Delay-Dependent Condition

In the following section, an algorithm will be designed to get the feasible solution to the matrix inequality condition (17).

Due to the existence of nonlinear entry , the matrix inequality condition (17) is not yet in the form of an LMI. Therefore, we cannot directly use LMI method to solve the matrix inequality (17). But we can turn this problem into the LMI optimization problem by the cone-complementary linearization algorithm [22].

Define a new positive definite matrix variable such that . It is easy to derive that . Furthermore, by defining ,  , and   and using Lemma 5 (Schur complement formula), we can turn condition (17) into Then, we may solve the following optimization problem and find a feasible solution satisfying :

In a word, in order to solve the matrix inequality condition (17), an algorithm is designed as follows.

Algorithm 9. (1)  Solve the LMI (19) and (20) for given positive scalar constants , , , , and . There exists a feasible solution set and set .
(2)  Solve the following optimization problem for the variablesand set ,  ,  ,  ,  , and  .
(3)  If for the above solution set, then save the current , and exit. Otherwise, set , go to Step , and repeat the optimization for a prescribed maximum iterative number until finding a feasible solution satisfying . If such a solution does not exist, then exit.

If a feasible solution set is found by Algorithm 9, given the disturbance attenuation index and delay parameters , , , and , by distributed protocol (11), the multiagent system (1) can reach consensus with the desired disturbance attenuation index and the feedback matrix can be constructed by .

4.6. Optimization for Control Parameters

According to Theorem 8, assume that delay parameters , , , and have been given; in order to achieve a minimum disturbance attenuation index , we can solve the following optimization problem for the positive definite decision variables , matrices ,  , and positive scalars :

Because the matrix inequality condition (17) is not yet in the form of an LMI, we cannot find global minima for the optimization problem (23) using convex optimization algorithms. However, by the similar methods to Algorithm 9, we may still obtain a suboptimal controller for the optimization problem (23) using an iterative algorithm presented in the following sequel.

Algorithm 10. (1) Assume that the delay parameters , , , and have been given. Choose a sufficiently large initial such that there exists a feasible solution set to the LMIs (19) and (20). Set .
(2) Solve the optimization problem (22) and set ,  ,  ,  ,  , and .
(3)  If for the above solution set, then set and return to Step after decreasing , where is predefined step-sizes. Otherwise, set , go to Step , and repeat the optimization for a prescribed maximum iterative number until finding a feasible solution satisfying . If such a solution does not exist, then exit.
If a feasible solution set is found by Algorithm 10, for the given delay parameters , , , and , by distributed protocol (11), the multiagent system (1) can reach consensus with the suboptimal disturbance attenuation index and the suboptimal feedback matrix can be constructed by .

Remark 11. Assuming that the disturbance attenuation index and delay parameters (or the proportion coefficient of and ), , and have been given, we can raise the maximum allowable delay bound to and the corresponding feedback matrix by the similar methods to Algorithm 10. Similarly, we also can raise the maximum allowable delay bound to and the corresponding feedback matrix .

5. Simulation Results

To illustrate the correctness of the theoretical results and the effectiveness of the algorithms, numerical simulations will be given in this section. Consider a multiagent system with four agents and the dynamics of each agent is described by (1), with The connected interaction graph is shown in Figure 1, whose nonzero weighting factors are all . So the corresponding Laplacian matrix is So its smallest and largest nonzero eigenvalues are and , respectively. We assume that the external disturbance and the initial state of the multiagent system is taken as .

Example 12. Suppose that the performance index , the delay , and (so and ). By Theorem 8 and Algorithm 9, we can figure out the feedback matrix in the control protocol (11) as follows:

On the one hand, Figure 2 shows the trajectories of when , , and for all , where ,  . It is clear that consensus is asymptotically achieved for the multiagent systems. On the other hand, Figure 3 shows the energy relation of the controlled output and the external disturbance. Obviously, the closed-loop system satisfies ; that is, the disturbance attenuation index is achieved. Therefore, applying the distributed protocol (11) and calculating the feedback matrix by Theorem controller synthesis theorem and Algorithm 9, the multiagent system can reach consensus while satisfying the desired disturbance attenuation index . So we validate the correctness of Theorem 8 and the effectiveness of Algorithm 9.

Example 13. Suppose that the delay and (so and ). Using the distributed protocol (11) and optimizing the feedback matrix by Algorithm 10, we can figure out the suboptimal disturbance attenuation index and the corresponding feedback matrix as follows:

Figure 3 shows the energy relation of the controlled output and the external disturbance. Obviously, the disturbance attenuation index is smaller than its value in Example 12. That is to say, by Algorithm 10, the disturbance attenuation capacity of the multiagent system (1) is obviously improved. So the effectiveness of Algorithm 10 is validated.

6. Conclusion

This paper studies robust consensus control problem for multiagent systems with parameter uncertainties, external disturbances, nonidentical time-varying state, and input delays. The main contributions of this paper are as follows: first, considering a more generalized form, which includes parameter uncertainties, external disturbances, nonidentical time-varying state, and input delays; second, a lower conservative BRL; third, a lower complexity delay-dependent control condition; fourth, an algorithm for calculating parameters of control protocol; fifth, an optimization algorithm for improving the disturbance attenuation capacity or allowable delay bounds. In further research, we will research robust consensus control problem for multiagent systems with heterogeneous uncertainties and nonuniform time-varying delays.

Appendix

Proof of Theorem 6. Let By Lemmas 3 and 4, we know that is a common eigenvalue of and when the graph is connected, and is a common eigenvector associated with . Therefore, it is easy to derive that and . Denote , , and . Then combining with system (12), we haveDue to the fact that the rows of and are all in (A.2) and (A.3), we can obtain the reduced-order system (A.4) that is equivalent to a system, which is made up of (A.2) and (A.3), regarding the performance. Considering that ,, and , it is easy to derive that leads to . So system (12) reaches consensus if system (A.4) is asymptotically stable. In addition, by ,, and (A.2) and (A.3), it can be easily proved that . So .
Therefore, the closed-loop system (12) reaches consensus with the desired disturbance attenuation index (), if the following system is asymptotically stable with .where and .
When the interaction graph is connected, the matrix is positive definite and its eigenvalues are the positive eigenvalues of the Laplacian matrix by Lemmas 3 and 4. Then there exists an orthogonal matrix such that where .
LetThen system (A.4) can be rewritten in terms of ,  , and as follows:By the variable substitution in (A.6), we know that is asymptotically stable if is asymptotically stable. In addition, it is easy to derive that . So . Therefore, system (A.4) is asymptotically stable with , if system (A.7) is asymptotically stable with .
Due to the diagonal property of matrix , system (A.7) realises the complete decoupling of state variables . So system (A.7) is asymptotically stable if its diagonal subsystems (13) are simultaneously asymptotically stable. Besides that, it follows from (13), (A.6), and (A.7) that , which implies that . Hence system (A.7) is asymptotically stable with , if its diagonal subsystems (13) are simultaneously asymptotically stable with for .
In conclusion, assume that the interaction graph is connected; the closed-loop system (12) can reach consensus with the desired disturbance attenuation index , if the systems (13) are simultaneously asymptotically stable with for . This completes the proof.

Proof of Lemma 7. Let us define a Lyapunov-Krasovskii function for the multiagent system (14) as with positive definite matrices , , , , , , and , where The time derivative of along the solution of system (14) is , where is as follows: