IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v274y2016icp711-725.html
   My bibliography  Save this article

Dynamic optimization for robust path planning of horizontal oil wells

Author

Listed:
  • Gong, Zhaohua
  • Loxton, Ryan
  • Yu, Changjun
  • Teo, Kok Lay

Abstract

This paper considers the three-dimensional path planning problem for horizontal oil wells. The decision variables in this problem are the curvature, tool-face angle and switching points for each turn segment in the path, and the optimization objective is to minimize the path length and target error. The optimal curvatures, tool-face angles and switching points can be readily determined using existing gradient-based dynamic optimization techniques. However, in a real drilling process, the actual curvatures and tool-face angles will inevitably deviate from the planned optimal values, thus causing an unexpected increase in the target error. This is a critical challenge that must be overcome for successful practical implementation. Accordingly, this paper introduces a sensitivity function that measures the rate of change in the target error with respect to the curvature and tool-face angle of each turn segment. Based on the sensitivity function, we propose a new optimization problem in which the switching points are adjusted to minimize target error sensitivity subject to continuous state inequality constraints arising from engineering specifications, and an additional constraint specifying the maximum allowable increase in the path length from the optimal value. Our main result shows that the sensitivity function can be evaluated by solving a set of auxiliary dynamic systems. By combining this result with the well-known time-scaling transformation, we obtain an equivalent transformed problem that can be solved using standard nonlinear programming algorithms. Finally, the paper concludes with a numerical example involving a practical path planning problem for a Ci-16-Cp146 well.

Suggested Citation

  • Gong, Zhaohua & Loxton, Ryan & Yu, Changjun & Teo, Kok Lay, 2016. "Dynamic optimization for robust path planning of horizontal oil wells," Applied Mathematics and Computation, Elsevier, vol. 274(C), pages 711-725.
  • Handle: RePEc:eee:apmaco:v:274:y:2016:i:c:p:711-725
    DOI: 10.1016/j.amc.2015.11.038
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315015283
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2015.11.038?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:274:y:2016:i:c:p:711-725. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.