Optimal Sequential Decision-Making in Geosteering: A Reinforcement Learning Approach
Ressi Bonti Muhammad, Sergey Alyaev, Reidar Brumer Bratvold
TL;DR
This work formulates geosteering as a sequential decision-making problem and applies model-free reinforcement learning via Deep Q-Networks to optimize decisions. Across two synthetic, previously studied geosteering scenarios, RL achieves near-quasi-optimal performance relative to approximate dynamic programming while delivering substantial computational savings for online decision support. The study demonstrates two RL variants: RL-Posterior (Bayesian-informed state) and RL-Sensor (sensor-based state), with RL-Sensor offering a favorable balance of performance and speed. The findings suggest RL can flexiblely adapt to more complex, data-rich geosteering environments and potentially extend to real-data training, enabling scalable, real-time decision support in subsurface operations.
Abstract
Trajectory adjustment decisions throughout the drilling process, called geosteering, affect subsequent choices and information gathering, thus resulting in a coupled sequential decision problem. Previous works on applying decision optimization methods in geosteering rely on greedy optimization or approximate dynamic programming (ADP). Either decision optimization method requires explicit uncertainty and objective function models, making developing decision optimization methods for complex and realistic geosteering environments challenging to impossible. We use the Deep Q-Network (DQN) method, a model-free reinforcement learning (RL) method that learns directly from the decision environment, to optimize geosteering decisions. The expensive computations for RL are handled during the offline training stage. Evaluating DQN needed for real-time decision support takes milliseconds and is faster than the traditional alternatives. Moreover, for two previously published synthetic geosteering scenarios, our results show that RL achieves high-quality outcomes comparable to the quasi-optimal ADP. Yet, the model-free nature of RL means that by replacing the training environment, we can extend it to problems where the solution to ADP is prohibitively expensive to compute. This flexibility will allow applying it to more complex environments and make hybrid versions trained with real data in the future.
