18,111 research outputs found
Optimal sensor placement for classifier-based leak localization in drinking water networks
© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.This paper presents a sensor placement method for classifier-based leak localization in Water Distribution Networks. The proposed approach consists in applying a Genetic Algorithm to decide the sensors to be used by a classifier (based on the k-Nearest Neighbor approach). The sensors are placed in an optimal way maximizing the accuracy of the leak localization. The results are illustrated by means of the application to the Hanoi District Metered Area and they are compared to the ones obtained by the Exhaustive Search Algorithm. A comparison with the results of a previous optimal sensor placement method is provided as well.Postprint (author's final draft
Sensor placement for fault location identification in water networks: A minimum test cover approach
This paper focuses on the optimal sensor placement problem for the
identification of pipe failure locations in large-scale urban water systems.
The problem involves selecting the minimum number of sensors such that every
pipe failure can be uniquely localized. This problem can be viewed as a minimum
test cover (MTC) problem, which is NP-hard. We consider two approaches to
obtain approximate solutions to this problem. In the first approach, we
transform the MTC problem to a minimum set cover (MSC) problem and use the
greedy algorithm that exploits the submodularity property of the MSC problem to
compute the solution to the MTC problem. In the second approach, we develop a
new \textit{augmented greedy} algorithm for solving the MTC problem. This
approach does not require the transformation of the MTC to MSC. Our augmented
greedy algorithm provides in a significant computational improvement while
guaranteeing the same approximation ratio as the first approach. We propose
several metrics to evaluate the performance of the sensor placement designs.
Finally, we present detailed computational experiments for a number of real
water distribution networks
Optimizing Sensing: From Water to the Web
Where should we place sensors to quickly detect contamination in drinking water distribution networks? Which blogs should we read to learn about the biggest stories on the Web? Such problems are typically NP-hard in theory and extremely challenging in practice. The authors present algorithms that exploit submodularity to efficiently find provably near-optimal solutions to large, complex real-world sensing problems
Optimal sensing for fish school identification
Fish schooling implies an awareness of the swimmers for their companions. In
flow mediated environments, in addition to visual cues, pressure and shear
sensors on the fish body are critical for providing quantitative information
that assists the quantification of proximity to other swimmers. Here we examine
the distribution of sensors on the surface of an artificial swimmer so that it
can optimally identify a leading group of swimmers. We employ Bayesian
experimental design coupled with two-dimensional Navier Stokes equations for
multiple self-propelled swimmers. The follower tracks the school using
information from its own surface pressure and shear stress. We demonstrate that
the optimal sensor distribution of the follower is qualitatively similar to the
distribution of neuromasts on fish. Our results show that it is possible to
identify accurately the center of mass and even the number of the leading
swimmers using surface only information
- …