Show simple item record

dc.contributor.authorGong, Z.
dc.contributor.authorLoxton, Ryan
dc.contributor.authorYu, Changjun
dc.contributor.authorTeo, Kok Lay
dc.date.accessioned2017-01-30T11:30:30Z
dc.date.available2017-01-30T11:30:30Z
dc.date.created2016-02-03T19:30:17Z
dc.date.issued2016
dc.identifier.citationGong, Z. and Loxton, R. and Yu, C. and Teo, K.L. 2016. Dynamic optimization for robust path planning of horizontal oil wells. Applied Mathematics and Computation. 274: pp. 711-725.
dc.identifier.urihttp://hdl.handle.net/20.500.11937/12397
dc.identifier.doi10.1016/j.amc.2015.11.038
dc.description.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.

dc.titleDynamic optimization for robust path planning of horizontal oil wells
dc.typeJournal Article
dcterms.source.volume274
dcterms.source.startPage711
dcterms.source.endPage725
dcterms.source.issn0096-3003
dcterms.source.titleApplied Mathematics and Computation
curtin.departmentDepartment of Mathematics and Statistics
curtin.accessStatusOpen access


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record