betaFeedback

WorksMathematics

Tracking disturbances in transmission networks

Abstract

We study the nonlinear inverse source problem of detecting, localizing and identifying unknown accidental disturbances on forced and damped transmission networks. A first result is that strategic observation sets are enough to guarantee detection of disturbances. To localize and identify them, we additionally need the observation set to be absorbent. If this set is dominantly absorbent, then detection, localization and identification can be done in "quasi real-time". We illustrate these results with numerical experiments.

Introduction

Networks play a major role in the transmission of electricity and fluids such as gas, oil, or water. A canonical example is the power grid, a remarkable engineering realization that emerged in the past century. A natural mathematical model of these networks is a graph together with discrete conservation laws. Kirchhoff’s law and Ohm’s law yield the discrete Laplacian: the DC load flow model in the jargon of power grids. This is the model used by many grid operators. Adding inertia to the system one obtains the so-called graph wave equation. Adding driving and damping, we can model the time evolution of an electrical grid [1, 2] and a fluid network [3] in a linearized approximation. This is a linearization of the so-called ”swing equation” used to model the electrical grid [4, 5].

The detection of disturbances on such networks is an important topic. For the grid, disturbances are electromechanical oscillations induced by faulty equipment. For other fluid network, they can be leaks, causing unexpected pressure losses. Such faults can break equipment, see [6] for a survey of such events for the grid. Due to the importance of the problem, many authors addressed the issue of identifying a faulty vertex in a network. Nudell and Chakrabortty [7] propose a graph theoretic algorithm to find forced oscillation inputs; they assume minimal information and estimate how the fault affects the Green’s function of the Laplacian. Chen et al [8] use an energy-based method to locate oscillation sources in power systems. Delabay et al [9] propose to locate a fault using a maximum likelihood approach: here the state of the network is assumed to be known everywhere, not the parameters.

In the literature, many works assume the unknown disturbances to have a given form and only parts of this (frequency, amplitude,...) are unknown and subject to the inverse problem. To address these shortfalls, six years ago, we introduced a source detection approach [10] for the graph wave equation with no damping, assuming distinct eigenvalues of the graph Laplacian and a disturbance on a single vertex that vanishes before reaching the final monitoring time. We defined a strategic observation set of vertices; this allows to reconstruct the state of the disturbance free system using only measurements from this set. From these observations, one can locate the source using an overdetermined linear system based on an adjoint formulation. Interestingly, the rank of the matrix in this linear system revealed graph conditions for placing observation vertices. Finally the procedure permits to reconstruct the disturbance.

Here, we revisit the problem, allow the graph laplacian to admit eigenvalues of arbitrary multiplicities, include damping in the dynamics and allow several disturbances. To monitor the network for disturbances and localizing-identifying them, one can raise the following three questions

  • How to select the observation set of vertices to detect the presence of a disturbance?

  • How to select the observation set to localize disturbances and identify their intensities ?

  • Can this localization and identification be done in ”real time ” ?

We also need technical conditions for which these questions can be answered.

To tackle question one, we introduce the notion of strategic observation set and show that observing such a set gives the state of the network unequivocally. This leads to requiring condition 1 where we assume a healthy time period wherein no disturbances occur. The detection is done by examining the differences between the observations of the system and it’s states when it is free of disturbances (healthy states). Once disturbances have been detected, we use these residuals to localize and identify them.

Questions three is easier to address than question two. We introduce the technical condition that disturbances occur away from the observation set. Then we show that if a submatrix of the graph Laplacian has full rank and the condition above is met, then one can detect, localize and identify disturbances in ”quasi-real time ”. We call such observation sets dominantly observable, for these, the number of vertices is larger than half the total number of network vertices. This is a strong requirement, in many cases only a limited number of sensors are available. We show that if the observation set is absorbent, then detection, localization and identification of disturbances remains possible but with a delay. We present numerical experiments illustrating these results. The article is organized as follows: section 2 presents the mathematical model and states the inverse problem, section 3 shows how to detect accidental disturbances. We present the inverse problem for dominantly absorbent observation sets and for absorbent observation sets in sections 4 and 5 respectively. Section 6 illustrates these results with numerical experiments and we conclude in section 7.

Mathematical modeling and problem statement

In the following, we consider the evolution of a miscible flow on a network modeled by a graph G(V)\mathcal{G}(\mathcal{V}) where V\mathcal{V} is a set of vertices. We assume there are ∣V∣=N|\mathcal{V}| = N vertices and the graph is connected.

We consider the system of differential equations

X¨(t)+ηX˙(t)−ΔX(t)=F(t),(1)\ddot{X}(t) + \eta\dot{X}(t) - \Delta X(t) = F(t), \tag*{(1)}

where XX is the NN dimensional vector defining the network state. Δ\Delta is the N×NN \times N graph Laplacian matrix defined by

Definition 2.1 The graph Laplacian matrix Δ\Delta is the real, symmetric negative semidefinite matrix, such that

Δkl=Δlk>0\Delta_{kl} = \Delta_{lk} > 0 if kk and ll are connected, 00 otherwise,

Δkk=−∑l≠kwkl\Delta_{kk} = -\sum_{l\ne k} w_{kl}.

Here, we choose Δkl=1\Delta_{kl}=1 for simplicity and to illustrate the influence of the topology.

The parameter η>0\eta> 0 is a damping. (1) is established as a linearized model of the swing-equations for the voltage on a power grid; there xnx_n is associated to the phase of the voltage at vertex nn. (1) also models the evolution of the pressure in a fluid (water or gas) network in the linear limit [11, 3, 12].

We now recall the notions of forward and inverse problems associated to (1).

▶ Forward problem: Apart from disturbances, the right hand side term of equation (1) is F=FsourF = F^{sour}, a well known source vector that ensures a desired functioning of the network. Given a final monitoring time T>0T > 0, a source Fn=1,…,Nsour∈L2(0,T)F^{sour}_{n=1,\ldots,N} \in L^2(0,T) and two initial network state conditions X(0)=(x1(0),…,xN(0))TX(0) = (x_1(0), \ldots, x_N(0))^\mathsf{T} and X˙(0)=(x˙1(0),…,x˙N(0))T\dot{X}(0) = (\dot{x}_1(0), \ldots, \dot{x}_N(0))^\mathsf{T}, the problem (1) admits a unique solution X=(x1,…,xN)TX = (x_1, \ldots, x_N)^\mathsf{T} whose xn=1,…,N∈H2(0,T)x_{n=1,\ldots,N} \in H^2(0,T). This is the so-called forward problem. Thus, given a set S\mathcal{S} of network observation vertices, we define the following observation operator:

M[F]:={xn(t) in (0,T), ∀n∈S}.(2)M[F] := \{x_n(t) \text{ in } (0,T),\ \forall n \in\mathcal{S}\}. \tag*{(2)}

We therefore introduce the notions of observation and non-observation sets.

Definition 2.2 The set SS of observation vertices wherein the local network state is recorded is called observation set. The complementary of SS, E=V−S\mathcal{E}=\mathcal{V}-S is the set of non-observation vertices. In the following we label NS=∣S∣N_S=|S|, NE=∣E∣N_{\mathcal{E}}=|\mathcal{E}|.

▶ Inverse problem: Here, we write

F(t)=Fsour(t)+Fdis(t),∀t∈(0,T)F(t)=F^{sour}(t)+F^{dis}(t),\quad\forall t\in(0,T)

where FsourF^{sour} is known and FdisF^{dis} is an unknown accidental disturbance that disrupts the healthy state of the network. In the inverse problem, we are given time records dn(t)d_n(t) in (0,T)(0,T) of the local state xn(t)x_n(t) taken at observation vertices n∈Sn\in S. The task is to detect-localize-identify FdisF^{dis} from dn(t)d_n(t), n∈Sn\in S i.e. invert the map

M[F]={dn(t) in (0,T), ∀n∈S}.(3)M[F]=\left\{d_n(t)\ \text{in}\ (0,T),\ \forall n\in S\right\}. \tag*{(3)}

An important question while addressing this inverse problem is: Which observation set SS ensures the identifiability of the unknown occurring disturbances FdisF^{dis}? In the remainder, we show that SS needs to be strategic, a spectral property. We will also require SS to be absorbent i.e.

Definition 2.3 A set of vertices SS of a graph is absorbent if each vertex of the graph is directly connected to at least one vertex of SS.

or verify a stronger property by being dominantly absorbent that will be introduced later. See the appendix for an algorithm to find an absorbent set SS for a given graph.

Detection of accidental disturbances

To detect unknown disturbances that may affect the network, we request the observation set SS to be strategic. This notion is based on the spectral properties of the graph Laplacian matrix Δ\Delta defined in (2.1). Here, we introduce this notion and establish that for a healthy network i.e., Fdis=0F^{dis}=0, the local knowledge of its state in a strategic observation set determines in a unique manner its global state in all of its vertices. This assertion yields the main ingredient of our procedure to detect disturbances.

Strategic set of network vertices

Since the notion of a strategic observation set of vertices depends on the spectral properties of the graph Laplacian matrix Δ\Delta, we employ the following notations:

  • KK is the number of distinct eigenvalues of the matrix Δ\Delta. Thus, K≤NK\leq N.

  • For k=1,…,Kk=1,\ldots,K: We denote by −ωk2-\omega_k^2 the kthk^{\mathrm{th}} eigenvalue of the matrix Δ\Delta, where the real numbers ωk=1,…,K\omega_{k=1,\ldots,K} are such that 0=ω1<ω2<⋯<ωK0=\omega_1<\omega_2<\cdots<\omega_K. Hence, the distinct eigenvalues of Δ\Delta are labeled in the following decreasing order:

0=−ω12>−ω22>⋯>−ωK2.(4)0=-\omega_1^2>-\omega_2^2>\cdots>-\omega_K^2. \tag*{(4)}
  • mkm_k is the multiplicity of −ωk2-\omega_k^2 and M=max⁡k∈{1,…,K}mkM=\max_{k\in\{1,\ldots,K\}}m_k. Then, N=∑k=1KmkN=\sum_{k=1}^{K}m_k.

  • For k=1,…,Kk=1,\ldots,K: We use the indices kℓ=1,…,mkk_{\ell=1,\ldots,m_k} to denote the normalized orthogonal eigenvectors vkℓv^{k\ell} associated to the kthk^{\mathrm{th}} eigenvalue −ωk2-\omega_k^2 of the matrix Δ\Delta:

Δvkℓ=−ωk2vkℓ,for ℓ=1,…,mk,where k1=k.(5)\Delta v^{k\ell}=-\omega_k^2v^{k\ell},\qquad\text{for }\ell=1,\ldots,m_k,\quad\text{where }k_1=k. \tag*{(5)}

Notice that if the graph is connected, there is a single zero eigenvalue i.e., m1=1m_1=1 [13]. We now introduce the notion strategic set of vertices.

Definition 3.1 A set SS of vertices is strategic if for all eigenvalues −ωk2-\omega_k^2 of multiplicity mkm_k, there exists a subset IkI_k of mkm_k vertices in SS defining a mk×mkm_k\times m_k invertible matrix:

Aiℓ(k)=vikℓ,for ℓ=1,…,mkand∀i∈Ik,(6)A_{i\ell}^{(k)}=v_i^{k\ell},\qquad\text{for }\ell=1,\ldots,m_k\quad\text{and}\quad\forall i\in I_k, \tag*{(6)}

where vkℓ∈RNv^{k\ell}\in\mathbb{R}^{N} are the mkm_k eigenvectors associated to the eigenvalue −ωk2-\omega_k^2 of Δ\Delta.

Hence, SS is strategic if for all eigenvalues −ωk2-\omega_k^2 of multiplicity mkm_k, there exists a subset IkI_k of mkm_k row labels in SS such that the matrix A(k)A^{(k)} whose columns are the mkm_k eigenvectors vkℓv^{k\ell} is of full rank. Note that a strategic set contains at least MM vertices, where MM is the maximal multiplicity of the eigenvalues.

This definition generalizes the one given in [10] for the case where all eigenvalues of the Laplacian matrix Δ\Delta are of multiplicity 1. It is also a transposition for discrete systems of the result in [14].

From Definition 3.1, it follows that every set containing a strategic set is also strategic. As examples:

  1. For M=1M=1: SS is strategic if: ∀k∈{1,…,K=N}\forall k\in\{1,\ldots,K=N\}, ∃Ik={i}∈S\exists I_k=\{i\}\in S, vik≠0v_i^k\ne0.

  2. For M=2M=2: SS is strategic if: ∀k∈{1,…,K<N}\forall k\in\{1,\ldots,K<N\}, it holds:

    • If mk=1m_k=1, then there exists Ik={i}∈SI_k=\{i\}\in S such that vik≠0v_i^k\ne0.

    • If mk=2m_k=2, there exists Ik={i,j}⊂SI_k=\{i,j\}\subset S defining A(k)=(vik1vik2vjk1vjk2)A^{(k)}=\begin{pmatrix}v_i^{k_1}&v_i^{k_2}\\v_j^{k_1}&v_j^{k_2}\end{pmatrix} invertible.

In the light of Definition 3.1, we establish the following theorem on the main property of a strategic set of vertices. This property so-called state representative of healthy networks stipulates that, in the absence of disturbances, the states of the vertices of a strategic set determine uniquely the global state of the network. This is the healthy state of the network.

References

  1. [1]Filatrella G., Nielsen H. and Pedersen N.F. (2008) Analysis of a power grid using a kuramoto-like model, The European Physical Journal B-Condensed Matter and Complex Systems, 61(4), pp. 485-491.DOI
  2. [2]Machowski J., Bialek W. and Bumby J.R. (2008) Power System Dynamics, 2nd ed. (Wiley, Chichester U.K.)
  3. [3]C. Maas, ”Transportation in graphs and the admittance spectrum”, Discrete Applied Mathematics, 16, 32-49, (1987).DOI
  4. [4]Tyloo M. , Pagnier L. and Jacquod P., Science advances, 5, (2019).
  5. [5]Kou G., Hadley S., Markham P. and Liu Y. (2012) Developing generic dynamic models for the 2030 eastern interconnection grid, Tech. Rep. (Oak Ridge National Laboratory).
  6. [6]M. Ghorbaniparvar, Survey on forced oscillations in power system, J. Mod. Power Syst. Clean Energy (2017) 5(5), 671–682DOI
  7. [7]T. R. Nudell and A. Chakrabortty (2014) A Graph-Theoretic Algorithm for Localization of Forced Harmonic Oscillation Inputs in Power System Networks, American Control Conference (ACC).DOI
  8. [8]Lei Chen, Member, Yong Min, and Wei Hu, An energy-based method for location of power system oscillation source, IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 28, NO. 2, MAY 2013DOI
  9. [9]R. Delabays, A. Y. Lokhov, M. Tyloo and M. Vuffray, Locating the Source of Forced Oscillations in Transmission Power Grids PRX ENERGY 2, 023009 (2023)DOI
  10. [10]J.G. Caputo, A. Hamdi and A. Knippel, Inverse source problem in a forced network, Inverse Problems, 35, 055006, (2019).DOI
  11. [11]J.-G. Caputo, A. Knippel and E. Simo, ”Oscillations of simple networks: the role of soft nodes”, J. Phys. A: Math. Theor. 46, 035100 (2013)DOI
  12. [12]Yue Wu, Kin Keung Lai and Yongjin Liu, ”Deterministic global optimization approach to steady-state distribution gas pipeline networks”, Optim. Eng. 8, 259-275, (2007).DOI
  13. [13]D. Cvetkovic, P. Rowlinson and S. Simic, ”An Introduction to the Theory of Graph Spectra”, London Mathematical Society Student Texts (No. 75), (2001).
  14. [14]El Jai and AJ Pritchard, International Journal of Control, 46, 1139-1153, (1987).
  15. [15]Kwon K. and Littlejohn L. (1997) Classification of classical orthogonal polynomials, Korean Math. Soc. 34, pp. 973-1008.
  16. [16]Liu Y. (1998) A domain decomposition method with orthogonal polynomials: Legendre polynomials, Mathematical and Computer modelling 89, pp. 309-325.
  17. [17]Donatelli M., Neuman A. and Reichel L. (2012) Square regularization matrices for large linear discrete ill-posed problems, Numer. Linear Algebra Appl., 19:896-913.
  18. [18]Faure B., Lemaire B. , Picouleau C., Precis de recherche operationnelle, Dunod, (2009).

Paper details

vlnc:W_mnwzdmbs
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents