A Greedy Approach for Placement of Subsurface Aquifer Wells in an Ensemble Filtering Framework
Optimizing wells placement may help in better understanding subsurface solute transport and detecting contaminant plumes. In this work, we use the ensemble Kalman filter (EnKF) as a data assimilation tool and propose a greedy observational design algorithm to optimally select aquifer wells locations for updating the prior contaminant ensemble. The algorithm is greedy in the sense that it operates sequentially, without taking into account expected future gains. The selection criteria is based on maximizing the information gain that the EnKF carries during the update of the prior uncertainties. We test the efficiency of this algorithm in a synthetic aquifer system where a contaminant plume is set to migrate over a 30 years period across a heterogenous domain.
KeywordsGreedy Algorithm Information Gain Observation Well Forecast Ensemble Greedy Approach
- 3.Choi, H-L., How, J.P., Hansen, J.A.: Ensemble-based adaptive targeting of mobile ensor networks. In: Proceedings of the 2007 American Control Conference. ThA09.3, pp. 2393–2398 (2007)Google Scholar