Knowing the pressure at all times in each node of a water distribution system (WDS) facilitates safe and efficient operation. Yet, complete measurement data cannot be collected due to the limited number of instruments in a real-life WDS. The data-driven methodology of reconstructing all the nodal pressures by observing only a limited number of nodes is presented in the paper. The reconstruction method is based on K-localized spectral graph filters, wherewith graph convolution on water networks is possible. The effect of the number of layers, layer depth and the degree of the Chebyshev-polynomial applied in the kernel is discussed taking into account the peculiarities of the application. In addition, a weighting method is shown, wherewith information on friction loss can be embed into the spectral graph filters through the adjacency matrix. The performance of the proposed model is presented on 3 WDSs at different number of nodes observed compared to the total number of nodes. The weighted connections prove no benefit over the binary connections, but the proposed model reconstructs the nodal pressure with at most 5% relative error on average at an observation ratio of 5% at least. The results are achieved with shallow graph neural networks by following the considerations discussed in the paper.
翻译:在水分配系统(WDS)的每个节点随时了解压力有助于安全和高效地运行。然而,由于实际的WDS中仪器数量有限,无法收集完整的测量数据。通过只观测有限节点来重建所有节点压力的数据驱动方法在文件中作了介绍。重建方法以K-本地化光谱图过滤器为基础,在水网每个节点上可以使用图解组合。讨论在内核应用的层数、层深度和Chebyshev-poynomial程度的影响时,考虑到应用的特殊性。此外,还演示了加权方法,其中关于摩擦损失的信息可以通过相邻矩阵嵌入光谱图过滤器。拟议模型的性能以3个节点为基础,与节点总数不同。加权连接对二进点连接没有益处,但拟议的模型将节点压力以最多5%的相对误差来重建,在平均观测5 %,在观测过程中,通过浅色观察网络至少得出了5 % 。