학술논문

Graph-Frequency Domain Kalman Filtering for Industrial Pipe Networks Subject to Measurement Outliers
Document Type
Periodical
Source
IEEE Transactions on Industrial Informatics IEEE Trans. Ind. Inf. Industrial Informatics, IEEE Transactions on. 20(5):7977-7985 May, 2024
Subject
Power, Energy and Industry Applications
Signal Processing and Analysis
Computing and Processing
Communication, Networking and Broadcast Technologies
Vectors
Mathematical models
Kalman filters
Pollution measurement
Temperature distribution
Time-varying systems
Temperature measurement
Constrained Kalman filtering
graph signal processing (GSP)
industrial pipe networks (PNs)
measurement outliers
time-varying graph
Language
ISSN
1551-3203
1941-0050
Abstract
This article is concerned with the outlier-resistant state estimation problem for industrial pipe networks (PNs). PN signals, e.g., pressure and temperature, are modeled as low-pass time-varying graph signals, and an outlier-resistant graph-frequency domain (GFD) filter is proposed. This article extends the innovation saturation (IS) mechanism from the node domain to the GFD. A GFD IS function is developed with a more compact structure, which reduces outlier effects by restricting PN signals' smoothness. Since the PN signal is time-varying, the saturation function is embedded in the Kalman filter as an inequality constraint. The close-form solution to the filter is derived by replacing the nonlinear inequality constraints with high-pass graph Fourier transforms, and the cutoff frequency is found by analyzing the graph-frequency component of prior and posterior. A steel industrial PN is used to evaluate the proposal. Results indicate that the proposed filter exhibits superior performance in PN systems, particularly internal nodes.