Exploiting structural observability and graph colorability for optimal sensor placement in water distribution networks
Water distribution networks (WDNs) are critical systems for our society and detecting leakages is important for minimizing losses and water waste. This makes optimal sensor placement for leakage detection very relevant. Existing sensor placement methods rely on simulation-based scenarios, often lacking structure and generalizability, or depend on the knowledge of specific parameters of the WDN as well as on initial sensor data for linearization and demand estimation. Motivated by this, this paper investigates the observability of an entire WDN, based on structural observability theory. This allows us to establish the conditions for the observability of the WDN model, independently of parameter uncertainties and without the need for initial sensor data. Additionally, a sensor placement algorithm is proposed, that leverages such observability conditions and graph theory and accounts for the industrial and material costs. To demonstrate the effectiveness of our approach, we apply it to a hydraulic-transient WDN model.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Functional Observability, Structural Functional Observability and Optimal Sensor Placement
In this paper, new characterizations for functional observability, functional detectability, and structural functional observability (SFO) are developed, and based on them, the related optimal sensor placement problems a…
Eidolon: A Post-Quantum Signature Scheme Based on k-Colorability in the Age of Graph Neural Networks
We propose Eidolon, a post-quantum signature scheme grounded on the NP-complete k-colorability problem. Our construction generalizes the Goldreich-Micali-Wigderson zero-knowledge protocol to arbitrary k >= 3, applies the…
Graph Neural NetworkRecovering the Structural Observability of Composite Networks via Cartesian Product
Observability is a fundamental concept in system inference and estimation. This paper is focused on structural observability analysis of Cartesian product networks. Cartesian product networks emerge in variety of applica…
Polynomial-Time Algorithms for Structurally Observable Graphs by Controlling Minimal Vertices
The aim of this paper is to characterize an important class of marked digraphs, called structurally observable graphs (SOGs), and to solve two minimum realization problems. To begin with, by exploring structural observab…
A Note on Structural Controllability and Observability Indices
In this note, we investigate the structural controllability and observability indices of structured systems. We provide counter-examples showing that an existing graph-theoretic characterization for the structural contro…