scispace - formally typeset
Search or ask a question

Showing papers by "P.M.J. Van den Hof published in 2016"


Proceedings ArticleDOI
29 Aug 2016
TL;DR: This work compares various clustering techniques to select a limited number of representative members from an ensemble of reservoir models and tests the effectiveness of different dissimilarity measures such as distance in parameter space, distance in terms of flow patterns and distance in optimal sets of controls.
Abstract: Closed-loop reservoir management (CLRM) is a combination of life-cycle optimization and computer-assisted history matching. The application of the CLRM framework to real field cases can be computationally demanding. An even higher computational load results from procedures to assess the value of information (VOI) in CLRM. Such procedures, which are performed prior to field operation, i.e. during the field development planning (FDP) phase, require extreme amounts of simulations. Therefore, we look for alternatives to reduce this computational cost. In particular we compare various clustering techniques to select a limited number of representative members from an ensemble of reservoir models. Using K-means clustering, multi-dimensional scaling and tensor decomposition techniques, we test the effectiveness of different dissimilarity measures such as distance in parameter space, distance in terms of flow patterns and distance in optimal sets of controls. As a first step towards large-scale application we apply several of these measures to a VOI-CLRM exercise using a simple 2D reservoir model which results in a reduction of the necessary number of forward reservoir simulations from millions to thousands.

6 citations


01 Jan 2016
TL;DR: In this paper it is shown that there is considerable freedom as to which variables can be included as inputs to the predictor, while still obtaining consistent estimates of the particular module of interest.
Abstract: This paper addresses the problem of obtaining an estimate of a particular module of interest that is embedded in a dynamic network with known interconnection structure. In this paper it is shown that there is considerable freedom as to which variables can be included as inputs to the predictor, while still obtaining consistent estimates of the particular module of interest. This freedom is encoded into sufficient conditions on the set of predictor inputs that allow for consistent identification of the module. The conditions can be used to design a sensor placement scheme, or to determine whether it is possible to obtain consistent estimates while refraining from measuring particular variables in the network. As identification methods the Direct and Two Stage Prediction-Error methods are considered. Algorithms are presented for checking the conditions using tools from graph theory.

5 citations