Research Article | Open Access
Hongjie Li, "Sampled-Data Consensus for Nonlinear Multiagent Dynamical Systems via Reliable Control", Abstract and Applied Analysis, vol. 2014, Article ID 735232, 12 pages, 2014. https://doi.org/10.1155/2014/735232
Sampled-Data Consensus for Nonlinear Multiagent Dynamical Systems via Reliable Control
The paper studies sampled-data consensus for nonlinear multiagent dynamical systems. A distributed linear reliable consensus protocol is designed, where probabilistic actuators with different failure rates and random network-induced delay are considered. Based on the input delay approach, a new distribution-based fault multiagent system model with random delay is proposed. By using the stochastic analysis technique and Kronecker product properties, some consensus conditions are derived in terms of linear matrix inequalities, and the solvability of derived conditions depends on not only the failure rate of the actuator but also on the probability of the delay. Finally, a numerical example is provided to demonstrate the effectiveness of the obtained theoretical results.
In recent years, distributed coordination of multiagent systems has received increasing attention due to its potential applications, such as control of distributed sensor networks, unmanned-air-vehicle formations, satellite clusters, and so on [1–4]. As one of the fundamental and important issues in the area of cooperative control, the consensus problem in multiagent systems has been the hot and significant topic [5–13].
In many engineering applications, on the one hand, with the rapid development of computer hardware, only sampled data is used for the implementation of digital sensors, filters, and controllers. On the other hand, it is quite difficult to measure the continuous information transmission due to the capability of transmission bandwidth of networks; thus, it is more practical to apply sampled-data control, and the sampled-data control technology has shown more and more superiority over other control approaches. In particular, a new approach to deal with the sampled-data control problems has been proposed in [14–18]; the sampling period has been converted into a time-varying bounded delay. Based on this method, recently, many results have been established for the consensus in multiagent systems with sampled data. For example, in , the average consensus problem is considered for a class of first-order multiagent systems sampled-data communications; the consensus can be achieved by choosing the appropriate sampling interval. In [11, 20], some necessary and sufficient conditions are derived for consensus of multiagent systems with a fixed directed topology and periodic sampling. The consensus is also discussed for multiagent systems with sampled control by using zero-order holds or direction [21–24]. In , the sampled-data coordination algorithms are given for double-integrator dynamics, where the first algorithm guarantees that a team of vehicles achieves coordination on their positions with a zero final velocity and the second algorithm guarantees that a team of vehicles achieves coordination on their positions with a constant final velocity. The consensus problems for second-order agents in  are discussed in sampled-data setting, where the sampling period of each agent is independent of the others. Second-order sampled-data consensus problems are studied in [23, 24]; the sampled position and velocity data are used in  to design the consensus protocol, but, in , only the sampled position data is utilized. It is well known that the agent needs to exchange the information with their neighbors by an interconnected network to accomplish some specific tasks. Hence, the wireless sensor networks play a critical role for information exchange, and in practice the sensor might be destroyed, subjected to external attacks, and fail to communicate with its neighbors; the reliability and robustness of multiagent systems might become weaker than before [25, 26]. To describe the actuator fault, a Bernoulli distributed variable is employed to investigate the missing measurements [27, 28], which takes the value to mean complete sensor failure and to mean completely normal. Later, a more general random variable taking in is introduced in [29–31], when taking value in means the partial failure of the sensors. It should be pointed out that in most existing references concerning the multiagent systems, the related results have been obtained only by using the information of the variation range of the delay; however, in practice, the distribution of the delay is not uniform, the probability of the delay taking values in a long range may be very small [30–32]. This phenomenon motivates us to investigate the effect of the system performance. Unfortunately, up to now, by employing the distribution information of the time delay, designing the reliable consensus control algorithms by using the sampled data has not been investigated, and the purpose of this paper is to close this gap.
The main contributions of this paper can be summarized as follows. (1) A distributed linear reliable sampled-data consensus protocol is designed, where the actuator fault and random network-induced delay are considered. (2) A more generalized random variable is introduced for describing the different conditions of actuator fault; these conditions contain the case of complete failure, partial failure, complete normal, and measurements distortion. (3) The solvability of derived conditions depends on not only the size of the delay (the sampling period), but also on taking values of failure rates of the actuator fault.
Motivated by the above analysis, sampled-data consensus for nonlinear multiagent dynamical systems is investigated. A distributed linear reliable consensus protocol is designed, where probabilistic actuator and random delay are considered. Based on the input delay approach, some consensus conditions are derived in terms of linear matrix inequalities, containing the information of the actuator fault and random delay, the maximum sampling period (the delay) can be obtained. Finally, a numerical example is provided to demonstrate the effectiveness of the obtained theoretical results.
The rest of this paper is organized as follows. In Section 2, problem formulation and preliminaries are briefly outlined. In Section 3, main results are derived in the form of LMIs. In Section 4, a simulation example is provided to show the advantages of the obtained results, and some conclusions are drawn in Section 5.
Notation. The notation used in the paper is fairly standard. denotes the -dimensional Euclidean space and is a set of real matrices. The notation (resp., , for , means that the matrix is real symmetric positive definite (resp., negative definite). stands for a block-diagonal matrix. denotes the Euclidean norm in . The superscript “” stands for matrix transposition. denotes identity matrix. stands for mathematical expectation. The Kronecker product of matrices and is a matrix in denoted as . In this paper, if not explicitly stated, matrices are assumed to have compatible dimensions.
2. Problem Formulation and Preliminaries
Consider the following nonlinear multiagent dynamical systems consisting of agents where is the position state vector of the th agent. is an unknown but sector-bounded nonlinear vector function to describe the time-varying nonlinear dynamics of agent and is the control input. In this paper, control input is sampled before entering networks based on the sampling technique and zero-order hold circuit, and are the sampling instants satisfying ; for simplicity, it is assumed that , where is the sampling period and then the controller can be described as where is a weighted adjacency matrix, if and only if there is a connection between agent and agent ; otherwise . The Laplacian matrix is defined by and . is a constant denoting the coupling strength; is the feedback controller to be designed.
Let . Then, (2) can be rewritten as where , is the upper bound of the delay which is also the sampling period.
When the actuator experiences failures, we use to describe the control signal to be sent from actuator of the neighbors; that is, where is a random variable taking values on the interval , where . The mathematical expectation and variance of are and , respectively.
Remark 1. Spring by [27–31], when , it means complete failure of actuator. When , it means the actuator has good working condition. When , it means partial failure of the actuator. When , it means the data distortion with the measurement of the actuator is bigger than the real measurement.
Assumption 2. The distribution of the random networked-induced delay can be observed; that is, there exist constants and , where , such that either or , and the probability distribution of taking values in and is known a priori.
Define the following two functions and a stochastic variable:
Assumption 3. is Bernoulli distributed sequence with and . Then, we have and .
Remark 4. The Bernoulli distributed sequence is used to describe the distribution information of the delay in , which is an important characteristic of the network to affect the system performance. Unfortunately, such kind of statistical information has been utilized to design the consensus protocol for multiagent systems.
By using the Kronecker product of the matrices, the above system (7) can be written in a compact form as where
Before starting the main results, some definitions and lemmas are introduced here.
Definition 5. Consensus in multiagent systems (1) is said to be achieved if, for any initial conditions,
Assumption 6 (see ). For , the nonlinear function satisfies the following sector-bounded condition: where are real constant matrices with .
Lemma 8 (see ). and are some constant matrices of appropriate dimensions; satisfies . Then, if and only if
3. Main Results
In this section, we will deal with sampled-data consensus for nonlinear multiagent dynamical systems via reliable control.
Theorem 10. For given some positive scalars , , , and the feedback gain matrix , consensus in system (1) is achieved if there exist appropriate dimensional matrices , , and , , , , and a positive scalar , such that the following LMIs hold: where
Proof. Construct a Lyapunov-Krasovskii functional candidate as
where , , are some matrices to be determined and
The infinitesimal operator of is defined as
Calculating the derivative of along the trajectories of system (8), we have
Denoting , then , and recalling (8), we can obtain
Employing the free matrix method, we have where
It can be shown from (23) that there exist , such that
For , it can be derived from Assumption 6 that
Noting , based on the properties of the Kronecker, we can obtain . For presentation convenience, let , , and . Adding (23) to the right of (20) and substituting (26) and (27) into (20), using Lemma 7, one has where is the element of the th row and the th column of .
By Schur complement and Lemma 8, we can obtain and then it follows that
Therefore, we have which implies that
It is easy to see that is uniformly continuous on , and, from Lemma 9, one has From Definition 5, it can be seen that consensus is achieved in system (1). The proof can be completed.
Remark 11. A sufficient condition is presented for consensus analysis of multiagent systems (1), which is an LMI condition when the gain is given. When the gain is a matrix variable to be determined, the above condition is not an LMI, we are now ready to consider the gain design problem. From Theorem 10, the following result can be derived easily.
Theorem 12. For given some positive scalars , , , , , and , consensus in system (1) is achieved with feedback gain . If there exist appropriate dimensional matrices , , , , , , , and , and a positive scalar , such that the following LMIs hold: where then we can obtain the gain matrix .
Remark 13. The solvability of derived conditions depends on not only the failure rate of the actuator but also on the probability of the delay. Since more information has been employed, less conservative results might be obtained, which can be seen from the following numerical example.
4. Numerical Examples
Example 1. For simplicity, we consider multiagent systems with three agents and the state vector of each node being two dimensional; that is, , , and other related parameters are given as follows:
The nonlinear function is as follows: and then it is easy to verify that
When the delay is random and its probability distribution is known, we can obtain the upper bound of the delay (sampling period) by Theorem 10; it is found in Table 1. It can be seen that when the probability information of the delay values in interval is known, the obtained upper bound of the delay (sampling period) is larger than the one obtained by tradition method with only variation range information () of the delay.
To illustrate the efficiency of the designed method, the following three possible cases are considered.