# Adaptive State Observer Design for Dynamic Links in Complex Dynamical Networks

Authors: Zilin Gao; Jiang Xiong; Jing Zhong; Fuming Liu; Qingshan Liu
Journal: Computational Intelligence and Neuroscience
 (2020)

---

## Abstract

The state observer for dynamic links in complex dynamical networks (CDNs) is investigated by using the adaptive method whether the networks are undirected or directed. In this paper, a complete network model is proposed, which is composed of two coupled subsystems called nodes subsystem and links subsystem, respectively. Especially, for the links subsystem, associated with some assumptions, the state observer with parameter adaptive law is designed. Compared to the existing results about the state observer design of CDNs, the advantage of this method is that a estimation problem of dynamic links is solved in directed networks for the first time. Finally, the results obtained in this paper are demonstrated by performing a numerical example.


---

## Body

## 1. Introduction

In recent past decades, the research on CDNs has become a hot topic in many fields [1–4]. From the perspective of large system, a complete CDN contains many nodes and links (weights of connections between nodes), which implies that a complete CDN is composed of the nodes subsystem and links subsystem, and the two subsystems are usually coupled with each other [5–7]. It is worth noting that the existing researches mainly focus on the nodes subsystem because some behaviors are reflected by nodes such as synchronization [8, 9], stabilization [10, 11], and consensus [12, 13].From the above results about the synchronization, stabilization, consensus, or other problems of CDNs, it is easy to see all states in CDNs, including the states of nodes and links, are required to be measured accurately. However, this assumption is too hard to be satisfied in practice because of the influence of external environment, measurement costs, and technical constraints [14]. Thus, constructing state observers for the CDNs to estimate the unknown states is very necessary and important. Fortunately, some scholars have discussed the state estimation problems of CDNs and obtained some research results, including cases with the coupling time delays [15, 16], packet loss [17, 18], stochastic noisy disturbance [19], and uncertain coupling strength [20].However, the above results only consider the estimation problems of the states in nodes subsystem, and assume that the links between nodes are known. It implies that the measurement and state estimation problems of links in the CDNs are ignored. In fact, due to the limitation of measurement methods, the state values of links in CDNs are more difficult to be measured accurately in practical situation, compared to the states of nodes. Hence, only a few papers have studied and discussed the effective measurement problem of the links between individuals (nodes), and the measurement method mainly depends on the physical interaction between individuals [21] or the adaptive weights of links [22]. Similar to the state values of nodes, not all state values of links’ weights can be measured and obtained. Therefore, it is necessary to design observers to estimate the unmeasured state values of links. As we know, there is only one paper to have discussed the state estimation problem of dynamic links in CDNs [23]. Unfortunately, the method proposed in [23] is only effective for undirected networks and cannot solve the estimation problem of dynamic links in directed networks.Inspired by the above discussions, this paper mainly focuses on the state observer design for dynamic links in directed networks. Specifically, a mathematical model for a class of directed CDNs is proposed, which is described by both the nodes subsystem and links subsystem with coupling between the two subsystems, and we have designed a state observer for the links subsystem by using the adaptive method. This means that a state estimation problem of dynamic links in directed networks is solved for the first time, which is also regarded as the biggest contribution of this paper.The rest of this paper is organized as follows: in Section2, a complete CDN model is proposed, which is composed of the nodes subsystem and links subsystem with outputs; Section 3 introduces the design process of state observer for the links subsystem; in Section 4, the simulation example is presented and used to demonstrate the effectiveness of this method; finally, the conclusions are given in Section 5.


### 1.1. Notations

Then-dimensional Euclidean space is denoted as Rn, the set of n×n real matrices is denoted as Rn×n, the Euclidean norm of a vector or a matrix is denoted as ⋅, and the transpose of matrix A and n-dimensional identity matrix is denoted as AT and In, respectively.


## 1.1. Notations

Then-dimensional Euclidean space is denoted as Rn, the set of n×n real matrices is denoted as Rn×n, the Euclidean norm of a vector or a matrix is denoted as ⋅, and the transpose of matrix A and n-dimensional identity matrix is denoted as AT and In, respectively.


## 2. Preliminaries and Model Description

If the states of nodes and links in CDNs evolve over time, then the mathematical model of CDNs, including directed and undirected networks, can be described by both the nodes subsystem and links subsystem, where the two subsystems are coupled with each other. In this paper, we only consider the case that each node isn-dimensional continuous system in CDNs with N nodes, then the nodes subsystem and links subsystem can be described by vector differential equations and matrix differential equation as follows, respectively:(1)x˙i=Aixi+Bifixi+ci∑j=1NpijtHjxj,i=1,2,…,N,(2)P˙=Θ1P+PΘ2T+Gx,Y1=ΥP,Y2=ΥPT,where xi=xi1,xi2,…,xinT∈Rn is the state vector of node i; the constant matrices Ai∈Rn×n and Bi∈Rn×m; the vector functions fixi=fi1xi,fi2xi,…,fimxiT and Hjxj=Hj1xj,Hj2xj,…,HjnxjT; ci>0 is a known constant, which denotes the common connection strength of node i in the network; the constant matrices Θ1∈RN×N and Θ2∈RN×N; the coupling matrix Gx∈RN×N, and x=x1T,x2T,…,xNTT∈Λ⊆RNn, where Λ is a bounded and closed set in RNn; the output matrix Υ∈RN1×N is given; and the links matrix P=Pt=pijtN×N, where the state variable pijt denotes the weight of link from node j to node i. Especially, pji=pij for undirected networks, and at least, one pair i,j such that pji≠pij for directed networks. In addition, if i=j, then pij denotes the link strength of node i itself.For the CDNs composed of subsystems (1) and (2), the following instructions are given:(1)
The background of dynamic links is given as follows. For example, the biological neural networks consist of neurons (nodes) and synapse (links), and Gamma oscillations in neurons may cause the synaptic facilitation, which is regarded as a dynamic behavior of the links [5, 6, 24]. Similarly, the web winding systems can be regarded to be composed of motors (nodes) and the web (links), and the regulation values of web tensions vary with the speed of the motors, which is also regarded as a dynamic behavior of links [25]. In the above examples, the state values of links need to be measured by some sensors.(2)
The existing research results show that the nodes in networks can emerge synchronization or stabilization phenomenon with the help of the links, which mean that the nodes are the main body of synchronization and stabilization [8–11]. In contrast, the links as another part of networks can also emerge some characteristic phenomena in many real networks, such as the structural balance in social networks [5, 6, 26]. It is worth noting that the paper [26] has researched on structural balance by using the Riccati matrix differential equation, and the reason is that this type of equation is more easily to emerge the phenomenon of structural balance. In view of this, we choose linear Riccati matrix differential equation to describe the links subsystem. Clearly, the model of CDNs, composed of both nodes subsystem (1) and links subsystem (2), can help us to understand and explain the dynamic behaviors of networks in a better way.(3)
The subsystem (2) is used to describe dynamic change of links’ weights in the CDNs, and in general, the CDNs are directed. However, if Θ1=Θ2 and Gx=GxT, then we can obtain P=PT, while the initial value of the state in subsystem (2) satisfies P0=P0T. Hence, the subsystems (1) and (2) can be used to describe both undirected and directed networks (the undirected networks can be regarded as a special case of directed networks). To the best of my knowledge, there is only one paper to have solved the state estimation problem of links subsystem [23]. However, this method is only effective for undirected networks, but not for directed networks. This drives us to study estimation problems of dynamic links in directed networks.(4)
It is difficult to accurately measure all states of the links between individuals (nodes) in practical applications, which imply that only partial states in (2) can be measured accurately and made available (N1<N). It is worth noting that the precise measurement of the partial states is bidirectional; that is, if pijt is measurable, then pjit must also be measurable. That is why the two outputs Y1 and Y2 appear in (2).Now, some useful definitions and operators involved in this paper will be introduced as follows.Definition 1.
(see [27]). The application vec:Rk×l⟶Rkl is defined by(3)vecH=h11,…,h1l,h21,…,h2l,…,hk1,…,hklT,where the matrix H=hijk×l is called the vectorization operator.Definition 2.
(see [27]). If there are two matrices H∈Rk×l and Z∈Rc×d, then the Kronecker product of H and Z is denoted as H⊗Z∈Rkc×ld and defined as follows:(4)H⊗Z=h11Zh12Z⋯h1lZh21Zh22Z⋯h2lZ⋅⋅⋅⋅⋅⋅⋅⋅hk1Zhk2Z⋯hklZ.
By using Definitions1 and 2, the following basic properties about Kronecker product and operator vec⋅ can be obtained and shown as follows [27]:(1)
H⊗SX⊗W=HX⊗SW(2)
H⊗WT=HT⊗WT(3)
S⊗X−1=S−1⊗X−1(4)
vecHSW=H⊗WTvecS(5)
vecHS+SW=H⊗I+I⊗WTvecSS and X are the matrices with compatible dimensions, and I represents the identity matrix with compatible dimensions. Especially, it is assumed that both S and X are invertible in property (3).
According to Definitions1 and 2 and their corresponding properties, the Riccati differential equation (2) can be rewritten as(5)vecP˙=AvecP+vecGx,vecY1=C1vecP,vecY2=C1vecPT,where A=Θ1⊗IN+IN⊗Θ2 and C1=Υ⊗IN.Assumption 1.
For the links subsystem (2), the double matrices Θ1,Υ and Θ2,Υ are completely stable.
If Assumption1 is true, then we can obtain matrices K1∈RN×N1 and K2∈RN×N1, which can make Θ1+K1Υ and Θ2+K2Υ to be Hurwitz stable, respectively. Thus, as long as any matrices Q1>0 and Q2>0 are given, there must be positive definite matrices M1∈RN×N and M2∈RN×N that satisfy the following two Lyapunov equations, respectively:(6)Θ1+K1ΥTM1+M1Θ1+K1Υ=−Q1,(7)Θ2+K2ΥTM2+M2Θ2+K2Υ=−Q2.Lemma 1.
If Assumption1 is true, then the following Lyapunov equations(8)Θ1⊗IN+K˜1C1TM˜+M˜Θ1⊗IN+K˜1C1=−Q˜1,IN⊗Θ2+K˜2C2TM˜+M˜IN⊗Θ2+K˜2C2=−Q˜2,hold, where M˜=M1⊗M2, Q˜1=Q1⊗M2, Q˜2=M1⊗Q2, K˜1=K1⊗IN, K˜2=IN⊗K2, and C2=IN⊗Υ. Clearly, M˜>0, Q˜1>0, and Q˜2>0.
Proof. If Assumption1 holds, then the following equations can be obtain from (6) and (7):(9)Θ1+K1ΥTM1⊗IN+M1Θ1+K1Υ⊗IN=−Q1⊗IN,(10)IN⊗Θ2+K2ΥTM2+IN⊗M2Θ2+K2Υ=−IN⊗Q2.
Using the properties of Kronecker product, (9) and (10) can be rewritten as(11)Θ1⊗IN+K1⊗INΥ⊗INTM1⊗IN+M1⊗INΘ1⊗IN+K1⊗INΥ⊗IN=−Q1⊗IN,IN⊗Θ2+IN⊗K2IN⊗ΥTIN⊗M2+IN⊗M2IN⊗Θ2+IN⊗K2IN⊗Υ=−IN⊗Q2.
Thus, we can get(12)Θ1⊗IN+K˜1C1TM1⊗IN+M1⊗INΘ1⊗IN+K˜1C1=−Q1⊗IN,(13)IN⊗Θ2+K˜2C2TIN⊗M2+IN⊗M2IN⊗Θ2+K˜2C2=−IN⊗Q2.
If we multiply both sides of the equalities (12) and (13) by IN⊗M2 and M1⊗IN from right, respectively, then we get that(14)Θ1⊗IN+K˜1C1TM1⊗ININ⊗M2+M1⊗INΘ1⊗IN+K˜1C1IN⊗M2=−Q1⊗ININ⊗M2,(15)IN⊗Θ2+K˜2C2TIN⊗M2M1⊗IN+IN⊗M2IN⊗Θ2+K˜2C2M1⊗IN=−IN⊗Q2M1⊗IN.
It is noticed thatM1⊗ININ⊗M2=M1⊗M2=INM1⊗M2IN=IN⊗M2M1⊗IN. Therefore, the equalities (14) and (15) can be rewritten as follows:(16)Θ1⊗IN+K˜1C1TM1⊗M2+M1⊗M2Θ1⊗IN+K˜1C1=−Q1⊗M2,IN⊗Θ2+K˜2C2TM1⊗M2+M1⊗M2IN⊗Θ2+K˜2C2=−M1⊗Q2.
Thus, Lemma1 is completely proved.Assumption 2.
For subsystem (2), in which the coupling matrix Gx satisfies that Gx=M1−1ΥTΨxM2−1, where Ψx=ψijN1×Nandψij=xiTxj.
If Assumption2 holds, then we can get that Ψx=∑i=1N1∑j=1NxiTxj2≤∑i=1N1∑j=1Nxi⋅xj2 ≤ ∑i=1Nxi2∑j=1Nxj2=x2. Meanwhile, we note that Λ is a bounded and closed set in RNn, and x∈Λ. Thus, there exists a positive constant L to satisfy the inequality x2≤L.
General speaking,L is unknown. However, we can use the adaptive method to estimate it. In this paper, we use L^=L^t to denote the estimated value of L. Hence, the estimation error is denoted as L˜=L^−L.


## 3. Main Results

Definition 3.
Designing a matrix differential systemP^˙=FP^,Y1,Y2,L^, if the state P^ satisfies limt⟶+∞P−P^=0, then the matrix differential system P^˙=FP^,Y1,Y2,L^ can be regarded as a state observer of the links subsystem (2).
If Assumptions1 and 2 hold, the state observer of the links subsystem (2) can be designed and presented as follows:(17)P^˙=Θ1+K1ΥP^+P^Θ2+K2ΥT+ΓP^,Y1,Y2,L^−K1Y1−Y2TK2T,with the following adaptive law(18)L^˙=1ρvecY1−C1vecP^,where P^ denotes the estimated value of the state P in (2); the robust term ΓP^,Y1,Y2,L^=Ω,ΥP^≠Y10,ΥP^=Y1, where Ω=L^M1−1ΥTY1−ΥP^M2−1/Y1−ΥP^, ρ is a given positive constant, and the matrices K1, K2, M1, and M2 can be obtained by solving the Lyapunov equations (6) and (7), respectively.
According to (3) and (4), we can deduce from (17) that(19)vecP^˙=A+K˜1C1+K˜2C2vecP^+vecΓP^,Y1,Y2,L^−K˜1vecY1−K˜2vecY2T.
Clearly,Y1−ΥP^=Y1T−P^TΥT=vecY1−ΥP^=vecY1T−P^TΥT; thus, we get vecΩ=L^M˜−1C1TvecY1−C1vecP^/vecY1−C1vecP^.
In this paper, the estimation error is denoted byE=P−P^. By using (3), (4), and properties about Kronecker product and vec⋅ operator, we can get the following error system:(20)vecE˙=A+K˜1C1+K˜2C2vecE+M˜−1C1TvecΨx−vecΓP^,Y1,Y2,L^.Theorem 1.
If Assumptions1 and 2 are true, then the matrix differential system (17) with the parameter adaptive law (18) is the state observer of the links subsystem (2).
Proof. Consider the following Lyapunov function:(21)V=12vecETM˜vecE+12ρL˜2.
Calculating the orbit derivative ofV along (20) gives that(22)V˙=vecETM˜vecE˙+ρL˜L^˙=vecETM˜A+K˜1C1+K˜2C2vecE+M˜−1C1TvecΨx−vecΓP^,Y1,Y2,L^+ρL˜L^˙=vecETM˜Θ1⊗IN+K˜1C1vecE+vecETM˜IN⊗Θ2+K˜2C2vecE+vecETC1TvecΨx+ρL˜L^˙−L^vecETC1TC1vecEC1vecE,C1vecP^≠vecY10,C1vecP^=vecY1≤12vecETΘ1⊗IN+K˜1C1TM˜+M˜Θ1⊗IN+K˜1C1vecE+12vecETIN⊗Θ2+K˜2C2TM˜+M˜IN⊗Θ2+K˜2C2vecE+vecETC1TvecΨx+ρL˜L^˙−L^vecETC1T,C1vecP^≠vecY10,C1vecP^=vecY1≤−12vecETQ˜1+Q˜2vecE+LvecETC1T+ρL˜L^˙−L^vecETC1T,C1vecP^≠vecY10,C1vecP^=vecY1=−12vecETQ˜1+Q˜2vecE+ρL˜L^˙+L^vecETC1T−L˜vecY1−C1vecP^−L^vecETC1T,C1vecP^≠vecY10,C1vecP^=vecY1=−12vecETQ˜1+Q˜2vecE+L˜ρL^˙−vecY1−C1vecP^=−12vecETQ˜1+Q˜2vecE.
From inequality (22), we can obtain that the estimation error matrix E is bounded and E⟶t⟶+∞0. Thus, Theorem 1 is completely proved.


## 4. Simulation Example

In this paper, we consider a continuous analog Hopfield network with 10 neurons (N=10) [23, 28], which is composed of nodes subsystem and links subsystem, where the nodes subsystem is described as follows:(23)x˙i=Aixi+Bifixi+ci∑j=110pijHjxj,i=1,2,…,10,where Ai=Bi=−i, fixi=−5cost, ci=i, and Hjxj=1−e−xj/1+e−xj.Meanwhile, we assume that the changes in the links’ weightspijt satisfy the Riccati differential equation (2). If we choose N1=5 and ρ=100 and randomly select matrices Θ1∈R10×10,Θ2∈R10×10, and Υ∈R5×10 satisfying Assumption 1, then the matrices K1,M1 and K2,M2 can be obtained by solving the Lyapunov equations (6) and (7), respectively. Thus, we can get the coupling matrix Gx=M1−1ΥTΨxM2−1 in (2) satisfying Assumption 2.Finally, randomly select the initial values of statesxi0,L^0, and pij0, i,j=1,2,…,10 in the range −5,5, and the numerical results are shown in Figures 1–5:(i)
From Figures2–4, we can see that the estimation error converges asymptotically to zero. According to Definition 3, we know that the Riccati dynamical equation (17) with the adaptive law (18) is a state observer of the subsystem (2), and the state observer is effective.(ii)
Compared to the results in [23], our advantage is that the result about the state observer of the subsystem (2) is true whatever the network is directed or undirected. Meanwhile, it is worth noting that, due to the effect of the parameter adaptive law (18), the state observer (17) does not contain the states of the nodes. This shows that the state observer is less affected by the dynamic changes in the nodes and thus improves the robustness of the state observer.Figure 1
State trajectories of subsystem (1).Figure 2
State trajectories of subsystem (2).Figure 3
State trajectories of state observer (17).Figure 4
State trajectories of estimation error system (20).Figure 5
State trajectories of parameter adaptive system (18).


## 5. Conclusions

In this paper, a complete model of CDNs is proposed, which is composed of two coupled subsystems, called nodes subsystem and links subsystem, respectively. Contrary to the existing results on the state estimation problem of nodes subsystem, we mainly focus on the state estimation of the links subsystem with outputs and have designed a state observer with the parameter adaptive law to estimate the state of the links subsystem in this paper. In particular, this method solves the estimation problem of dynamic links in directed networks for the first time. Meanwhile, it implies that we can use the state estimation information of the links to directly design a controller for the links subsystem; thus, some control problems may be solved effectively. Therefore, the design method of state observer for dynamic links proposed in this paper can enrich the achievements about the state estimation of CDNs.



---

*Source: 8846438-2020-10-27.xml*