Efficient Optimization of Well-Drilling Sequence with Learned Heuristics
- Lingya Wang (Norwegian Research Centre and University of Bergen) | Dean S. Oliver (Norwegian Research Centre)
- Document ID
- Society of Petroleum Engineers
- SPE Journal
- Publication Date
- October 2019
- Document Type
- Journal Paper
- 2,111 - 2,134
- 2019.Society of Petroleum Engineers
- online learning technology, production optimization, drilling schedule, heuristic search, sequential decision making
- 2 in the last 30 days
- 111 since 2007
- Show more detail
- View rights & permissions
|SPE Member Price:||USD 5.00|
|SPE Non-Member Price:||USD 35.00|
When preparing a field-development plan, the forecast value of the development can be sensitive to the order in which the wells are drilled. Determining the optimal drilling sequence generally requires many simulation runs. In this paper, we formulate the sequential decision problem of a drilling schedule as one of finding a path in a decision tree that is most likely to generate the highest net present value (NPV). A nonparametric online-learning methodology is developed to efficiently compute the sequence of drilling wells that is optimal or near optimal. The main ideas behind the approach are that heuristics from relaxed problems can be used to estimate the maximum value of complete drilling sequences constrained to previous wells, and that multiple online-learning techniques can be used to improve the accuracy of the estimated values. The performance of various heuristic methods is studied in a model for which uncertainty in properties is neglected. The initial heuristic used in this work generates a higher estimated NPV than the actual maximum NPV. Although such a heuristic is guaranteed to find the true optimal drilling order when used in the A* informed-search algorithm method, the cost of the search can be prohibitive unless the initial heuristic is highly accurate. For the variants of heuristic search methods with weighting parameters, the results show that it might not be possible to identify parameters that can be used to find a solution quickly without sacrificing the accuracy of the estimated NPV in this drilling-sequence problem. In contrast, the online learned heuristics derived from observations from previous drilling steps are shown to outperform the other variants of heuristic methods in terms of running time, accuracy of the estimated value, and solution quality. Multilearned heuristic search (MLHS) with space reduction (MLHS-SR) is an efficient and fast method to find a solution with high value. Continuing the search with space restoration is guaranteed to improve the solution quality or find the same solution as the MLHS without any space reduction.
|File Size||1 MB||Number of Pages||24|
Aine, S., Swaminathan, S., Narayanan, V. et al. 2016.Multi-Heuristic A*. Int J Rob Res 35 (1–3): 224–243. https://doi.org/10.1177%2F0278364915594029.
Beckner, B. L. and Song, X. 1995. Field Development Planning Using Simulated Annealing—Optimal Economic Well Scheduling and Placement. Presented at the SPE Annual Technical Conference and Exhibition, Dallas, 22–25 October. SPE-30650-MS. https://doi.org/10.2118/30650-MS.
Chen, J., Holte, R. C., Zilles, S. et al. 2017. Front-to-End Bidirectional Heuristic Search With Near-Optimal Node Expansions. Proc., Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI-17), Melbourne, Australia, 19–25 August, 489–495.
Chen, Y., Oliver, D. S., and Zhang, D. 2009. Efficient Ensemble-Based Closed-Loop Production Optimization. SPE J. 14 (4): 634–645. SPE-112873-PA. https://doi.org/10.2118/112873-PA.
Dechter, R. and Pearl, J. 1985. Generalized Best-First Search Strategies and the Optimality of A*. J. ACM 32 (3): 505–536. https://doi.org/10.1145/3828.3830.
Dijkstra, E. W. 1959. A Note on Two Problems in Connexion With Graphs. Numer Math (Heidelb) 1 (1): 269–271. https://doi.org/10.1007/BF01386390.
Ebend, R. and Drechsler, R. 2007. Weighted A* Search—Unifying View and Application. Artif Intell 173 (14): 1310–1342. https://doi.org/10.1016/j.artint.2009.06.004.
Fonseca, R. R.-M., Chen, B., Jansen, J. D. et al. 2017. A Stochastic Simplex Approximate Gradient (StoSAG) for Optimization Under Uncertainty. Int J Numer Methods Eng 109 (13): 1756–1776. https://doi.org/10.1002/nme.5342.
Gaspar Ravagnani, A. T. F. da S., Muñoz Mazo, E. O., and Schiozer, D. J. 2011. A Case Study of the Structure of the Process for Production Strategy Selection. Int J Model Simul Petrol Ind 4 (1): 9–15.
Hanea, R. G., Casanova, P., Hustoft, L. et al. 2017. Drill and Learn: A Decision Making Workflow to Quantify Value of Learning. Presented at the SPE Reservoir Simulation Conference, Montgomery, Texas, 20–22 February. SPE-182719-MS. https://doi.org/10.2118/182719-MS.
Hanea, R. G., Fonseca, R. M., Pettan, C. et al. 2016. Decision Maturation Using Ensemble Based Robust Optimization for Field Development Planning. Proc., ECMOR XV–15th European Conference on the Mathematics of Oil Recovery, Amsterdam, 29 August–1 September. https://doi.org/10.3997/2214-4609.201601872.
Hart, P. E., Nilsson, N. J., and Raphael, B. 1968. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Trans Syst Sci Cybern 4 (2): 100–107. https://doi.org/10.1109/TSSC.1968.300136.
Koeniga, S., Likhachev, M., and Furcy, D. 2004. Lifelong Planning A*. Artif Intell 155 (1–2): 93–146. https://doi.org/10.1016/j.artint.2003.12.001.
Lamas, L. F., Botechia, V. E., Schiozer, D. J. et al. 2017. Optimization for Drilling Schedule of Wells in the Development of Heavy Oil Reservoirs. Brazil J Petrol Gas 11 (3): 165–173. https://doi.org/10.5419/bjpg2017-0014.
Leeuwenburgh, O., Chitu, A. G., Nair, R. et al. 2016. Ensemble-Based Methods for Well Drilling Sequence and Time Optimization Under Uncertainty. Proc., ECMOR XV–15th European Conference on the Mathematics of Oil Recovery, Amsterdam, 29 August–1 September. https://doi.org/10.3997/2214-4609.201601871.
Pohl, I. 1970. Heuristic Search Viewed as Path Finding in a Graph. Artif Intell 1 (3–4): 193–204. https://doi.org/10.1016/0004-3702(70)90007-X.
Pohl, I. 1973. The Avoidance of (Relative) Catastrophe, Heuristic Competence, Genuine Dynamic Weighting and Computational Issues in Heuristic Problem Solving. Proc., 3rd International Joint Conference on Artificial Intelligence, Stanford University, Stanford, California, 20–23 August, 12–17.
Prieditis, A. E. 1993. Machine Discovery of Effective Admissible Heuristics. Mach Learn 12 (1–3): 117–141. https://doi.org/10.1007/BF00993063.
Prieditis, A. E. and Janakiraman, B. 1993. Generating Effective Admissible Heuristics by Abstraction and Reconstitution. Proc., 11th National Conference on Artificial Intelligence, Washington, DC, 11–15 July, 743–748.
Russell, S. and Norvig, P. ed. 2016. Artificial Intelligence: A Modern Approach, third edition. Harlow, UK: Prentice Hall Series in Artificial Intelligence, Pearson Education Limited.
Sayag, T., Fine, S., and Mansour, Y. et al. 2006. Combining Multiple Heuristics. Proc., STACS 2006, Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, 23–25 February, 242–253.
Silver, D. and Veness, J. 2010. Monte-Carlo Planning in Large POMDPs. Proc., NIPS’10, 23rd International Conference on Neural Information Processing Systems, Vancouver, British Columbia, Canada, 6–9 December, Vol. 2, 2164–2172.
Stentz, A. 1995. The Focussed D* Algorithm for Real-Time Replanning. Proc., IJCAI ’95, 14th International Joint Conference on Artificial Intelligence, Montreal, Canada, 20–25 August, 1652–1659.
Thayer, J. T., Dionne, A. J., and Ruml, W. 2011. Learning Inadmissible Heuristics During Search. Proc., ICAPS ’11, Twenty-First International Conference on Automated Planning and Scheduling, Freiburg, Germany, 11–16 June, 250–257.
Torrado, R. R., Rios, J., and Tesauro, G. 2017. Optimal Sequential Drilling for Hydrocarbon Field Development Planning. Proc., IAAI-17, Twenty-Ninth Conference on Innovative Applications of Artificial Intelligence, San Francisco, 6–9 February, 4734–4739.
Wilt, C. and Ruml, W. 2016. Effective Heuristics for Suboptimal Best-First Search. J Artif Intell Res 57: 273–306. https://doi.org/10.1613/jair.5036.
Yoon, S., Fern, A., and Given, R. 2006. Learning Heuristic Functions From Relaxed Plans. Proc., ICAPS ’06, Sixteenth International Conference on Automated Planning and Scheduling, Ambleside, Cumbria, UK, 6–10 June, 162–170.