# Consensus Control of Time-Varying Delayed Multiagent Systems with High-Order Iterative Learning Control

Authors: Xiongfeng Deng; Xiuxia Sun; Ri Liu; Shuguang Liu
Journal: International Journal of Aerospace Engineering
 (2018)

---

## Abstract

We address the consensus control problem of time-varying delayed multiagent systems with directed communication topology. The model of each agent includes time-varying nonlinear dynamic and external disturbance, where the time-varying nonlinear term satisfies the global Lipschitz condition and the disturbance term satisfies norm-bounded condition. An improved control protocol, that is, a high-order iterative learning control scheme, is applied to cope with consensus tracking problem, where the desired trajectory is generated by a virtual leader agent. Through theoretical analysis, the improved control protocol guarantees that the tracking errors converge asymptotically to a sufficiently small interval under the given convergence conditions. Furthermore, the bounds of initial state difference and disturbances tend to zero; the bound of tracking errors also tends to zero. In the end, some cases are provided to illustrate the effectiveness of the theoretical analysis.


---

## Body

## 1. Introduction

In the past few decades, cooperative control of multiagent systems has been attracted outstanding attention. One of the main reasons is its wide application in various fields, such as military, aerospace, and industrial [1]. The research directions include formation control, containment control, tracking control, swarm control, and flocking control [2–6]. Generally speaking, the fundamental problem for cooperative control is consensus, where the objective is to design an appropriate control law so that the whole states of a group of agents eventually reach an agreement.In the process of studying the cooperative problem of multiagent systems, diverse control strategies are proposed in many literatures. For example, the output regulation method and distributed containment control law for the containment control of linear multiagent systems were investigated in [7, 8], while an advanced clustering with the frequency sweeping method was used for the general linear multiagent systems with communication and input delay in [9]. Nevertheless, it should be emphasized that almost all practice systems involve nonlinear dynamics. In [10, 11], the distributed adaptive control protocol and pinning control algorithm for the consensus of a class of second-order leader-following nonlinear multiagent systems with directed topology were considered. In [12], a distributed cooperative method was applied to deal with the dynamic task planning of multiple satellites. Additionally, the neural network algorithm was also introduced to study the consensus problem of nonlinear multiagent systems [13, 14].In practice, time delays always exist due to the impact of physical factors of the sensor. Therefore, it is of great significance to study the time delay system. In [15], a distributed consensus control protocol with decaying gains for linear discrete-time multiagent systems with delays and noises was considered; and the cases of communication delay and input delay were studied in [16, 17]. For the problem of time-varying delays, Xiao and Wang [18] investigated the state control problem of multiagent systems with bounded time-varying communication delays and Chen et al. [19] presented a robust control law for a class of time-varying delayed multiagent systems with noisy environment.As we know, iterative learning control is based upon the idea that the performance of a system that performs the same task repeatedly can be improved by learning from previous iterations [20]. In early works, iterative learning control has been considered in various issues. In [21], an iterative learning control scheme was proposed to make the tracking error trajectory converge to the prespecified error trajectory. In [22], an adaptive iterative learning updating law was applied to solve the tracking problem of high precision motion systems. In [23], the packet dropout problem of nonlinear systems with iterative learning control was developed; and Wu et al. [24] solved the high precision satellite attitude tracking control by using iterative learning control. Additionally, a high-order iterative learning identification scheme was considered to extract the projectile’s aerodynamic drag coefficient curve from radar measured velocity data in [25]; and the stability analysis of a high-order iterative learning control problem for discrete-time systems and nonlinear switched systems was also studied in [26, 27], respectively. In recent years, the application of iterative learning control has been extended to multiagent systems. In [28], a D-type iterative learning control scheme was presented to deal with the tracking problem of multiagent systems. In [29], a distributed adaptive fuzzy iterative learning control algorithm for the coordination control problem of leader-following multiagent systems with unknown dynamics and nonrepeatable input disturbances was designed; and Meng and Jia [30] developed a finite-time consensus control protocol with iterative learning control for a class of multiagent systems. In addition, the iterative learning control was also considered to achieve formation control of multiagent systems [31, 32].By analyzing the above literature, it is not difficult to find that there exist few results about the consensus problem of time-varying delayed multiagent systems with iterative learning control. Moreover, the application of high-order iterative learning control for multiagent systems is also seldom described in the existing papers. These facts inspired our current study. In this work, we divert our attention to the consensus control of time-varying delayed multiagent systems with high-order iterative learning control. The main contributions of this work are summarized as follows: (i) a class of time-varying delayed multiagent systems with directed communication topology is considered in this paper. The dynamic of each agent contains time-varying nonlinear dynamic and external disturbance, where the time-varying nonlinear term satisfies the global Lipschitz condition and the disturbance term satisfies norm-bounded condition; (ii) different from [26, 27], an improved high-order iterative learning control scheme is applied to guarantee the tracking error convergence in the iteration domain. Furthermore, we show that the bound of tracking errors also tends to zero when the bounds of initial state difference and disturbances tend to zero; and (iii) it is proven that the improved control protocol can effectively handle the consensus problem of multiagent systems with time-varying delays and external disturbances.The rest of this paper is organized as follows. Some necessary preliminaries are introduced in Section2. The problem formulation and main results about time-varying delayed multiagent systems with high-order iterative learning control are discussed in Sections 3 and 4, respectively. In Section 5, the effectiveness of the proposed control protocol is illustrated by simulations, and briefly, conclusions are outlined in Section 6.


## 2. Preliminaries

In this section, graph theory, definition, and lemma which will be utilized in this paper are introduced briefly.


### 2.1. Graph Theory

For a multiagent systems withn agents, the exchange information among agents can be modeled as an interaction graph with n nodes. Let G=V,E,A denote a directed graph with a node set V=v1,…,vn and a directed edge set E=i,j,i,j∈V,i≠j. And the adjacency matrix of the directed graph is defined by A=aij∈ℝn×n, where aij>0 if and only if i,j∈E and aij=0 otherwise. Moreover, it is assumed that aii=0. For agent i, the set of neighbors is denoted by Ni=vj:vj,vi∈E. The Laplacian matrix L is denoted by L=D−A, where D=diagd1,…,dn with di=∑j=1Niaij.In this work, an augmented graph is described asG¯ which consists of n agents and one virtual leader agent. The communication between agents and the virtual agent is defined by the matrix B=diagb1,…,bn. If agent i can obtain the information of the virtual agent, then bi>0 and bi=0 otherwise.


### 2.2. Definition and Lemma

Definition 1 (see [33]).
For a functionyt:0,T→ℝn, the λ norm is defined by
(1)ytλ=supt∈0,Te−λtyt,λ>0.
The following property forλ norm is held.Property 1.
For functionsht,yt:0,T→ℝn, if yt=∫0thsds, then have
(2)ytλ≤ολhtλ,where ολ=λ−11−e−λT.Lemma 1 (see [34]).
For a real positive seriesann∈1,2,…,∞ satisfies
(3)an≤β1an−1+β2an−2+⋯+βNaN−2+σ,n=N+1,N+2,…where βm≥0m=1,2,…,N and σ≥0 and exists
(4)β=∑i=1Nβm<1,then have
(5)limn→∞an≤σ1−β.


## 2.1. Graph Theory

For a multiagent systems withn agents, the exchange information among agents can be modeled as an interaction graph with n nodes. Let G=V,E,A denote a directed graph with a node set V=v1,…,vn and a directed edge set E=i,j,i,j∈V,i≠j. And the adjacency matrix of the directed graph is defined by A=aij∈ℝn×n, where aij>0 if and only if i,j∈E and aij=0 otherwise. Moreover, it is assumed that aii=0. For agent i, the set of neighbors is denoted by Ni=vj:vj,vi∈E. The Laplacian matrix L is denoted by L=D−A, where D=diagd1,…,dn with di=∑j=1Niaij.In this work, an augmented graph is described asG¯ which consists of n agents and one virtual leader agent. The communication between agents and the virtual agent is defined by the matrix B=diagb1,…,bn. If agent i can obtain the information of the virtual agent, then bi>0 and bi=0 otherwise.


## 2.2. Definition and Lemma

Definition 1 (see [33]).
For a functionyt:0,T→ℝn, the λ norm is defined by
(1)ytλ=supt∈0,Te−λtyt,λ>0.
The following property forλ norm is held.Property 1.
For functionsht,yt:0,T→ℝn, if yt=∫0thsds, then have
(2)ytλ≤ολhtλ,where ολ=λ−11−e−λT.Lemma 1 (see [34]).
For a real positive seriesann∈1,2,…,∞ satisfies
(3)an≤β1an−1+β2an−2+⋯+βNaN−2+σ,n=N+1,N+2,…where βm≥0m=1,2,…,N and σ≥0 and exists
(4)β=∑i=1Nβm<1,then have
(5)limn→∞an≤σ1−β.


## 3. Construction of the Control Protocol for the Consensus Problem

In this section, the main works are carried out to formulate the consensus problem and construct the consensus control protocol. In addition, some assumptions are also provided.Considering the multiagent systems which consist ofn identical agents with time-varying delays and nonlinear dynamics, the dynamics of the ith agent at kth iteration are described by
(6)żikt=fzikt,zikt−τd1,t+Bzikt,zikt−τd2,tuikt+wikt,yikt=gzikt,t,where zikt∈ℝ2, uikt∈ℝ, and yikt∈ℝ2 are the state, control input, and output of the system, respectively; wikt∈ℝ2 is bounded disturbance; the time t∈0,T and T is given; τd1,τd2≤T are time delays; and i∈0,1,…,n. The functions f⋅,⋅,⋅:ℝ2×ℝ2×0,T→ℝ2 and B⋅,⋅,⋅:ℝ2×ℝ2×0,T→ℝ2 are piecewise continuous in t; and g⋅,⋅:ℝ2×0,T→ℝ2 is differentiable in z and t, with gz⋅,⋅ and gt⋅,⋅. In addition, it is assumed that zikt=0 if t<0.The matrix form of (6) is expressed as
(7)żkt=fzkt,zkt−τd1,t+Bzkt,zkt−τd2,tukt+wkt,ykt=gzkt,t,where zkt=z1ktT,…,znktTT, fzkt,zkt−τd1,t=fTz1kt,z1kt−τd1,t,…,fTznkt,znkt−τd1,tT, Bzkt,zkt−τd2,t=diagBz1kt,z1kt−τd2,t,…,Bznkt,znkt−τd2,t, ukt=u1kt,…,unktT, wkt=w1ktT,…,wnktTT, ykt=y1ktT,…,ynktTT, and gzkt,t=gTz1kt,t,…,gTznkt,tT.The dynamics of virtual leader agent are given as(8)żdt=fzdt,zdt−τd1,t+Bzdt,zdt−τd2,tudt,ydt=gzdt,t,which may show a given bounded desired trajectory ydt∈ℝ2; there exist unique bounded input udt∈ℝ and t∈0,T such that when ut=udt, the virtual agent has a unique bounded state zdt∈ℝ2 and output ydt=gzdt,t.Similar to the expression of (7), the matrix form of (8) is expressed as
(9)żdt=fzdt,zdt−τd1,t+Bzdt,zdt−τd2,tudt,ydt=gzdt,t,where zdt=1n⊗zdt, fzdt,zdt−τd1,t=1n⊗fzdt,zdt−τd1,t, Bzdt,zdt−τd2,t=In⊗Bzdt,zdt−τd2,t, udt=1n⊗udt, ydt=1n⊗ydt, and gzdt,t=1n⊗gzdt,t; 1n=1,…,1T, In is n dimension unit matrix, and ⊗ represents the Kronecker product.Given the desired output trajectory of the virtual agentydt, the goal is to find a control consensus ukt such that when k→∞, the output ykt of all agents will track the desired output trajectory ydt as close as possible.According to (7) and (9), the consensus tracking error of the agent i at the kth iteration is defined as
(10)εikt=∑j∈Niaijyikt−yjkt+biydt−yjkt,and have
(11)εkt=H¯ektwhere H¯=H⊗I2, H=L+B, εkt=ε1kt,…,εnktT, ekt=e1kt,…,enktT, and ekt=ydt−ykt.Before introducing a high-order iterative learning control scheme, we give the following assumptions.Assumption 1.
The functionsf⋅,⋅,⋅, B⋅,⋅,⋅, and g⋅,⋅ and the partial derivatives gz⋅,⋅ and gt⋅,⋅ are uniformly globally Lipschitz in z⋅ on the interval 0,T. That is, there exist constants κα, κfr, and κBr r=1,2 such that
(12)αx1t,t−αx2t,t≤καx1t−x2t,fx1t,x1t−τd1,t−fx2t,x2t−τd1,t≤κf1x1t−x2t+κf2x1t−τd1−x2t−τd1,Bx1t,x1t−τd2,t−Bx2t,x2t−τd2,t≤κB1x1t−x2t+κB2x1t−τd2−x2t−τd2,where α∈g,gz,gt.Assumption 2.
The functionsgz⋅,⋅, B⋅,⋅,⋅, wk⋅, and żd⋅ are uniformly bounded with bounds bgz, bB, bw, and bżd which are denoted by
(13)bgz=maxsupk→∞,t∈0,Tgzzkt,t,bB=maxsupk→∞,t∈0,TBzkt,zkt−τd2,t,bw=maxsupk→∞,t∈0,Twkt,bżd=supt∈0,Tżdt.We now present the following improved high-order iterative learning control scheme for the multiagent systems (7) and (9):
(14)uk+1t=∑m=1N1−μPmtult+μu0t+∑m=1NQmylt,tεlt+Rmylt,tε̇lt+Smylt,t∫0tεlsds,where l=k−m+1, εlt=H¯elt, u0t is initial given control input, integer N≥1 is the order of the iterative learning control scheme, and 0<μ<1 is a weighting parameter to prevent the large fluctuation of the input at the beginning of the iterative operation. The term μ may be allowed to vary with the iteration and let it fixed for simplicity in this paper. Pmt is the time-varying matrix to regulate the rate of convergence, which needs to satisfy certain convergence condition (will be introduced below). Like the description of [25, 27], Qm⋅,⋅, Rm⋅,⋅, and Sm⋅,⋅ are learning matrices. In addition, it is assumed that Qm⋅,⋅H¯, Rm⋅,⋅H¯, and Sm⋅,⋅H¯ are bounded, and their bounds are defined by bQ, bR, and bS, respectively, for instance,
(15)bQ=maxsupm∈1,…,N,t∈0,TQmylt,tH¯.Remark 1.
IfN=1 for (14), the iterative learning control scheme may be considered as a PID-type control law similar to the convention PID controller; and if N≥2, it can be seen as consisting of dual or multiple PID controllers. As more past learning errors are considered, it implies that the high-order iterative learning control scheme has better control effect than one-order. Generally speaking, the higher the orders of the control scheme, the better the iterative learning control performance is expected. However, the choice of N in practice is normally not more than 3.Remark 2.
Like the choice of parameters of the traditional PID algorithm, the choice ofQm⋅,⋅, Rm⋅,⋅, and Sm⋅,⋅ is usually based on a trial-and-error method. Considering that the purpose of Qm⋅,⋅ is to increase the convergence speed of the system, Rm⋅,⋅ is to eliminate the steady-state error of the system, and Sm⋅,⋅ is to overcome the oscillation and improve the stability of the system, their weight can be tuned according to the control requirements. In addition, the control approaches such as a fuzzy adaptive method, a neural network algorithm, and particle swarm optimization algorithm can be also applied to obtain the optimal learning matrices.


## 4. Convergence Analysis

In this section, we will analyze the convergence of time-varying delayed multiagent systems (7) and (9) with a high-order iterative learning control scheme (14). The convergence conditions are shown in the following theorem.For clarification of the remaining discussion, the variablet will be omitted, and the following notations will be introduced. That is,
(16)αk=αzkt,t,αd=αzdt,t,δαk=αd−αk,bα=maxsupk→∞,t∈0,Tαzkt,t.where α represents a function concerned.The partial derivatives ofαxt,t are expressed by
(17)αzk=∂αxt,t∂xtxt=zkt,αtk=∂αxt,t∂txt=zkt,αzd=∂αxt,t∂xtxt=zdt,αtd=∂αxt,t∂txt=zdt.Hence, it is easy to find thatδαk≤καδzk, where κα is the Lipschitz constant of the function α on the interval 0,T. We now state the main result of this paper.Theorem 1.
Let the multiagent systems (7) and the virtual agent dynamic (9) satisfy Assumptions 1 and 2and suppose that the initial state difference zd0−zk0is bounded. If there exist
(18)∑m=1NPmt=In,and positive numbers βm satisfying
(19)1−μPmt−Rmyt,tH¯gzzt,tBzt,zt−τd2,t≤βm,∑m=1Nβm=β<1.and then the bounds of tracking errors zdt−zikt andydt−yikt converge asymptotically to a sufficiently small interval as k→∞ for i∈1,…,n. Furthermore, the bounds of initial state difference and disturbances tend to zero; the bound of tracking errors also tends to zero.Proof.
According to the multiagent systems (7) and (9), we have
(20)el=yd−yl=δgl,and then
(21)ėl=ẏd−ẏl=gzdżd+gtd−gzlżl+gtl=gzdżd−gzlżd+gzlżd−gzlżl+gtd−gtl=gzd−gzlżd+gzlżd−żl+gtd−gtl=δgzlżd+gzlδżl+δgtl,where l=k,k−1,…,k−N+1.Also,(22)δżl=żd−żl=fd+Bdud−fl+Blul+wl=fd−fl+Bd−Blud+Blud−ul−wl=δfl+δBlud+Blδul−wl,where δfl=fzdt,zdt−τd1,t−fzlt,zlt−τd1,t and δBl=Bzdt,zdt−τd2,t−Bzlt,zlt−τd2,t.Substituting (11) into (14) gets
(23)uk+1=∑m=1N1−μPmtul+μu0+∑m=1NQmylt,tH¯el+Rmylt,tH¯ėl+Smylt,tH¯∫0telds.Furthermore, substituting (18), (20), (21), and (22) into (23) yields
(24)δuk+1=ud−uk+1=∑m=1N1−μPmtud−∑m=1N1−μPmtul+μud−μu0−∑m=1NQmylt,tH¯el+Rmylt,tH¯ėl+Smylt,tH¯∫0telds=∑m=1N1−μPmtδul+μδu0−∑m=1NQmylt,tH¯δgl−∑m=1NSmylt,tH¯∫0tδglds−∑m=1NRmylt,tH¯δgzlżd+gzlδfl+δBlud+Blδul−wl+δgtl=∑m=1N1−μPmt−Rmylt,tH¯gzlBlδul+μδu0−∑m=1NQmylt,tH¯δgl−∑m=1NSmylt,tH¯∫0tδglds−∑m=1NRmylt,tH¯δgzlżd+gzlδfl+δBlud−wl+δgtl.Considering the condition (19), taking norms on both sides of (24) has
(25)δuk+1≤∑m=1Nβmδul+μδu0+∑m=1NbQκgδzl+∑m=1NbSκg∫0tδzlds+∑m=1NbRbżdκgz+κgt+bgzκf1+budκB1δzl+bgzbw+∑m=1NbRbgzκf2δzlt−τd1+bgzbudκB2δzlt−τd2≤η0+∑m=1Nβmδul+μδu0+η1∑m=1Nδzl+η2∑m=1N∫0tδzlds+∑m=1NbRbgzκf2δzlt−τd1+bgzbudκB2δzlt−τd2,where
(26)bud=supt∈0,Tudt,η0=NbRbgzbw,η1=bQκg+bRbżdκgz+κgt+bgzκf1+bgzbudκB1,η2=bSκg.Writing the integral expression forzl and taking norms, we get
(27)δzl=δzl0+∫0tδżlds≤δzl0+∫0tκf1+budκB1δzl+κf2δzlt−τd1+budκB2δzlt−τd2+bBδul+bwds.In the light of Definition1 and the fact that yt−τdλ≤ytλ, we have
(28)supt∈0,Te−λt∫0tys−τdλds≤ytλoλe−λτd.Considering (28) and taking λ norm on both sides of (27) obtain
(29)δzlλ≤δzl0+bwT+η3oλδzlλ+bBoλδulλ,where
(30)η3=κf1+κB1bud+κf2e−λτd1+κB2bude−λτd2.Obviously, thereη3oλ<1 for a sufficiently large λ and then have
(31)δzlλ≤δzl0+bwT+bBoλδulλ1−η3oλ.Similarly, takingλ norm on both sides of (25), we have
(32)δuk+1λ≤η0+∑m=1Nβmδulλ+μδu0λ+η4∑m=1Nδzlλ,where
(33)η4=η1+η2oλ+bRbgzκf2e−λτd1+κB2bude−λτd2.Substituting (31) into (32) yields
(34)δuk+1λ≤∑m=1Nβ¯mδulλ+σ,where
(35)β¯m=βm+η4bBoλ1−η3oλ,(36)σ=η0+μδu0λ+η4∑m=1Nδzl0+bwT1−η3oλ.Considering the condition (19) again, we have β¯m<1 for a sufficiently large λ, then β¯=∑m=1Nβ¯m<1. Hence, according to the Lemma 1, it is obtained that
(37)limk→∞δukλ≤σ1−β¯.Furthermore, we also have(38)δykλ≤κgδzkλ.From (31), (36), and (38), one can be observed that the tracking errors δzk, δuk, and δyk are all relevant to the initial state error δzk0 and disturbance bound bw. Furthermore, if μ, δzk0, and bw tend to zero, the bound of tracking errors also tends to zero through the iterative operations of the iterative learning control algorithm. The proof completed.Remark 3.
Under the convergence conditions (18) and (19), one finds that the convergence of iterative learning control is not influenced by the disturbances, the initial state difference, and even the choice of μ. However, the bound of the final tracking errors is directly influenced by those factors. In addition, the iterative learning control algorithm itself as using alone cannot eliminate disturbances or initial state difference, but it can realize a perfect tracking once those factors will not appear any more in the coming iterations.


## 5. Simulation Analysis

In this section, we will provide some cases to illustrate the effectiveness of the high-order iterative learning control scheme (14). Consider a time-varying delayed multiagent systems with five agents labeled as 1, 2, 3, 4, and 5. The virtual leader agent is labeled as 0. The communication graph with five agents and one virtual agent is shown in Figure 1.Figure 1
Communication topology graph.The adjacency matrix is(39)A=0000000010000101000100000,ℬ=diag1,0,0,0,1.The dynamics of agenti at the kth iteration are described as
(40)żikt=viktsinvikt+xikt−τd1+00.2cosvikt−τd2uikt+e−ksinte−ksint,yikt=xiktvikt,where zikt=xikt,viktT and i=1,2,3,4,5.The dynamics of a virtual leader agent are given as(41)żdt=vdtsinxdt−τd1+00.2cosvdt−τd2udt,ydt=xdtvdt,where zdt=xdt,vdtT, and (41) indicates that the desired output trajectory is obtained by a desired input udt and state zdt.The parameters are set as follows: the initial position and velocity of five agents are given asx00=−0.5,−0.2,0.2,0.4,0.7Tm and v00=−0.3,−0.1,0.2,0.3,0.5Tm/s, respectively; the initial input u00=0.1,0.1,0.1,0.1,0.1T; the simulation time t∈0,3s and time-varying delays τd1=0.2s and τd2=0.3s; the initial states of a virtual agent are xd0=0.1m and vd0=0.1m/s; the desired input udt=sin2πt; the term μ=0.5; and kmax=50.According to (40), we have
(42)gzzt,t=∂gzt,t∂zt=I10,Bzt,zt−τd2,t=diagBz1t,z1t−τd2,t,…,Bz5t,z5t−τd2,t∈diag0,−0.2T,…,0,−0.2T,diag0,0.2T,…,0,0.2T.In order to analyze the effectiveness of a high-order iterative learning control scheme (14), the following cases are discussed. It should be noted that the parameters Pm⋅, Qm⋅,⋅, Rm⋅,⋅, and Sm⋅,⋅ m∈1,2,3 are obtained by the trial-and-error method.Case 1.
In this case,N=1, P1=I5, Q1=1.5I5⊗11×2, R1=0.6I5⊗11×2, and S1=0.5I5⊗11×2.Case 2.
In this case,N=2, P1=0.5I5 and P2=0.5I5, Q1=1.5I5⊗11×2 and Q2=I5⊗11×2, R1=0.6I5⊗11×2 and R2=0.4I5⊗11×2, and S1=0.5I5⊗11×2 and S2=0.6I5⊗11×2.Case 3.
In this case,N=3; P1=0.5I5, P2=0.25I5, and P3=0.25I5; Q1=1.5I5⊗11×2, Q2=I5⊗11×2, and Q3=0.5I5⊗11×2; R1=0.6I5⊗11×2, R2=0.4I5⊗11×2, and R3=0.2I5⊗11×2; and S1=0.5I5⊗11×2, S2=0.6I5⊗11×2, and S3=0.7I5⊗11×2.Checking the convergence conditions (18) and (19) in Theorem 1, we get the following.Case 1.
P1t=I5,β1=1−μP1t−R1yt,tH¯gzBmax=0.3847<1.Case 2.
P1t+P2t=0.5I5+0.5I5=I5,β2=1−μP2t−R2yt,tH¯gzBmax=0.3214,β1+β2=0.7061<1.Case 3.
P1t+P2t+P3t=0.5I5+0.25I5+0.25I5=I5,β3=1−μP3t−R3yt,tH¯gzBmax=0.2596,β1+β2+β3=0.9657<1.Then, we ensure the satisfaction of the convergence conditions (18) and (19).The simulation results for Case1, Case 2, and Case 3 at 50th iteration are shown in Figures 2, 3, 4, and 5, respectively.Figure 2
State tracking trajectories for Case1.Figure 3
State tracking trajectories for Case2.Figure 4
State tracking trajectories for Case3.Figure 5
Control signal for Case3.Figures2, 3, and 4 show the tracking trajectories of time-varying delayed multiagent systems with a high-order iterative learning control scheme under different orders at the 50th iteration, which indicate that the consensus is achieved by using the proposed control protocol. However, compared with Figures 3 and 4, the fluctuation and control effect of Figure 2 are the worst. For Figure 4, it is not difficult to find that the control effect is better than Figures 2 and 3. The results of Figures 2, 3, and 4 imply that the higher the orders and the better the control effect. Figure 5 gives the control input curves of five agents for Case 3 and implies that the input of agents can converge asymptotically to the desired input value.Case 4.
Comparison and analysis with other control protocols.In order to illustrate the control effect, another control law is selected to compare with the proposed control scheme (14) (scheme 1) of this paper. Consider the high-order iterative learning control updating law (7) (scheme 2) in [27], which did not include specific provision for the first iteration term. Let the order N=2, the parameter setting is same as the Case 2 of this paper. Check the convergence conditions (27), (28) of Theorem 9 in [27], then have P1t+P2t=0.5I5+0.5I5=I5, ρ1=P1t−R1yt,tH¯gzBmax=0.4257<1, ρ2=P2t−R2yt,tH¯gzBmax=0.2416<1, and ρ1+ρ2=0.6673<1, which mean the conditions are satisfied. The simulation results are shown in Figures 6 and 7.Figure 6
Position tracking trajectories.
(a)
(b)
(c)
(d)
(e)Figure 7
Velocity tracking trajectories.
(a)
(b)
(c)
(d)
(e)Figures6 and 7 show the comparison results of position and velocity with two control schemes. It is implied that the consensus of multiagent systems with the two control laws can be achieved. However, the control effects with the consensus law of this paper are better than the control law of [27].In addition, the maximum tracking errors with different time delays forN=3 are also analyzed. The simulation results are shown in Figures 8 and 9.Figure 8
Maximum tracking errors of position with different time delays.Figure 9
Maximum tracking errors of velocity with different time delays.Figures8 and 9 give the maximum tracking errors of position and velocity with different time delays. Although the time delays are different, the consensus of multiagent systems with a high-order iterative learning control scheme is still achieved. That is to say, the convergence of the proposed control protocol is not affected by time delays.


## 6. Conclusions

In this paper, we have discussed the consensus control problem of time-varying delayed multiagent systems with directed communication topology. An improved high-order iterative learning control scheme is applied to solve the consensus tracking problem of multiagent systems. The desired tracking trajectory is produced by a virtual leader agent. Under the given convergence conditions, the consensus can be achieved by using the proposed control protocol. Based on simulation results, the control effect can be improved by utilizing a high-order iterative learning control scheme. Also, it is implied that the higher the orders, the better the control effect. In addition, compared with another control law, the better control effect with the proposed control scheme of this paper can be obtained. Furthermore, through analyzing the maximum state tracking errors of a multiagent with different time delays, the delays do not play a significant role in the convergence of high-order iterative learning control. In our future work, the consensus problem of multiagent systems with control input delays will be considered.



---

*Source: 4865745-2018-08-05.xml*