Mathematical Problems in Engineering

Volume 2015 (2015), Article ID 268083, 10 pages

http://dx.doi.org/10.1155/2015/268083

## Distributed Node-to-Node Consensus of Multiagent Systems with Delayed Nonlinear Dynamics and Intermittent Communications

College of Mathematics and Information and Engineering, Jiaxing University, Zhejiang 314001, China

Received 13 April 2015; Accepted 2 August 2015

Academic Editor: Yang Tang

Copyright © 2015 Kexin Jia et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

The paper is concerned with the problem of distributed node-to-node consensus of multiagent systems with delayed nonlinear dynamics and communication constraints. A new kind of consensus protocol based only on the intermittent measurements of neighboring agents is proposed to make each follower track the corresponding leader asymptotically. Based on the Lyapunov stability theory and *M*-matrix theory, some novel and simple criteria are derived for node-to-node consensus of multiagent systems. It is shown that consensus can be reached if the communication time duration is larger than the corresponding threshold value. Finally, a numerical example is provided to demonstrate the effectiveness of the obtained theoretical results.

#### 1. Introduction

Distributed control of multiagent systems has recently attracted various scientific communities ranging from mathematics to electronic engineering [1, 2], which is partly due to its broad applications in sensor networks, formation of unmanned vehicles, clustering of satellites, and so on. An important issue in distributed control of multiagent systems is consensus control, which can be described as only using the local relative information to make the whole system reach a state agreement [3].

Recently, there are many fruitful results on distributed consensus of multiagent systems, according to the presence or absence of a leader in the considered multiagent systems; within the context of multiagent systems, the commonly studied consensus problems can be classified into three categories: leaderless consensus, leader-following, and containment control. Leaderless consensus means that the states of considered multiple agents achieve a prior unknown agreement [4–6]. Leader-following consensus is also called distributed consensus tracking, which will converge to a designed state trajectory which is generated by a virtual or real leader [7–10]. Distributed containment control of multiagent systems with multiagent systems with multiple leaders has been addressed in the literature [11–15], where the control goal is to make the states of each follower converge to a convex combination of the states of all leaders. It should be noted that there is a common assumption in existing works on containment control that there is no interaction among the leaders. However, in some real applications, there do exist interactions between the neighboring leaders and the state of a given follower needs to track that of a particular leader not the convex combination of the states of all leaders. Motivated by this observation, the notion of distributed node-to-node consensus is introduced in [16, 17]. Specifically, it is assumed that there are two levels in the multiagent systems: the leader’s and the follower’s levels; the dynamics of each leader may only be affected by those of its neighbors in the leader’s levels, while the dynamics of each follower may be affected by those of its neighbors in both leader’s and follower’s levels. It should be noticed that most of the aforementioned works in multiagent systems are derived on a key assumption that information is transmitted continuously among the agents. However, this assumption may not be ensured in some practical cases due to communication disturbances and sensor range limitations [18, 19]. Thus it is reasonable to assume that each agent can sense its neighbors only intermittently. It is worth noting that both impulsive control and intermittent control are discontinuous controls. The difference of them is that impulsive control is activated only at some isolated points [20–22], while intermittent control is activated during some intervals and does not work during the other intervals. On the other hand, impulsive control and intermittent control have attracted more interest recently due to their easy implementation in engineering control and being more efficient and useful in real-life applications. On the other hand, in order to guarantee stability in complex networks, adaptive strategies to appropriately tune the strengths of the interconnections among network nodes have been proposed [23–25]; it can be proved that the fixed coupling strength is larger than those needed in practice. Therefore, it may be conservative; adaptive strategies are proposed and can effectively overcome these shortcomings, which can appropriately tune the strength with the dynamic evolution of the network. Finally, the characteristic of time-delayed coupling is very common in biological and physical systems; some of the time delays are trivial and so can be ignored, while some others cannot be ignored, such as in long distance communication and traffic congestions. Therefore, time delays should be modeled in order to simulate more realistic networks [26, 27].

Motivated by these observations, this paper is devoted to investigate distributed node-to-node consensus problem for a class of multiagent systems with delayed nonlinear dynamics by adaptive intermittent control. The main contributions of this paper can be summarized as follows. (1) The multiagent systems in the present framework consist of two levels, that is, the leader’s level and the follower’s level. (2) The agent dynamics are extended to delayed nonlinear form. (3) A novel adaptive intermittent control protocol is designed, where only a small fraction of followers can sense their corresponding leaders on some disconnected intervals.

*Notation*. The notation used here is fairly standard except where otherwise stated. denotes the -dimensional Euclidean space and is a set of real matrices. and represent the identity matrices and the -dimensional column vector with all entries equal to one. refers to the Euclidean norm. Let stand for a block-diagonal matrix. Symbol denotes the Euclidean norm. represents the transpose of the matrix . For a real symmetric matrix , and represent its largest and smallest eigenvalues, respectively. Notation denotes the Kronecker product. In this paper, if not explicitly stated, matrices are assumed to have compatible dimensions.

#### 2. Problem Formulation and Preliminaries

Let be a directed graph with the set of nodes , the set of directed links , and a weighted adjacency matrix with nonnegative adjacency elements . A directed graph has or contains a directed spanning tree if there exists a node called root such that there exists a directed path from this node to every other node. The Laplacian matrix of the weighted directed network is defined as ; .

*Definition 1. *A nonsingular real square matrix is called an -matrix if all of its off-diagonal elements are nonpositive, and all elements of are nonnegative.

Lemma 2. *Suppose that matrix has nonpositive off-diagonal elements; then is an M-matrix if and only if there exists a positive diagonal matrix , such that , where and .*

Lemma 3. *Suppose that nonnegative function , , satisfies then where , , and is the unique solution of .*

Lemma 4. *Suppose that nonnegative function , , satisfies then where and are two positive constants and .*

Consider that multiagent systems consist of the leader’s and the follower’s level; it is assumed that each level contains coupled agents. The dynamics of the th agent in the leader’s level are described as follows:where is the position state of the th leader. is a continuously differentiable vector-valued function representing the inherent delayed nonlinear dynamics of agent . is the time delay. represents the coupling strength. is the Laplacian matrix of communication topology. Furthermore, the evolution of the th follower is given aswhere is the position state of the th follower. is the control input acting agent .

It is commonly assumed in most existing works that all information is transmitted continuously among the agents. However, in some real situations agents may only communicate with their neighbors over some disconnected time intervals due to the unreliability of communication channels, failure of physical devices; thus the adaptive intermittent consensus protocol is designed as follows:where the pinning link if and only if the th follower can directly sense the th leader; otherwise ; its updating law is given later. The communication time duration satisfies .

*Remark 5. *What kind of agents and how many agents should be pinned? The selection criteria are as follows. Firstly, divide the digraph of the network into components, where each component contains a directed tree; select the root nodes in these components as pinned nodes. There are two reasons: (1) the related message of the leader can be transmitted to each follower; (2) the consensus can be achieved if and only if the root node of each component is pinned, which means that the minimum number of pinning controllers is . If we select the root nodes in these components as pinned nodes, the following consensus is not achieved; we need to rearrange the remaining nodes in descending order according to the differences of out-degrees and in-degrees and gradually increase the amount of control node, until the consensus is achieved. More detailed discussion can be found in the literatures [28, 29].

*Definition 6. *The distributed node-to-node consensus in multiagent systems (5) and (6) is said to be achieved if, for any initial conditions, the following holds:

#### 3. Main Result

In this section, we deal with node-to-node consensus problem for multiagent systems with delayed nonlinear dynamics by adaptive intermittent control. By defining a Lyapunov function and utilizing a combination of stability theory and Kronecker products, some simple conditions are established to ensure node-to-node consensus of multiagent systems (5) and (6). The following assumption is needed to derive the main results.

*Assumption 7. *For the nonlinear function in (5) and (6), there exist two positive constants such thatwhere .

Substituting (7) into (6), one has

For convenience, systems (5) and (10) can be rewritten aswhere

Let ; then the following error system can be obtained from (11) such thatwhere

It is not hard to verify that node-to-node consensus for multiagent systems (5) and (6) will be achieved if and only if zero equilibrium point of error system (13) is globally attractive.

Theorem 8. *Suppose that Assumption 7 holds; then distributed node-to-node consensus problem for multiagent systems (5) and (6) is achieved under the following distributed adaptive intermittent control protocol:and the updating law is defined asif the following conditions hold:where *

*Proof. *Choose the following Lyapunov function candidate:where , satisfies . are some undetermined sufficiently large positive constants.

(1) For and an arbitrarily given , taking the derivative of along the trajectories of system (13) can be given as follows:where(2) For with arbitrarily given , taking the time derivative along the trajectories of (13), we havewhere .

Note that, for an arbitrarily given , the matrix is normal; for any given , it is easily derived from the generalized eigenvalue theory thatwhere ; then one hasBy considering (18), (24), and (26), we can obtainwhere .

Based on the above analysis and according to Lemma 3, when , we can obtainwhere is the positive solution of .

When , by using Lemma 4, one hasConsider ; thenwhere .

Next, for all , we will prove that . One hasFor any , there exists a positive integer , such that ; then one has the following.

When , we can obtainWhen , we haveFrom (32) and (33), we can obtainwhere , which indicates that the states of agents exponentially converge to node-to-node consensus. This completes the proof.

*Remark 9. *It can be seen from (34) that the convergence speed is related to the value of ; by some simple computation, we have from the above equation, we can see that the convergence speed will accelerate with the increase of . Therefore, a trade-off has to be made between the convergence rate and the control cost.

#### 4. A Numerical Example

In this section, a numerical example is provided to verify the analysis results.

*Example 1. *Suppose that there are five leaders in the considered multiagent systems; the communication topologies among the leaders and the followers are given in Figure 1; the solid lines indicate the neighboring relationship among the agents in the same level, while the dashed lines are the pinning links; the corresponding Laplacian matrix and the pinning matrix are given as follows:The nonlinear dynamics are described as ; it can be verified that the intrinsic nonlinear dynamics of the agents obey Assumption 7 with .

By some simple computation, we havethen we can obtain , , and . Taking , , and , by using condition (17) in Theorem 8, we can obtain ; let . By using condition (18), we have , here taking . Then we can obtain the communication , taking . It is assumed that the agents communicate with their neighbors only when , which indicates that the average communication rate is . The position state trajectories of the leaders and the followers are shown in Figures 2–6, which indicate that node-to-node consensus in multiagent systems (5) and (6) is indeed guaranteed. The position state error trajectories of agents are shown in Figure 7, which further demonstrate the effectiveness of the obtained criteria. The curve of adaptive intermittent control is shown in Figure 8; it is noted that the control in time interval . The trajectory of pinning feedback gain under the updating laws (16) is shown in Figure 9. The simulation has confirmed the effectiveness of our theoretical results.