# Consensus Problem for Linear Time-Invariant Systems with Time-Delay

Authors: V. Fragoso-Rubio; M. Velasco-Villa; M. A. Vallejo-Alarcón; J. A. Vásquez-Santacruz; M. A. Hernández-Pérez
Journal: Mathematical Problems in Engineering
 (2019)

---

## Abstract

This work deals with the consensus problem of networks of agents with linear time-invariant dynamics and input time-delay. A predictor-observer scheme that estimates the future value of the system state is considered. The partitioned nature of the predictor allows dealing with larger time-delays than those reported in the literature. The estimated future state of the system is later used in the consensus protocol with the aim of compensating the system input delay. The effectiveness of the solution is shown by means of numerical evaluations.


---

## Body

## 1. Introduction

Interest in multiagent systems is due to the multiple possible applications of this kind of systems such as the formation problem of Unmanned Aerial Vehicles (UAV), groups of satellites, formation control vehicles, distributed sensors, automatic vehicular control, and communication networks; for instance, see [1–3]. Consensus problem is referred to as the control and coordination of a set of agents within a communication topology. In the study of consensus problem for multiagent systems, factors as communication topology, time-delays, and dynamic model become relevant [4–7]. The importance of the Laplacian of the network in the solution of the consensus problem has been studied in [1, 2, 8]. The consensus problem becomes a more challenging task when the communication topology among agents presents time-delays. Several solutions have been reported considering different system conditions as fixed time-delay and topologies [9], multiple time-delay cases [10, 11], systems with topologies that change over time [12], and also systems within a discrete-time context [10]. Consensus problem for systems with single integrator dynamics has been widely studied [4, 5, 13]; solutions for agents with double integrator dynamics are presented in works such as [9, 13]. High-order linear systems have been dealt with in [7], where consensus problem is converted in the simultaneous stabilization of multiple subsystems and sufficient conditions for consensus and consensualization independent of the number of agents in the systems are presented; this work is extended in [14] by considering variable time-delays. Linear time-invariant (LTI) systems with variable topologies and multiple time-delays are considered in [15] and necessary and sufficient conditions for consensus are given. A PD-like consensus scheme that transforms a system with constant or variable delays into a neutral type system is presented in [16]. Prediction-based schemes have been proposed for systems without time-delays to estimate the current state of the agents when only relative measurements are available. For systems with time-delay the consensus problem of single integrator agents with input and output time-delay is studied in [17] where a state predictor is used to compensate the time-delay, while consensus-based formation of agents with double integrator dynamics [18] and heterogeneous systems composed of agents with single and double integrators [19] are studied and the input time-delay is compensated by means of a state predictor. The consensus problem of high-order multiagent systems with input and output communication delays is solved in [20] by means of a truncated predictor-based scheme. The truncated predictor approach is extended in [21] to compensate the input time-delay of nonlinear systems in order to achieve consensus, while a nonlinear adaptive observer estimates the states of the agents that are used in the adaptive control scheme that is proposed in [22] to achieve leader-following consensus for uncertain nonlinear multiagent systems.The control problem of systems with time-delays has also been of the interest of the scientific community. To overcome this difficulty, many solutions have been presented. A first approach was the Smith Predictor [23], composed by a control designed without considering the system time-delay and a prediction of the output that compensates the delay. Several modifications of the scheme were later presented to overcome its shortcomings and to expand the types of systems where it is applicable; see [24, 25] being some of these works. The assignment of a finite spectrum of the closed-loop system (Finite Spectrum Assignment) is the goal of the approach presented in [26]. The reduction strategy in [27] is motivated by a similar idea. However, in these solutions, the dimension of the feedback law is infinite, which implies that the implementation of this method must be realized by means of a numerical approximation. Safe numerical implementations are presented in [28, 29].The prediction approach took a step further in [30] where the state prediction is attained for linear systems with both input and state delays. Nonetheless, these chained observers are composed by distributed terms, in which implementation requires a numerical approximation. It is in the work of Najafi et al. [31] where a group of chained predictors with finite spectrum is proposed to compensate the input delay of linear MIMO systems. The approach assumes that the whole system state can be measured and guarantees asymptotic stability of the closed-loop system and prediction error. The stability proof of the closed-loop system results in a method to calculate the gain matrices of the predictor and the control by means of Linear Matrix Inequalities (LMI). The work is extended in [32] where robust H∞ control is used to minimize the input disturbance effect on the prediction error for linear systems with input time-delay. The idea of a sequence of predictors has been applied to linear systems with time-varying input [33] and time-varying output [34] time-delays and to time-varying systems with time-varying delays [35]. In [36] the state of a nonlinear system with delayed output is reconstructed by means of a chained set of observers. The main advantage of the chained predictors resides on their ability to deal with larger time-delays.Based on the idea of the nested predictor [31, 34], the present paper deals with the consensus problem of LTI systems with constant time-delay by proposing a modification of the predictor-observer scheme presented in [37] that estimates the state of the system forecasted τ units of time into the future. The predictor assumes that only a part of the state space can be measured and the definition of the subpredictor errors allows proving that its convergence implies the convergence of the predicted state to the future system state. The estimated future state is later on used by the consensus algorithm, to compensate the input delay of the system. It is important to note that since there is a time-delay in the input of the systems, by using the forecasted estimated state, the closed-loop system will be in terms of the current state which results in the compensation of the input time-delay. The consensus protocol presented here is an adaptation of the one proposed in [7] for LTI systems and initially adapted for the input delay case in [38]. The modification to the protocol that we propose consists of using the predicted future state instead of the current and delayed states, which allows systems with larger delays to achieve consensus, as it will be shown in the numerical evaluations.The work is organized as follows, in Section2 a brief revision of the graph theory and the properties of the Laplacian matrix is presented, Section 3 presents the statement of the problem, and then the predictor-observer scheme that allows estimating the future state of the system is developed in Section 4. The consensus algorithm is given in Section 5 and the results of the numerical evaluations can be found in Section 6. The work ends with some conclusions in Section 7.


## 2. Graph Theory and Laplacian Matrix

Graph theory is the mathematical tool used to model the information exchange among agents [39]. This section presents some basic concepts of graph theory and properties of the Laplacian matrix that are of the interest of this work.LetG=N,E be an ordered graph where N is the nonempty node set, N=1,…,n, and E⊂N×N is the edge set. An edge in G is given by eij=(i,j).Adirected graph is a pair (N,E) where the edge eij∈E indicates that agent j can obtain information from agent i, but not necessarily in the other way. The edge (i,j) has a node i that is called theparent node and a node j calledchild node. Adirected path is an edge sequence in a directed graph of the form (i1,i2),(i2,i3),…. Adirected tree is a directed path with every node having exactly one parent, except for a node calledroot node that has no parent node and has directed paths to every other node. Asubgraph(Vs,Es) of (V,E) is such that Vs⊂V and Es⊂E∩(Vs×Vs). Adirected spanning tree(Vs,Es) of the directed graph (V,E) is a subgraph with a directed path where Vs=V.Theadjacency matrixA=[aij]∈Rn×n of a directed graph with the set node N=1,…,n is such that the weight aij is positive if (i,j)∈E and aij=0 if (i,j)∉E. When weights are not relevant, aij=1 if (i,j)∈E.


### 2.1. Laplacian Matrix

The Laplacian matrixL=[lij]∈Rn×n of a directed graph is given by lii=∑j=1,j≠inaij and lij=-aij for every i≠j. Some remarkable properties of this matrix are considered.(i)
lij≤0, i≠j.(ii)
The sum of the elements of every row equals zero.∑j=1nlij=0,i=1,…,n.(iii)
For directed and undirected graphs,λL,1=0 is an eigenvalue of L due to the fact that the sum of all the elements of a row equals zero. There also exists an eigenvector 1n=[1,…,1]T, with n×1 dimensions corresponding to the zero eigenvalue.(iv)
All of the eigenvaluesλL,i of L, different from zero, are positive (for directed graphs) or have positive real parts (for undirected graphs). Therefore, the real part of every eigenvalue of -L is negative.


## 2.1. Laplacian Matrix

The Laplacian matrixL=[lij]∈Rn×n of a directed graph is given by lii=∑j=1,j≠inaij and lij=-aij for every i≠j. Some remarkable properties of this matrix are considered.(i)
lij≤0, i≠j.(ii)
The sum of the elements of every row equals zero.∑j=1nlij=0,i=1,…,n.(iii)
For directed and undirected graphs,λL,1=0 is an eigenvalue of L due to the fact that the sum of all the elements of a row equals zero. There also exists an eigenvector 1n=[1,…,1]T, with n×1 dimensions corresponding to the zero eigenvalue.(iv)
All of the eigenvaluesλL,i of L, different from zero, are positive (for directed graphs) or have positive real parts (for undirected graphs). Therefore, the real part of every eigenvalue of -L is negative.


## 3. Problem Statement

This work deals with the consensus problem for a set of agents with input time-delay. The dynamics of the agents is modeled as linear time-invariant systems with input time-delay and fixed communication topology. The graph that models the communication is considered to be either directed with a spanning tree or undirected and connected, which implies that one of the eigenvalues of the Laplacian matrix equals zero [40].Each agent is considered to be ap-dimensional Multiple-Input-Multiple-Output (MIMO) linear system with the same input time-delay and dynamics given by(1)x˙it=Aixit+Biuit-τiyit=Cixit,for i=1,2,…,n, where xi=[xi1,…,xip]T∈Rp represents the state of the i-th agent, ui∈Rq is the input control, τi>0 is a known constant input time-delay, yi∈Rr is the output signal, and Ai∈Rp×p, Bi∈Rp×q, and Ci∈Rr×p. It is important to note that every parameter is associated with the i-th agent.Consensus Problem.A system of n agents is said to achieve consensus if for any initial condition xi(0); xi(t)→xj(t) as t→∞, for all i,j=1,…,n [1].To solve the consensus problem for multiagent systems a protocol is presented in [7], for agents without communication delay with dynamics given by(2)x˙it=Aixit+BiuitThe consensus protocol is given by(3)uit=K1xit+K2Σj=1naijxjt-xitfor i,j=1,…,n, where aij are the elements of the adjacent matrix and K1 and K2 are constant gain matrices. The authors present necessary and sufficient conditions for consensus and consensualization.


## 4. Predictor-Observer Scheme

To compensate the time-delay present in the dynamics of the agents, a predictor-observer scheme is proposed. The objective is to estimate the future state of the agentsτi units of time ahead, to later design a consensus scheme based on the predicted state. It is important to note that the use of predicted future states on time-delayed systems avoids the numerical implementation problems present in solutions with infinite spectrum; even more, the partitioned nature of the scheme proposed by this work allows compensating large time-delays. The design of the prediction–observer scheme is done under the following assumptions.Assumption 1.
Signalsy(t) and u(t) are available for measurement.Assumption 2.
For system (1), the pair (Ai,Bi) is controllable and (Ai,Ci) is observable.Assumption 3.
Consider that for the time delayτi in (2) there exists an integer mi>0 such that τ¯i=τi/mi.Remark 4.
Notice that Assumption3 is just a technical requirement in order to avoid the consideration of irrational values for the time–delay τi that could yield an approximate prediction.For thei-th agent, a set of advanced variables can be defined as(4)wi1t=xit+τ¯iwi2t=wi1t+τ¯i=xit+2τ¯i⋮wimt=wim-1t+τ¯i=xit+mτ¯i=xit+τi, where wif=[wi1f,wi2f,…,wipf]T for f=1,…,m refers to the p-dimensional vector state. Taking the time derivative of (4), it is obtained that(5)w˙if=Aiwif+Biut-m-fτ¯i,for f=1,…,m. In particular, for f=m,(6)w˙im=Aiwim+Biutand a free-delay dynamic is obtained.Notice that system (6) represents the evolution of system (1) forecasted τi units of time without input-delay.For system (6), the following predictor-observer is proposed:(7)w^˙if=Aiw^if+Biuit-m-fτ¯i+LiCiewift-τ¯ifor f=1,…,m where Li∈Rp×r is a gain matrix and the error signal(8)ewift=ewi1ft,…,ewipftT takes the form(9)ewi1t=xit+τ¯i-w^i1t;ewift=w^if-1t+τ¯i-w^ift;forf=2,3,…,m.The error dynamics (9) is given by(10)e˙wi1t=x˙it+τ¯i-w^˙i1t;e˙wift=w^˙if-1t+τ¯i-w^˙ift;forf=2,3,…,m,resulting in(11)e˙wi1t=Aiewi1t-LiCiewi1t-τ¯i;e˙wift=Aiewift+LiCiewif-1t-LiCiewift-τ¯i;with f=2,3,…,m. The vectorial form of (11) is the time-delay error system given by(12)e˙wit=A0∗ewit+A1∗ewit-τ¯i,with ewi=[ewi1,…,ewim]T for i=1,…,n and(13)A0∗=Ai0⋯00LiCiAi⋯00⋮⋮⋱⋮⋮00⋯LiCiAi,A1∗=-LiCi⋯0⋮⋱⋮0⋯-LiCi, where 0∈Rp×p is a matrix with all inputs equal to zero.


### 4.1. Related Predictor Scheme

The predictor given by (7) is equivalent to the sequential subpredictors strategy proposed by [31] that is recalled in the following.Consider system (1) and assume that all the state x(t) is available for measurement; this is Ci=I;(14)x˙t=Axt+But-τ,and there exists m∈Z+ such that(15)τ¯=τm,which allows proposing the sequence of subpredictors given by(16)x¯˙1t=Ax¯1t+L1x¯1t-τ¯-x¯2t+But⋮x¯˙it=Ax¯it+Lix¯it-τ¯-x¯i+1t+But-i-1τ¯⋮x¯˙mt=Ax¯mt+Lmx¯mt-τ¯-x¯m+1t+But-m-1τ¯, with x¯i∈Rn, i=1,…m. The prediction errors for each subpredictor are defined as(17)eit=x¯it-m-i-1τ¯-x¯i+1t-m-1τ¯emt=x¯mt-τ¯-xt, for i=1,…m-1 and the error dynamics given by(18)e˙it=Aeit+Lieit-τ¯-Li+1ei+1t-τ¯e˙mt=Aemt+Lmemt-τ¯, for i=1,…,m-1. Asymptotic convergence for the error dynamics is guaranteed by means of an LMI method that considers the closed-loop system that allows calculating the subpredictors and controlling gain matrices.The main difference between both schemes is that authors in [31] consider systems where it is possible to read the whole state and the predictor-observer (7) presented here includes the cases when only a partial measurement is available. The relation between both schemes can be found considering the following coordinate change:(19)w^1t=x¯mt⋮w^mt=x¯1t,and for the error signals(20)ewit=-em+1-it+m+1-iτ¯,for i=1,…m, to subpredictors (16) and prediction errors (17) and assuming C=I in system (1) results in the chain of predictors (7) and error signals (12).Remark 5.
It is important to note that the predictor (16) cannot be used to estimate the future state of system (1) when Ci≠I.


### 4.2. Convergence Analysis of the Predictor-Observer

The convergence to zero of the injection errors (9) is assured by showing the stability of the error dynamics (12).Lemma 6.
Let the predictor-observer (7) satisfy Assumptions 1, 2, and 3. Suppose that there exist positive gain matrices Li for i=1,2,…,n such that the matrix (Ai-LiCi) is Hurwitz; then there exists a sufficiently large mi such that the error signals (9) exponentially converge to zero.Proof.
The characteristic equation of (12) is given by(21)ps=detsImp-A0∗-A1∗e-sτ¯i=0.
It is possible to show that (21) can be rewritten as(22)ps=∏f=1mIns-Ai+LiCie-sτi=0.
It is clear that every factor of (22) represents the Laplace transform of a system of the form(23)e˙wi,ft=Aiewi,ft-LiCiewi,ft-τ¯i.
Since the parameters ofLi are free, from the observability assumption of the pair (AiCi), it is always possible to locate the eigenvalues of the matrix Ai-LiCi in the left half complex plane. The Hurwitz property of matrix Ai-LiCi assures the stability of the differential difference equation (23) for a sufficiently small time delay τ¯i [41]. The maximum time delay τi∗ for which system (23) will be asymptotically stable depends on the choice of the observer gain Li and its computation is not an easy task since its complexity rises as the dimension of the system increases. Thus, given a gain Li, such that Ai-LiCi is a Hurwitz matrix, it is always possible to asymptotically stabilize the prediction error (23) for a constant time delay τi<τi∗. This fact can be verified, for instance, by considering [42] or by reviewing the pole assignment procedure given in [41]. Based on the above arguments, it will be assumed, without loss of generality, that there exist Li and τi∗ such that system (23) is asymptotically stable for 0≤τi<τi∗. It should also be noticed that the stability of (23) is not only asymptotic but also exponential [43]. Furthermore, if matrix Li is chosen according to the rule given in Theorem 3.1 in [34], this is(24)L=eA¯oτ∗,with(25)A¯o=A-L¯C, where L¯ is such that all the real parts of the eigenvalues of A¯o are smaller than some negative real constant α; it is possible to guarantee the exponential convergence of the prediction errors ewif(t) to zero, which results in the convergence of the estimated future state w^im(t) to the real future value x(t+τi).Remark 7.
It should be pointed out that a predictor of the form (23) with m=1 designed for a system with time delay at the output was considered in [25]; also, for the case m=1, in [44] a predictor for a nonlinear input delay system is designed. As mentioned before, the partitioned predictor presented in [31] is similar to the one presented in this section, considering C=I.Remark 8.
Notice that in the case ofτ¯i=0, the error dynamics (23) takes the form(26)e˙wi,ft=Ai-LiCiewi,ft where the stability is determined by the eigenvalues of the matrix Ai-LiCi that, by the observability assumption, can always be stabilizable.Remark 9.
It should be noticed thatτi is given by τi=mτ¯i; therefore the larger number of subdelays considered by scheme (7) is, the larger delay τi can be compensated, with the drawback of an increasing dimension of the proposed predictor-observer.The following result allows obtaining the estimated valuesx^i(t+fτ¯i) from the future real values xi(t+fτ¯i) in (4).Lemma 10.
Suppose for system (1) that Assumptions 1, 2, and 3 are satisfied. For every τi>0, there always exists a predictor-observer (7) such that the estimated states w^if(t) exponentially converge to the future values xi(t+fτ¯i) for f=1,…,m.Proof.
From the definition of error (9) it is possible to show that(27)w^ift=xt+fτ¯i-∑k=1fewikt+f-kτ¯ifor k=1,…,f. Then, by Lemma 6, it is possible to conclude that the estimated states w^if(t) exponentially converge to the corresponding real values.Remark 11.
Note that ifm→∞, then τ¯i→0, relaxing the convergence conditions of the estimation error. This implies that it is always possible to stabilize system (12) choosing the integer m large enough.


## 4.1. Related Predictor Scheme

The predictor given by (7) is equivalent to the sequential subpredictors strategy proposed by [31] that is recalled in the following.Consider system (1) and assume that all the state x(t) is available for measurement; this is Ci=I;(14)x˙t=Axt+But-τ,and there exists m∈Z+ such that(15)τ¯=τm,which allows proposing the sequence of subpredictors given by(16)x¯˙1t=Ax¯1t+L1x¯1t-τ¯-x¯2t+But⋮x¯˙it=Ax¯it+Lix¯it-τ¯-x¯i+1t+But-i-1τ¯⋮x¯˙mt=Ax¯mt+Lmx¯mt-τ¯-x¯m+1t+But-m-1τ¯, with x¯i∈Rn, i=1,…m. The prediction errors for each subpredictor are defined as(17)eit=x¯it-m-i-1τ¯-x¯i+1t-m-1τ¯emt=x¯mt-τ¯-xt, for i=1,…m-1 and the error dynamics given by(18)e˙it=Aeit+Lieit-τ¯-Li+1ei+1t-τ¯e˙mt=Aemt+Lmemt-τ¯, for i=1,…,m-1. Asymptotic convergence for the error dynamics is guaranteed by means of an LMI method that considers the closed-loop system that allows calculating the subpredictors and controlling gain matrices.The main difference between both schemes is that authors in [31] consider systems where it is possible to read the whole state and the predictor-observer (7) presented here includes the cases when only a partial measurement is available. The relation between both schemes can be found considering the following coordinate change:(19)w^1t=x¯mt⋮w^mt=x¯1t,and for the error signals(20)ewit=-em+1-it+m+1-iτ¯,for i=1,…m, to subpredictors (16) and prediction errors (17) and assuming C=I in system (1) results in the chain of predictors (7) and error signals (12).Remark 5.
It is important to note that the predictor (16) cannot be used to estimate the future state of system (1) when Ci≠I.


## 4.2. Convergence Analysis of the Predictor-Observer

The convergence to zero of the injection errors (9) is assured by showing the stability of the error dynamics (12).Lemma 6.
Let the predictor-observer (7) satisfy Assumptions 1, 2, and 3. Suppose that there exist positive gain matrices Li for i=1,2,…,n such that the matrix (Ai-LiCi) is Hurwitz; then there exists a sufficiently large mi such that the error signals (9) exponentially converge to zero.Proof.
The characteristic equation of (12) is given by(21)ps=detsImp-A0∗-A1∗e-sτ¯i=0.
It is possible to show that (21) can be rewritten as(22)ps=∏f=1mIns-Ai+LiCie-sτi=0.
It is clear that every factor of (22) represents the Laplace transform of a system of the form(23)e˙wi,ft=Aiewi,ft-LiCiewi,ft-τ¯i.
Since the parameters ofLi are free, from the observability assumption of the pair (AiCi), it is always possible to locate the eigenvalues of the matrix Ai-LiCi in the left half complex plane. The Hurwitz property of matrix Ai-LiCi assures the stability of the differential difference equation (23) for a sufficiently small time delay τ¯i [41]. The maximum time delay τi∗ for which system (23) will be asymptotically stable depends on the choice of the observer gain Li and its computation is not an easy task since its complexity rises as the dimension of the system increases. Thus, given a gain Li, such that Ai-LiCi is a Hurwitz matrix, it is always possible to asymptotically stabilize the prediction error (23) for a constant time delay τi<τi∗. This fact can be verified, for instance, by considering [42] or by reviewing the pole assignment procedure given in [41]. Based on the above arguments, it will be assumed, without loss of generality, that there exist Li and τi∗ such that system (23) is asymptotically stable for 0≤τi<τi∗. It should also be noticed that the stability of (23) is not only asymptotic but also exponential [43]. Furthermore, if matrix Li is chosen according to the rule given in Theorem 3.1 in [34], this is(24)L=eA¯oτ∗,with(25)A¯o=A-L¯C, where L¯ is such that all the real parts of the eigenvalues of A¯o are smaller than some negative real constant α; it is possible to guarantee the exponential convergence of the prediction errors ewif(t) to zero, which results in the convergence of the estimated future state w^im(t) to the real future value x(t+τi).Remark 7.
It should be pointed out that a predictor of the form (23) with m=1 designed for a system with time delay at the output was considered in [25]; also, for the case m=1, in [44] a predictor for a nonlinear input delay system is designed. As mentioned before, the partitioned predictor presented in [31] is similar to the one presented in this section, considering C=I.Remark 8.
Notice that in the case ofτ¯i=0, the error dynamics (23) takes the form(26)e˙wi,ft=Ai-LiCiewi,ft where the stability is determined by the eigenvalues of the matrix Ai-LiCi that, by the observability assumption, can always be stabilizable.Remark 9.
It should be noticed thatτi is given by τi=mτ¯i; therefore the larger number of subdelays considered by scheme (7) is, the larger delay τi can be compensated, with the drawback of an increasing dimension of the proposed predictor-observer.The following result allows obtaining the estimated valuesx^i(t+fτ¯i) from the future real values xi(t+fτ¯i) in (4).Lemma 10.
Suppose for system (1) that Assumptions 1, 2, and 3 are satisfied. For every τi>0, there always exists a predictor-observer (7) such that the estimated states w^if(t) exponentially converge to the future values xi(t+fτ¯i) for f=1,…,m.Proof.
From the definition of error (9) it is possible to show that(27)w^ift=xt+fτ¯i-∑k=1fewikt+f-kτ¯ifor k=1,…,f. Then, by Lemma 6, it is possible to conclude that the estimated states w^if(t) exponentially converge to the corresponding real values.Remark 11.
Note that ifm→∞, then τ¯i→0, relaxing the convergence conditions of the estimation error. This implies that it is always possible to stabilize system (12) choosing the integer m large enough.


## 5. Consensus Problem

In this section, the consensus protocol for LTI systems in time-delay is presented. The set of agents has a fixed communication topology that contains a directed spanning tree. The dynamics of each agent is given by (1). This protocol considers the solution presented in [7] that is adapted to be used with the future state values estimated in the previous section. By using the predicted states instead of the current one, it is possible to deal with systems with large time-delays.Consider a set ofn agents of the form (1), where for the sake of easy of presentation it is assumed that τi=τ for i=1,…,n; that is,(28)x˙it=Axit+Buit-τ.The vectorial form of the complete set of agents is given by(29)x˙t=In⊗Axt+In⊗But-τwhere x=[x1,x2,…,xn]T, u=[u1,u2,…,un]T, and In∈Rn×n.The following control scheme based on the predictor-observer (7) is proposed:(30)uit=K1w^i,mt+K2∑j=1nlijw^j,mt-w^i,mtfori,j=1,2,…,n, K1,K2∈Rq×p, where lij are the entries of the Laplacian matrix of the graph. The control scheme (30) can be rewritten as(31)ut=In⊗K1-L⊗K2w^mtwhereL∈Rn×n is the Laplacian of the system and w^m=[w^1m,…,w^nm]T is the predicted state.The closed-loop system (29)–(31) is given by(32)x˙t=In⊗Axt+In⊗BIn⊗K1-L⊗K2w^mt-τ.Considering that(A⊗B)(C⊗D)=AC⊗BD, it is obtained that(33)x˙t=In⊗Axt+In⊗BK1-L⊗BK2w^mt-τ.Recalling the observation errors,(34)ew1t=xt+τ¯-w^1t;ewft=w^f-1t+τ¯-w^˙ft;forf=2,3,…,m,the estimated state w^m(t-τ) can be rewritten as a function of the real state and the observation errors,(35)w^mt-τ=xt-∑f=1mewft-fτ¯,where ewf=[ew1f,…,ewnf]T, producing(36)x˙t=Hxt+L⊗BK2-In⊗BK1∑f=1mewft-fτ¯where H=In⊗(A+BK1)-L⊗BK2.Consider now a nonsingular matrixU∈Rn×n, such that(37)U-1LU=JL for JL∈Rn×n representing the Jordan canonical form of the Laplacian matrix L.Considering now the globally invertible change of variable,(38)x¯=U-1⊗Iqx,x=U⊗Iqx¯for x¯=[x¯1,x¯2,…,x¯n]T; then it is possible to show that(39)U⊗Iqx¯˙t=In⊗A+BK1U⊗Iqx¯t-L⊗BK2U⊗Iqx¯t+L⊗BK2-In⊗BK1∑f=1mewft-fτ¯from where(40)x¯˙t=In⊗A+BK1-JL⊗BK2x¯t+U-1L⊗BK2-U-1⊗BK1∑f=1mewft-fτ¯.Equation (40) can be rewritten as(41)x¯˙t=Γx¯t+Δ∑f=1mewft-fτ¯where(42)Δ=U-1L⊗BK2-U-1⊗BK1(43)Γ=A+BK100⋯00γ2δBK2⋯0⋮⋮⋱⋱⋮00⋯γn-1δBK200⋯0γn,with γi=A+BK1-λL,iBK2 for i=2,…,n and δ=0 or δ=1, depending on the structure of JL.Remark 12.
Notice that sinceH and Γ are similar matrices, they have the same eigenvalues. Furthermore, in (43) it can be seen that those eigenvalues correspond to the ones of A+BK1 and A+BK1-λiBK2, for i=2,3,…,n.


### 5.1. Consensus Analysis

Lemma 13.
Consider a set ofn agents of the form (28) with a communication topology with a directed spanning tree. Under these circumstances, solution to the consensus problem is achieved if and only if the matrices A+BK1-λL,iBK2, for i=2,3,…,n, are Hurwitz.Proof.
Let the invertible matrixP=p1,p2,…,pnp∈Cnp×np be such that(44)P-1HP=JH, with JH being the Jordan canonical form of H, defined in (36). Considering the change of coordinates,(45)x^=P-1x,x=Px^ (36) yields(46)x^˙=P-1HPx^+P-1L⊗BK2-In⊗BK1∑f=1mewft-fτ¯. That is(47)x^˙=JHx^+P-1L⊗BK2-In⊗BK1∑f=1mewft-fτ¯.
The solution to system (47) is given by(48)x^t=eJHtx^0+∑f=1m∫0teJHt-θP-1L⊗BK2-In⊗BK1×ewfθ-fτ¯dθ.
Sincex^=P-1x, it is possible to write(49)xt=PeJHtP-1x0+P∑f=1m∫0teJHt-θP-1L⊗BK2-In⊗BK1×ewfθ-fτ¯dθ.
LetH∈Rnp×np with eigenvectors pg∈C(g=1,2,…,np). Note, from Remark 12, that pg(g=1,2,…,n) correspond to the eigenvalues of A+BK1, while eigenvectors pg(g=n+1,n+2,…,np) correspond to the eigenvalues of A+BK1-λL,iBK2,i=2,3,…,n. Then, two consensus subspaces can be established, subspace C(H) spanned by pg(g=1,2,…,n) and a complementary consensus subspace C¯(H) spanned by pg(g=n+1,n+2,…,np). Therefore, the consensus space Cnp is given by(50)Cnp=C⊕C¯.
Since the eigenvalues ofH correspond to the eigenvalues of A+BK1 and A+BK1-λL,iBK2,i=2,3,…,n, matrix eJHt can be written as(51)eJHt=eJCt00eJC¯t defining(52)x0=xC0+xC¯0 Equation (49) can now be rewritten as(53)xt=PeJCt00eJC¯tP-1x0+P∑f=1m∫0teJHt-θP-1L⊗BK2-In⊗BK1×ewfθ-fτ¯dθ.
Considering that the solution of the closed-loop system (53) can be expressed as(54)xt=xCt+xC¯t+P∑f=1m∫0teJHt-θP-1L⊗BK2-In⊗BK1×ewfθ-fτ¯dθand noting that the limit when t→∞ of the third term in (54) is a constant value, thus(55)limt→∞ewft=0.
The system consensus state can be established by means of the analysis ofxC(t) and xC¯(t). From (53) and (54), xC(t) is given by(56)xCt=PeJCt00eJC¯tP-1xC0.
Describing the initial state as(57)x0=xC0+xC¯0=∑g=1pαg0pg+∑g=p+1npαg0pg=Pα10,…,αp0,0,…,0T+P0,…,0,αp+10,…,αnp0Tthus(58)xC0=Pα10,…,αp0,0,…,0TxC¯0=P0,…,0,αp+10,…,αnp0T where αg(0),g=1,2,…,np are real constants. From (58), xC(t) yields(59)xCt=PeJCt00eJC¯tα10,…,αp0,0,…,0T. That is(60)xCt=PeJCtα10,…,αp0T0.
SinceJC is the Jordan block of H corresponding to the eigenvalues of A+BK1 and considering that the pair (A,B) is controllable, it can be concluded that the pair (A+BK1,B) is also controllable and therefore the right choice of matrix K1 guarantees that xC(t) achieves consensus. Now, xc¯(t) is given by(61)xC¯t=PeJCt00eJC¯t0,…,0,αp+10,…,αnp0T that yields(62)xC¯t=P0eJC¯tαp+10,…,αnp0T.
And sinceJC¯ is the Jordan block of H corresponding to the eigenvalues of A+BK1-λL,iBK2, for i=2,3,…,n, then it can be concluded that for system (28) to achieve consensus matrices A+BK1-λL,iBK2,i=2,3,…,n, must be Hurwitz, which implies(63)limt→∞xC¯t=0.
Considering (60) and (63), the system consensus value is given by(64)limt→∞xt=limt→∞PeJCtα10,…,αp0T0+P∑f=1m∫0teJHt-θP-1×L⊗BK2-In⊗BK1ewfθ-fτ¯dθ.
Since it has been shown thatlimt→∞ewf(t)=0,(65)limt→∞P∑f=1m∫0teJHt-θP-1L⊗BK2-In⊗BK1×ewfθ-fτ¯dθ=E,with a real constant vector E; then,(66)limt→∞xt=limt→∞PeJCtα10,…,αp0T0+E.
Finally, defining(67)β1t,…,βptT=eJCtα10,…,αp0T, and considering that Lemma 4 from [7] proves that the first p eigenvectors of H are given by pg=1n⊗cj for g=1,…,p where cg are the eigenvectors of A+BK1 and 1n∈Rn is the vector with all of its entries equal to one, the consensus value (66) yields(68)limt→∞xt=limt→∞1n⊗c1,…,cpβ1t,…,βptT+E.Remark 14.
It should be noted that the previous proof is based on the corresponding proof presented in [7] with the difference that the proof presented in this work includes the predicted state used in the consensus protocol which results in a consensus value affected by the initial injection errors, represented by E in (68).Remark 15.
Notice that the prediction-observation scheme proposed here can compensate the time-delay of the agents when it is placed either at the input or at the output. In the case of agents with input time-delay, each agent will estimate its own future state and send it to its neighbors which will use them to calculate its own control, thus compensating their input time-delay. In the case where the agents present an output time-delay, once again, each agent would estimate its current state from its delayed output and send the undelayed estimated state to the other agents. In both cases, the consensus will be achieved by means of a decentralized algorithm.


## 5.1. Consensus Analysis

Lemma 13.
Consider a set ofn agents of the form (28) with a communication topology with a directed spanning tree. Under these circumstances, solution to the consensus problem is achieved if and only if the matrices A+BK1-λL,iBK2, for i=2,3,…,n, are Hurwitz.Proof.
Let the invertible matrixP=p1,p2,…,pnp∈Cnp×np be such that(44)P-1HP=JH, with JH being the Jordan canonical form of H, defined in (36). Considering the change of coordinates,(45)x^=P-1x,x=Px^ (36) yields(46)x^˙=P-1HPx^+P-1L⊗BK2-In⊗BK1∑f=1mewft-fτ¯. That is(47)x^˙=JHx^+P-1L⊗BK2-In⊗BK1∑f=1mewft-fτ¯.
The solution to system (47) is given by(48)x^t=eJHtx^0+∑f=1m∫0teJHt-θP-1L⊗BK2-In⊗BK1×ewfθ-fτ¯dθ.
Sincex^=P-1x, it is possible to write(49)xt=PeJHtP-1x0+P∑f=1m∫0teJHt-θP-1L⊗BK2-In⊗BK1×ewfθ-fτ¯dθ.
LetH∈Rnp×np with eigenvectors pg∈C(g=1,2,…,np). Note, from Remark 12, that pg(g=1,2,…,n) correspond to the eigenvalues of A+BK1, while eigenvectors pg(g=n+1,n+2,…,np) correspond to the eigenvalues of A+BK1-λL,iBK2,i=2,3,…,n. Then, two consensus subspaces can be established, subspace C(H) spanned by pg(g=1,2,…,n) and a complementary consensus subspace C¯(H) spanned by pg(g=n+1,n+2,…,np). Therefore, the consensus space Cnp is given by(50)Cnp=C⊕C¯.
Since the eigenvalues ofH correspond to the eigenvalues of A+BK1 and A+BK1-λL,iBK2,i=2,3,…,n, matrix eJHt can be written as(51)eJHt=eJCt00eJC¯t defining(52)x0=xC0+xC¯0 Equation (49) can now be rewritten as(53)xt=PeJCt00eJC¯tP-1x0+P∑f=1m∫0teJHt-θP-1L⊗BK2-In⊗BK1×ewfθ-fτ¯dθ.
Considering that the solution of the closed-loop system (53) can be expressed as(54)xt=xCt+xC¯t+P∑f=1m∫0teJHt-θP-1L⊗BK2-In⊗BK1×ewfθ-fτ¯dθand noting that the limit when t→∞ of the third term in (54) is a constant value, thus(55)limt→∞ewft=0.
The system consensus state can be established by means of the analysis ofxC(t) and xC¯(t). From (53) and (54), xC(t) is given by(56)xCt=PeJCt00eJC¯tP-1xC0.
Describing the initial state as(57)x0=xC0+xC¯0=∑g=1pαg0pg+∑g=p+1npαg0pg=Pα10,…,αp0,0,…,0T+P0,…,0,αp+10,…,αnp0Tthus(58)xC0=Pα10,…,αp0,0,…,0TxC¯0=P0,…,0,αp+10,…,αnp0T where αg(0),g=1,2,…,np are real constants. From (58), xC(t) yields(59)xCt=PeJCt00eJC¯tα10,…,αp0,0,…,0T. That is(60)xCt=PeJCtα10,…,αp0T0.
SinceJC is the Jordan block of H corresponding to the eigenvalues of A+BK1 and considering that the pair (A,B) is controllable, it can be concluded that the pair (A+BK1,B) is also controllable and therefore the right choice of matrix K1 guarantees that xC(t) achieves consensus. Now, xc¯(t) is given by(61)xC¯t=PeJCt00eJC¯t0,…,0,αp+10,…,αnp0T that yields(62)xC¯t=P0eJC¯tαp+10,…,αnp0T.
And sinceJC¯ is the Jordan block of H corresponding to the eigenvalues of A+BK1-λL,iBK2, for i=2,3,…,n, then it can be concluded that for system (28) to achieve consensus matrices A+BK1-λL,iBK2,i=2,3,…,n, must be Hurwitz, which implies(63)limt→∞xC¯t=0.
Considering (60) and (63), the system consensus value is given by(64)limt→∞xt=limt→∞PeJCtα10,…,αp0T0+P∑f=1m∫0teJHt-θP-1×L⊗BK2-In⊗BK1ewfθ-fτ¯dθ.
Since it has been shown thatlimt→∞ewf(t)=0,(65)limt→∞P∑f=1m∫0teJHt-θP-1L⊗BK2-In⊗BK1×ewfθ-fτ¯dθ=E,with a real constant vector E; then,(66)limt→∞xt=limt→∞PeJCtα10,…,αp0T0+E.
Finally, defining(67)β1t,…,βptT=eJCtα10,…,αp0T, and considering that Lemma 4 from [7] proves that the first p eigenvectors of H are given by pg=1n⊗cj for g=1,…,p where cg are the eigenvectors of A+BK1 and 1n∈Rn is the vector with all of its entries equal to one, the consensus value (66) yields(68)limt→∞xt=limt→∞1n⊗c1,…,cpβ1t,…,βptT+E.Remark 14.
It should be noted that the previous proof is based on the corresponding proof presented in [7] with the difference that the proof presented in this work includes the predicted state used in the consensus protocol which results in a consensus value affected by the initial injection errors, represented by E in (68).Remark 15.
Notice that the prediction-observation scheme proposed here can compensate the time-delay of the agents when it is placed either at the input or at the output. In the case of agents with input time-delay, each agent will estimate its own future state and send it to its neighbors which will use them to calculate its own control, thus compensating their input time-delay. In the case where the agents present an output time-delay, once again, each agent would estimate its current state from its delayed output and send the undelayed estimated state to the other agents. In both cases, the consensus will be achieved by means of a decentralized algorithm.


## 6. Numerical Evaluations

Numerical evaluations of the proposed solution carried out consider two cases, the Multiagent Supporting System (MASS) composed by six agents presented in [7] and a multiagent system formed by six agents with unstable dynamics whose stabilization is achieved in [31]. For simplicity, in both cases the communication topology is used, depicted in Figure 1, with the corresponding Laplacian matrix given by(69)L=10000-1-1100000-12-1000001-10000-110-1000-12.Figure 1
Communication topology.Example 1.
In the case of the MASS system, the dynamics of each agent is given by(70)x˙it=01-kmi-Dmixit+01ut-τi,where xi(t)=[zi(t),z˙i(t)]T, zi(t) is the height of each agent, mi is the mass, D is the damping at each agent, k is the stiffness, and ui(t) is the control input. The implementation of the predictor considers a partition of m=4 and the system parameters mi=10.6, k=120, and D=50.5. The initial conditions are set as(71)x0=-3,-1.5,-2,-2,0,1,4,-1,2,3,6,2T.
The gain matrix for the predictor-observer is given byŁi=[1,0;4,0]T and the consensus gain vectors K1=[11.3208,-0.2358] and K2=[8.8687,1]. The delay considered is τ=1.2s; the results are given in Figures 2, 3, 4, and 5 that represent the evolution in time of the state, observation errors, and control signal, respectively. The evolution of the logarithm of the homogeneous norm of the prediction error is depicted in Figure 6 to show its exponential convergence. It can be seen that with the partition of the predictor-observer large delays can be compensated.Figure 2
Time evolution of the state, MASS system.τ=1.2s.Figure 3
Time evolution of the state, MASS system.τ=1.2s.Figure 4
Time evolution of the estimation errors, MASS system.τ=1.2s.Figure 5
Time evolution of the control signal, MASS system.τ=1.2s.Figure 6
Time evolution of the logarithm of the prediction error, MASS system.τ=1.2s.Example 2.
In a more challenging situation, an unstable system presented in [31] is taken into account to form a multiagent system with n=6 and the communication topology presented in Figure 1. The dynamics of each agent is given by(72)x˙t=-5-634xt+04ut-τyt=-22xt.
The delay of the system isτ=1s, the partition of the observer is m=4, and the initial conditions are set as(73)x0=-3,0.2,-1,0.5,3,1,-1.5,0,4,-1.2,-2,0T.
The gain of each subpredictor is given byLi=[-0.82120.7263]T, and the control gains are K1=[-0.5417-0.75] and K2=[-40.3]. Figures 7 and 8 present the evolution in time of the state of the system and the prediction errors, respectively, where after a transient period the desired convergence is obtained; Figure 9 presents the evolution of the control signal. The logarithm of the norm of the prediction error is presented in Figure 10.Figure 7
Time evolution of the state, unstable agents.τ=1s.Figure 8
Time evolution of the estimation errors, unstable agents.τ=1s.Figure 9
Time evolution of the control signal, unstable agents.τ=1s.Figure 10
Time evolution of the logarithm of the prediction error, unstable agents.τ=1s.


## 7. Conclusions

This work deals with the consensus problem for multiagent systems with LTI dynamics and input time-delay. A modified partitioned predictor-observer is proposed to estimate the future state values of the agents. These predicted states are used in the consensus protocol in order to compensate the input time-delays. Formal proofs for the convergence of the predictor and consensus are given. The performed numerical evaluations show that a larger number of partitions in the predictor-observer results in an improvement of the response of the system and in a larger time-delay that can be compensated.



---

*Source: 1607474-2019-07-07.xml*