Dynamic optimization for robust path planning of horizontal oil wells

Dynamic optimization for robust path planning of horizontal oil wells

0.00 Avg rating0 Votes
Article ID: iaor201530798
Volume: 274
Start Page Number: 711
End Page Number: 725
Publication Date: Feb 2016
Journal: Applied Mathematics and Computation
Authors: , , ,
Keywords: programming: critical path, combinatorial optimization, petroleum, programming: dynamic, planning, networks: path, simulation, heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.