Abstract

Abstract This work discusses a closed-loop approach for efficient real-time production optimization that consists of three key elements – adjoint models for efficient parameter and control gradient calculation, polynomial chaos expansions for efficient uncertainty propagation, and Karhunen-Loeve (K-L) expansions and Bayesian inversion theory for efficient real-time model updating (history-matching). The control gradients provided by the adjoint solution are used by a gradient-based optimization algorithm to determine optimal control settings, while the parameter gradients are used for model updating. Polynomial chaos expansions provide optimal encapsulation of information contained in the input random fields and output random variables. This approach allows the forward model to be used as a black box but is much faster than standard Monte Carlo techniques. The K-L representation allows for the direct application of adjoint techniques for history matching while assuring that the two-point geostatistics of the reservoir description are maintained. The benefits and efficiency of the overall closed-loop approach are demonstrated through real-time optimizations of net present value (NPV) for synthetic reservoirs under waterflood subject to production constraints and uncertain reservoir description. The closed-loop procedure is shown to provide a substantial improvement in NPV over the base case, and the results are seen to be very close to those obtained when the reservoir description is known apriori.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.