Using Particle Swarm Optimization to Compute Hundreds of Possible Directional Paths to Get Back/Stay in the Drilling Window

Abstract

One of the responsibilities of a directional driller (DD) is the computation of the current bit position given the last survey station measurement, and with that information calculate the path back to plan if directional correction is needed. Having only a few minutes during a drilling connection to perform these calculations, the DD is limited to compute only a handful of possible paths that will be presented to the Drilling Engineer/Company Man. With this information, the Company Man will decide which path to follow. The present work aims to develop a computer algorithm that replicates the field knowledge of DDs but can compute hundreds of paths in less than one minute. In addition, since the objective of the trajectory correction may differ, the algorithm also can optimize for one of three goals: maximum rate of penetration (ROP), minimum tortuosity in the path, or maximum footage in the drilling target window. The paper presents examples of four different path recommendations in the lateral portion of a horizontal well. The results show the optimum recommended paths for the same position for a specific optimization goal. Finally, a comparison between the running time and number of paths computed is presented. All results were obtained during the validation tests of the algorithm.