Parallel Automatic History Matching Algorithm Using Reinforcement Learning
Omar S. Alolayan, Abdullah O. Alomar, John R. Williams

TL;DR
This paper introduces a reinforcement learning-based method for parallel automatic history matching in reservoir simulation, enabling multiple solutions and significant speed improvements through concurrent environment learning.
Contribution
It reformulates history matching as a Markov Decision Process, allowing reinforcement learning to find multiple solutions in parallel with deep neural networks.
Findings
Enables parallel processing of history matching tasks.
Uses reinforcement learning with neural networks for reservoir simulation.
Achieves significant speed-up in solution finding.
Abstract
Reformulating the history matching problem from a least-square mathematical optimization problem into a Markov Decision Process introduces a method in which reinforcement learning can be utilized to solve the problem. This method provides a mechanism where an artificial deep neural network agent can interact with the reservoir simulator and find multiple different solutions to the problem. Such formulation allows for solving the problem in parallel by launching multiple concurrent environments enabling the agent to learn simultaneously from all the environments at once, achieving significant speed up.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReservoir Engineering and Simulation Methods · Water resources management and optimization
MethodsSPEED: Separable Pyramidal Pooling EncodEr-Decoder for Real-Time Monocular Depth Estimation on Low-Resource Settings
