# Consensus Information Filtering for Large-Scale Systems with Application to Heat Conduction Process

Authors: Liguo Zhang; Ying Lyu
Journal: Discrete Dynamics in Nature and Society
 (2015)

---

## Abstract

For large-scale distributed systems, the evolution of system dynamics is dominated by current states and boundary conditions simultaneously. This work describes a distributed consensus filtering for a class of large-scale distributed systems with unknown boundary conditions, which are monitored by a set of sensors. Because of the difference of spatial positions among the sensor network, only the single state variables or both the states and outside input jointly could be estimates with Kalman information filtering, respectively. On diffusion processing, we fuse the common state estimations of the local information filters using consensus averaging algorithms and algebraic graph theory. Stability and performance analysis is provided for this distributed filtering algorithm. Finally, we consider an application of distributed estimation to a heat conduction process. The performance of the proposed distributed algorithm is compared to the centralized Kalman filtering.


---

## Body

## 1. Introduction

Large-scale systems have been studied extensively in the cutting-edge technology-based social sectors, ranging from ocean, atmospheric, and hydrological sciences [1, 2] and oil reservoir simulations [3] to intelligent transportation systems [4–6]. The large-scale systems are usually formulated with a set of partial differential equations to express their distributed, multiparameter coupled dynamical behaviors. In recent years, more attention has been given to cyber-physical systems, in which the physical plants usually are described with large-scale systems [1, 4, 7].State estimate of large-scale systems is a challenging task, since the evolution of the large-scale systems usually codominated by the current system states and the outside boundary conditions. The troublesome problem is the boundary conditions are often unknown or inaccessible in advance in some applications. Two kinds of approaches have been developed in recent years to solve this problem. One method assumes that the boundary conditions are random walking variables and then estimates these variables as extended system states [8]. Another method treats these boundary conditions as outside system input and estimates system states and unknown input simultaneously based on the iterating two-step or multistep Kalman filtering [9, 10].In this work, we present a distributed simultaneous state and input estimate method for a class of large-scale systems with unknown boundary conditions which are monitored by a sensor network. Based on the spatial positions of sensor nodes, the large-scale system is firstly decomposed into low-dimensional subsystems. If the sensor nodes are located at the boundary grids, information filtering for simultaneous state and input estimate is developed. Then consensus strategy fuses state estimations which are common among the local information filters using the consensus averaging algorithms [11].The aims of this paper are (1) to decompose the large-scale distributed parameter system into spatial subsystems with reduced observation models; locations of the sensor group throughout the spatial domain significantly affect the outcome and quality of state estimation; we model sensors placed in different locations with different output operators, (2) to develop the information filtering algorithm for simultaneous state and boundary condition estimation for local sensor groups and design consensus estimator for every sensor so that the overall state can be estimated via local exchange of messages among neighboring nodes, and (3) to present a stability analysis distributed Kalman consensus filtering algorithm.The subsequent sections are organized as follows. Some background on centralized and decentralized observation models is provided in Section2. State-space partition of large-scale system is formulated in Section 3. In Section 4, we present the information filtering for simultaneous state and input estimate. Distributed Kalman consensus filters for large-scale systems with unknown boundary conditions are introduced in Section 5.1. Stability analysis is provided in Section 5.2. Simulation results and performance comparisons for a 1D heat conduction process are presented in Section 6. Conclusions and future work are discussed in Section 7.


## 2. Problem Statement

### 2.1. Spatially Distributed Processes

Consider the spatially distributed physical process represented by the following convection-diffusion equation:(1)∂u∂tt,ξ-e∂2u∂ξ2t,ξ+ct,ξ∂u∂ξt,ξ=ft,ξ,where t∈[0,∞), 0<ξ<L, and L is the length of one spatial dimension. f(t,ξ) is the given outside environment, e is the small diffusion coefficient, and c(t,ξ) is the convection coefficient.Assume that the initial conditions of (1) are given by(2)u0,ξ=u0ξ,0<ξ<L, where u0(ξ) is a given function. And the boundary conditions are imposed on both edges as(3)ut,0=G0t,ut,L=GLt,t∈0,∞, where G0(t), GL(t) are outside input functions.When the initial and boundary conditions (2)-(3) are compatible, (1) is well posed in the sense that it has a unique solution u(t,ξ).


### 2.2. Spatiotemporal Discretization

The above PDEs could be solved numerically on a spatial uniformed mesh grid with the finite-difference discretization method. The central approximations of the first- and the second-order derivative are, respectively,(4)∂u∂ξt,jh≈uj+1-uj-12,(5)∂2u∂ξ2t,jh≈uj+1-2uj+uj-1h2, where uj is the value of the random field u(t,jh) at the jth location of the spatial grid and h is the length of the spatial grid.Temporal discretization approximates the time derivative of PDEs (1) by using the forward Euler method. For those boundary grids whose outer grids are missing, the temporally discretized boundary conditions G0(t), GL(t) are represented as discrete variable d(k), where k=1,2,…, is the discrete-time instant.In general, the spatiotemporal discretization of the PDEs (1) is formulated by the following discrete-time state-space model:(6)xk+1=Axk+Bdk+wk,k≥0, where the state vector x=(x1,…,xn)T∈Rn is the collection of the sorted variables uj, by, for example, using the lexicographic ordering. Unknown input d=(d1,…,dm)T∈Rm is the discretized boundary condition, and w(k)∈Rn is the model approximation error assumed to be mutually uncorrelated, zero-mean, white random signals with known covariance matric Q=EwkwkT. A∈Rn×n, B∈Rn×m are system state matrix and boundary input matrix, respectively.Remark 1.
For the system matrixB of the discrete-time model (6), nonzero element bij∈B means that the state xi representing the value of the spatial grid is affected directly by the outside boundary input dj; otherwise, zero element of B means that xi represents the inside grid.


### 2.3. Distributed Observation Model

We assume that system (6) is monitored by a network of N sensors, in which the boundary information is not accessible directly. Then the local observations at sensor i at time k are(7)zik=Hixk+vik, where H(i)∈Rpi×n is the local observation matrix, pi is the number of simultaneous observations made by sensor i at time k, and v(i)(k)∈Rpi is the local observation noise assumed to be mutually uncorrelated, zero-mean, white random signals with known covariance matric R(i)=EvikvikT.Remark 2.
The local measurementz(i)(k) may be temperature or some other physical attribute at local sensor i. The observation matrix H(i) is particular to the spatial position (corresponding to the nonzero element in H(i)) of the local sensor i, in the uniformed mesh grid.We collect all observations in the network to get the global observation model. Letp be the total number of observations at all sensors. Let the global observation vector, z(k)∈Rp, the global observation matrix, H∈Rp×n, and the global observation noise vector, v(k)∈Rp, be(8)zk=z1k⋯zNkT,H=H1⋯HNT,vk=v1k⋯vNkT.Then the global observation model is given by(9)zk=Hxk+vk. Since the observation noises at the different sensors are independent, we can combine the local observation noise covariance matrices at each sensor into the global observation noise covariance matrix, R, as(10)R=blockdiagR1,…,RN.For large-scale systems with unknown boundary conditions, centralized and distributed filtering for simultaneous input and state estimation are discussed, respectively. No prior information about the unknown boundary input,d(k), in the system model (7) is available or accessible in advance.


## 2.1. Spatially Distributed Processes

Consider the spatially distributed physical process represented by the following convection-diffusion equation:(1)∂u∂tt,ξ-e∂2u∂ξ2t,ξ+ct,ξ∂u∂ξt,ξ=ft,ξ,where t∈[0,∞), 0<ξ<L, and L is the length of one spatial dimension. f(t,ξ) is the given outside environment, e is the small diffusion coefficient, and c(t,ξ) is the convection coefficient.Assume that the initial conditions of (1) are given by(2)u0,ξ=u0ξ,0<ξ<L, where u0(ξ) is a given function. And the boundary conditions are imposed on both edges as(3)ut,0=G0t,ut,L=GLt,t∈0,∞, where G0(t), GL(t) are outside input functions.When the initial and boundary conditions (2)-(3) are compatible, (1) is well posed in the sense that it has a unique solution u(t,ξ).


## 2.2. Spatiotemporal Discretization

The above PDEs could be solved numerically on a spatial uniformed mesh grid with the finite-difference discretization method. The central approximations of the first- and the second-order derivative are, respectively,(4)∂u∂ξt,jh≈uj+1-uj-12,(5)∂2u∂ξ2t,jh≈uj+1-2uj+uj-1h2, where uj is the value of the random field u(t,jh) at the jth location of the spatial grid and h is the length of the spatial grid.Temporal discretization approximates the time derivative of PDEs (1) by using the forward Euler method. For those boundary grids whose outer grids are missing, the temporally discretized boundary conditions G0(t), GL(t) are represented as discrete variable d(k), where k=1,2,…, is the discrete-time instant.In general, the spatiotemporal discretization of the PDEs (1) is formulated by the following discrete-time state-space model:(6)xk+1=Axk+Bdk+wk,k≥0, where the state vector x=(x1,…,xn)T∈Rn is the collection of the sorted variables uj, by, for example, using the lexicographic ordering. Unknown input d=(d1,…,dm)T∈Rm is the discretized boundary condition, and w(k)∈Rn is the model approximation error assumed to be mutually uncorrelated, zero-mean, white random signals with known covariance matric Q=EwkwkT. A∈Rn×n, B∈Rn×m are system state matrix and boundary input matrix, respectively.Remark 1.
For the system matrixB of the discrete-time model (6), nonzero element bij∈B means that the state xi representing the value of the spatial grid is affected directly by the outside boundary input dj; otherwise, zero element of B means that xi represents the inside grid.


## 2.3. Distributed Observation Model

We assume that system (6) is monitored by a network of N sensors, in which the boundary information is not accessible directly. Then the local observations at sensor i at time k are(7)zik=Hixk+vik, where H(i)∈Rpi×n is the local observation matrix, pi is the number of simultaneous observations made by sensor i at time k, and v(i)(k)∈Rpi is the local observation noise assumed to be mutually uncorrelated, zero-mean, white random signals with known covariance matric R(i)=EvikvikT.Remark 2.
The local measurementz(i)(k) may be temperature or some other physical attribute at local sensor i. The observation matrix H(i) is particular to the spatial position (corresponding to the nonzero element in H(i)) of the local sensor i, in the uniformed mesh grid.We collect all observations in the network to get the global observation model. Letp be the total number of observations at all sensors. Let the global observation vector, z(k)∈Rp, the global observation matrix, H∈Rp×n, and the global observation noise vector, v(k)∈Rp, be(8)zk=z1k⋯zNkT,H=H1⋯HNT,vk=v1k⋯vNkT.Then the global observation model is given by(9)zk=Hxk+vk. Since the observation noises at the different sensors are independent, we can combine the local observation noise covariance matrices at each sensor into the global observation noise covariance matrix, R, as(10)R=blockdiagR1,…,RN.For large-scale systems with unknown boundary conditions, centralized and distributed filtering for simultaneous input and state estimation are discussed, respectively. No prior information about the unknown boundary input,d(k), in the system model (7) is available or accessible in advance.


## 3. Partitioned Large-Scale Systems

In this section, we partition the large-scale system into subsystems based on the different spatial positions of the local sensors. Each sensor has the capability to generate its own estimate using locally available measurements.Case 1.
The local sensori is placed at the boundary grids of the spatiotemporal discretization model (6), i∈Nb. Nb⊆N is the corresponding index set.
In this case,RankHiB=mi≤Rank(B), mi≠0. We select submatrices B(i) containing the elements taken from the full-order matrix B with indices belonging to n×Iid, where the index set Iid=j1i,…,jmii, j1i,…,jmii∈1,…,m, j1i<⋯<jmii, and mi≤m, such that(11)RankHiBi=RankBi=Rankdki=mi, where dk(i) is an mi-dimensional vector composed of the components of dk selected by Iid.
Then, the local subsystem models available to theith sensor can be defined as(12)xk+1=Axk+Bidik+wk,(13)zik=Hixk+vik,i∈Nb. In order to estimate all boundary inputs dk, we further assume that ⋃Iid=1,…,m.Case 2.
The local sensori is placed at the inside grids of the spatiotemporal discretization model (6); i∈N-Nb.
In this case, the elements of matrixB corresponding to the inside grids are zeroes; that is, H(i)B=0. Then, we define the local submatrices as B(i)=0 and extract the local subsystem models as(14)xk+1=Axk+wk,zik=Hixk+vik,i∈N-Nb.Example 3.
Consider the one-dimensional distributed parameter heat conduction model on a rod. Spatial discretization results in the grid shown in Figure1. A number of sensors are located on the specified grid points and each sensor measures the specified temperature. Unknown boundary conditions on the end of the rod are d(k)=dLkdRkT, and the boundary system matrix is(15)B=10⋯000⋯1T.
When the sensor is located at the grid point 1, the local observation matrix should beH(1)=10⋯0. Then, B(1) is obtained as a submatrix including the first column of the full-order boundary matrix B; that is,(16)B1=10⋯0T. We define the input as d(1)(k)=dL(k).
When the sensor location is at the grid point 2, or the other inside grids, the local observation matrix should beH(2)=01⋯0. In this case, H(2)B=0, and we define B(2)=0. The subsystem models are not including outside input.Figure 1
One-dimensional heat conduction model with unknown boundary conditions.


## 4. Information Filtering for Simultaneous Input and State Estimation

In this subsection, we extend the classical Kalman information filtering for simultaneous input and state estimation. Recursive equations of information filtering for subsystems (14) (omit index i) can be written as(17)x^k=x¯k+Pkyk-Ux¯k,U=HTR-1H,Pk=P¯k-1+U-1,P¯k=APk-1AT,x¯k=Ax^k-1,with weighted sensor data y(k)=HTR-1z(k) and information matrix U. The error covariance matrices are defined as P(k)=EηkηkT, P¯(k)=Eη¯kη¯kT, where η(k)=x(k)-x^(k), η¯(k)=x(k)-x¯(k), with P(0)=P0.For subsystems (12) with unknown input, two-step optimal filtering for simultaneous input and state estimation has been developed in [9, 10]. The main purpose is to estimate input from the innovation by least-squares estimation. Recursive state and input filters are as follows:(18)x~k=Ax^k-1,(19)d^k-1=Mkzk-Hx~k,(20)x¯k=x~k+Bd^k-1,(21)x^k=x¯k+Kkzk-Hx¯k, where d^ represents input estimate and x¯(k) and x~(k) represent the state prediction with and without the input information, respectively.The optimal gain matrices are obtained as(22)Mk=DTR~k-1D-1DTR~k-1,(23)Kk=P¯kHT+SkR˘k-1, where D=HB, S(k)=-BM(k)R, R~(k)=H(AP(k)AT+Q)HT+R, and R˘(k)=HP¯(k)HT+R+HS(k)+S(k)THT.The error covariance matrices are updated according to(24)Pk=P¯k-KkP¯kHT+SkT,P¯k=A~kPk-1A~kT+Q~k, where A~(k)=I-BMkHA, I denotes the identity matrix, and Q~(k)=BM(k)RM(k)TBT.Recall from (23) that the Kalman gain K(k) can be written as(25)Kk=P¯kHT+SkR˘k-1=P¯kH+SkTP¯k-1THP¯kHT+R+HSk+SkTHT-1=P¯kH+SkTP¯k-1TH+SkTP¯k-1P¯kH+SkTP¯k-1T+R-SkTP¯k-1Sk-1.Defining(26)H¯k=H+SkTP¯k-1,R¯k=R-SkTP¯k-1Sk the equation of the Kalman gain matrix can be equivalently expressed as(27)Kk=P¯kH¯kTH¯kP¯kH¯kT+R¯k-1 and the error covariance matrix P(k) can be expressed as(28)Pk=P¯k-KkP¯kHT+SkT=P¯k-KkH¯kP¯k=P¯k-P¯kH¯kTH¯kP¯kH¯kT+R¯k-1H¯kP¯k.DefiningF(k)=I-K(k)H¯(k), we further have(29)Pk=I-KkH¯kP¯kI-KkH¯kT+KkR¯kKkT=FkP¯kFkT+KkR¯kKkT,(30)Kk=PkH¯kTR¯k-1. Derivation details of (29) and (30) are omitted here for conciseness.Using the matrix inversion lemma,(31)A+BD-1C-1=A-1-A-1BD+CA-1B-1CA-1. Equation (29) can be written as(32)Pk=P¯k-1+H¯kTR¯k-1H¯k-1.Substituting the definition ofH¯(k) into the state equation (21) gives(33)x^k=x¯k+Kkzk-Hx¯k(34)=x¯k+Kkzk+SkTP¯k-1x¯k-H¯kx¯k.Defining the weighted sensor datay(k) and the information matrix U(k) as(35)yk=H¯kTR¯k-1zk+SkTP¯k-1x¯k,Uk=H¯kTR¯k-1H¯k the information filtering for simultaneous input and state estimation can be restated as(36)x~k=Ax^k-1,d^k-1=Mkzk-Hx~k,x¯k=x~k+Bd^k-1,x^k=x¯k+Pkyk-Ukx¯k,Pk=P¯k-1+Uk-1.


## 5. Consensus Based Information Filtering

### 5.1. Consensus Based Filtering Algorithm

A distributed sensor network consisting ofN sensor nodes is adopted to monitor a large-scale system with unknown boundary conditions. The nodes are connected to each other in some network topology. The set of neighbors of node i including node i itself is denoted by the set Ni.Consensus information filtering for system (6) can be expressed as(37)x^i=x¯i+Piyi-Uix¯i+Ci∑j∈Nix¯j-x¯i, where P(i), U(i), and y(i) are calculated from (17) or (36) according to the sensor node i lying in the outside grids (Case 1) of the large-scale system or inside grids (Case 2), respectively.The choice of consensus gainC(i) is related to the estimation variance of local sensor i; that is,(38)Ci=ϵP¯i1+P¯i, where · is the Frobenius norm of a matrix and ϵ>0 is a relatively small constant.The local boundary condition estimate(39)d^i=Mizi-Hix^i, for i∈Nb.In construction of subsystems, we require⋃Iid={1,…,m}, which means that the global boundary conditions are covered by a set of local estimates. Therefore, we can reconstruct the estimate of boundary conditions by choosing the corresponding components from the local estimate:(40)d^j=d^ij,j∈Iid, where d^(j) is the jth component of the estimate vector d^.


### 5.2. Convergence Analysis

Stability of estimation is often formulated in terms of stabilizability and detectability conditions. However, these conditions are not sufficient to guarantee stability in the more complicated simultaneous state and input estimations. Following the results in [12], we present stability analysis for distributed estimation of large-scale systems with unknown boundary conditions.Lemma 4.
For the information filter (36), F(k)=I-P(k)U(k)=P(k)P¯-1(k), and P(k+1)=F(k)G(k)FT(k) with(41)Gk=A~k-1Pk-1A~Tk-1+Q~k-1+P¯k-1UkP¯k-1. Moreover, if U(k) is positive definite, then G(k) is positive definite as well.Lemma 5.
Suppose that information matrixU(k) is positive definite. Then, the error dynamics of the discrete-time information filter (36) is globally asymptotically stable with a Lyapunov function V(η(k))=η(k)TP-1(k)η(k).Proofs of Lemmas4 and 5 are deduced from (30), (32) and with P(k)(P¯(k)+U(k))=I.Theorem 6.
Consider the distributed filter (37) with consensus gain C(i)(k)=γF(i)(k)G(i)(k) and Fik=I-PikUik:(42)Gik=A~ik-1Pik-1A~iTk-1+Q~ik-1+P¯ikUikP¯ik. Suppose that the information matrix U(i)(k) is positive definite for all i. Then, the error dynamics of the distributed Kalman consensus filter (37) is globally asymptotically stable for a sufficient small γ>0. Furthermore, all estimators asymptotically reach a consensus on state estimates; that is, x^(1)(k)=x^(2)(k)=⋯=x^(N)(k)=x(k).Proof.
The error dynamics (without noise) of the consensus filter can be written as(43)ηik+1=FikA~ikηik+CikA~ik∑j∈Niηjk-ηik. Using the Lyapunov function in Lemma 5 and calculating the change (44)δVηk=Vηk+1-Vηk,we have(45)δV=∑iηiTk+1Pik-1ηik+1-ηiTkPik-1ηik=∑iFikA~ikηik+CikμikTPik+1-1FikA~ikηik+Cikμik-ηiTkPik-1ηik=∑iηiTkA~iTkFiTkPik+1-1FikA~ik-Pik-1ηik+2∑iη¯iTk+1FiTkPik+1-1Cikμik+∑iμiTkCiTkPik+1-1Cikμik with (46)μik=A~ik∑j∈Niηjk-ηik.
The first term in (45) is negative semidefinite from Lemma 4, and the second term can be designed negative semidefinite using the quadrtic property of graph Laplacians [12, 13], by setting the consensus gain: (47)Cik=γFikGik.
The last term in the expression ofδV is positive semidefinite, while we could choose γ sufficiently small so that the sum of the first and third terms is negative semidefinite. The following proof is analogous to the Theorem  2 in [14].


## 5.1. Consensus Based Filtering Algorithm

A distributed sensor network consisting ofN sensor nodes is adopted to monitor a large-scale system with unknown boundary conditions. The nodes are connected to each other in some network topology. The set of neighbors of node i including node i itself is denoted by the set Ni.Consensus information filtering for system (6) can be expressed as(37)x^i=x¯i+Piyi-Uix¯i+Ci∑j∈Nix¯j-x¯i, where P(i), U(i), and y(i) are calculated from (17) or (36) according to the sensor node i lying in the outside grids (Case 1) of the large-scale system or inside grids (Case 2), respectively.The choice of consensus gainC(i) is related to the estimation variance of local sensor i; that is,(38)Ci=ϵP¯i1+P¯i, where · is the Frobenius norm of a matrix and ϵ>0 is a relatively small constant.The local boundary condition estimate(39)d^i=Mizi-Hix^i, for i∈Nb.In construction of subsystems, we require⋃Iid={1,…,m}, which means that the global boundary conditions are covered by a set of local estimates. Therefore, we can reconstruct the estimate of boundary conditions by choosing the corresponding components from the local estimate:(40)d^j=d^ij,j∈Iid, where d^(j) is the jth component of the estimate vector d^.


## 5.2. Convergence Analysis

Stability of estimation is often formulated in terms of stabilizability and detectability conditions. However, these conditions are not sufficient to guarantee stability in the more complicated simultaneous state and input estimations. Following the results in [12], we present stability analysis for distributed estimation of large-scale systems with unknown boundary conditions.Lemma 4.
For the information filter (36), F(k)=I-P(k)U(k)=P(k)P¯-1(k), and P(k+1)=F(k)G(k)FT(k) with(41)Gk=A~k-1Pk-1A~Tk-1+Q~k-1+P¯k-1UkP¯k-1. Moreover, if U(k) is positive definite, then G(k) is positive definite as well.Lemma 5.
Suppose that information matrixU(k) is positive definite. Then, the error dynamics of the discrete-time information filter (36) is globally asymptotically stable with a Lyapunov function V(η(k))=η(k)TP-1(k)η(k).Proofs of Lemmas4 and 5 are deduced from (30), (32) and with P(k)(P¯(k)+U(k))=I.Theorem 6.
Consider the distributed filter (37) with consensus gain C(i)(k)=γF(i)(k)G(i)(k) and Fik=I-PikUik:(42)Gik=A~ik-1Pik-1A~iTk-1+Q~ik-1+P¯ikUikP¯ik. Suppose that the information matrix U(i)(k) is positive definite for all i. Then, the error dynamics of the distributed Kalman consensus filter (37) is globally asymptotically stable for a sufficient small γ>0. Furthermore, all estimators asymptotically reach a consensus on state estimates; that is, x^(1)(k)=x^(2)(k)=⋯=x^(N)(k)=x(k).Proof.
The error dynamics (without noise) of the consensus filter can be written as(43)ηik+1=FikA~ikηik+CikA~ik∑j∈Niηjk-ηik. Using the Lyapunov function in Lemma 5 and calculating the change (44)δVηk=Vηk+1-Vηk,we have(45)δV=∑iηiTk+1Pik-1ηik+1-ηiTkPik-1ηik=∑iFikA~ikηik+CikμikTPik+1-1FikA~ikηik+Cikμik-ηiTkPik-1ηik=∑iηiTkA~iTkFiTkPik+1-1FikA~ik-Pik-1ηik+2∑iη¯iTk+1FiTkPik+1-1Cikμik+∑iμiTkCiTkPik+1-1Cikμik with (46)μik=A~ik∑j∈Niηjk-ηik.
The first term in (45) is negative semidefinite from Lemma 4, and the second term can be designed negative semidefinite using the quadrtic property of graph Laplacians [12, 13], by setting the consensus gain: (47)Cik=γFikGik.
The last term in the expression ofδV is positive semidefinite, while we could choose γ sufficiently small so that the sum of the first and third terms is negative semidefinite. The following proof is analogous to the Theorem  2 in [14].


## 6. Example: A Heat Conduction Process

Consider a rod with lengthL and cross section radius r; see Figure 1. The density, heat capacity, and thermal conductivity of the material are denoted by ρ, Cp, and κ, respectively. Using the energy balance equation, we get the following partial differential equation:(48)∂T∂t=1ρCpκ∂2T∂l2+λPeATTe-T, where T is the temperature of the rod, Te the temperature of the environment, λ the heat transfer coefficient of the surface of the rod, l the spatial coordinate of the length, Pe=2πr the perimeter of the rod, and AT=πr2 the area of the longitudinal section.For the distributed parameter system (48), we assume that the initial condition is T(l,0)=T0, and the boundary conditions T(0,t), T(L,t) are unknown inputs, respectively.Employing the central approximation (4), (48) becomes the ordinary differential equation(49)dTidt=CxTi-1-2Cx+CPehTi+CxTi+1+CPehTe with i being the node index corresponding to the grid point index increasing from the left to the right and(50)Cx=κρCph2,CPeh=λPeρCpAT, where h is the distance between each grid.Using the temporal Euler approximation (time increment assumed to be less than1/2Cx for convergence), the state equation is discretized to get the discrete-time linear equation(51)xk+1=Axk+Bdk+wk, with state vector x=T1⋯TnT, unknown boundary conditions dk=TLkTRkT, and model approximation error w(k) with the covariance matric Q.In this simulation, the boundary conditions are taken as(52)TLk=TRk=Tb4sin⁡kζk, where ζ(k) is a normal Gaussian variable. Suppose that no information about TL(k), TR(k) is available for use.The model and simulation parameters are shown in Table1. Three local sensor groups are located separately at the left, central, and right grids of the rod. The simulation final time is 80 seconds and the consensus gains are C(i)=0.2. All sensor groups are fully connected.Table 1
Model and simulation parameters.
Parameters
Values
Units
ρ
8700
kgm−3
κ
400
Wm−1 K−1
C
p
385
Jkg−1 K−1
λ
10
Wm−1 K−1
T
e
0
K
T
b
298.15
K
L
4
m
n
10
−
T
0
50
K
x
0
100
K
Q
0.2
−
R
0.2
−We get the following three subsystem observation matrices as(53)H1=10⋯0001⋯00,B1=10⋯0T,H2=⋯100⋯⋯010⋯⋯001⋯,B2=0,H3=00⋯1000⋯01,B3=00⋯1T.The simulations are performed in MATLAB 7.0 environment using an Intel 2.40 GHz processor with 512 MB of RAM and under Microsoft Windows XP operating systems. The simulations have been repeated 50 times, and averagely the distributed information filtering takes about 1.07 seconds while the simulation time of the optimal Gillijins-De Moor algorithm requires about 2.60 seconds.We compare the estimation error between the distributed information filtering and the Gillijins-De Moor algorithm. The state estimation results for grids 1, 2, and 10 are shown in Figures2–4, and left and right boundary condition estimations are shown in Figures 5-6. It may be seen that the distributed filtering provides a relatively satisfied estimation for both states and boundary inputs. However, compared with the Gillijins-De Moor algorithm, the developed filtering slightly reduces the accuracy of estimation within about 8 percent. An obvious improvement (with simple model magnitude) is the fact that the algorithm speed is faster than using the Gillijins-De Moor algorithm.Figure 2
Temperature values of the leftmost grid.Figure 3
Temperature values of the second grid.Figure 4
Temperature values of the rightmost grid.Figure 5
The left boundary conditions.Figure 6
The right boundary conditions.Following Olfati-Saber and Shamma [15] on the appropriate measure of the disagreement of the estimates, we use the following disagreement measure:(54)δk2=∑i=1Nδik2, where (55)δik=x^ik-μk,μk=1N∑ix^ik.The evolution of the disagreement term is depicted in Figure7, which shows that a relatively high disagreement at the beginning is bounded asymptotically.Figure 7
Evolution of consensus disagreementδ(k).


## 7. Conclusions

The concept of consensus filters is applied to distributed parameter systems with unknown boundary conditions. The local sensor groups have different reduced observation models according to their spatial locations, and we decompose the whole large-scale distributed parameter systems into different local subsystems. Local information filtering algorithms are developed to estimate the state and the boundary condition simultaneously and extended to the distributed Kalman consensus filter through a penalty term that enforces consensus. A 1-dimensional heat conduction process model with two known boundary conditions is used to illustrate the spatially distributed consensus filter with three sensor groups.Future work will consider applications of the distributed consensus filtering estimation to some concrete distributed parameter systems, such as the networks of traffic flows with changing traffic demands, and hydrological or atmospheric transportation models.



---

*Source: 576341-2015-12-09.xml*