邻井间最近距离扫描的快速算法  

Fast Algorithm for Scanning the Nearest Distance Among Adjacent Wells

作　　者：鲁港[1] 常汉章[1] 邢玉德[2] 赵辉[3] 吴俊林[2] 

机构地区：[1]辽河油田分公司勘探开发研究院,辽宁盘锦124010 [2]辽河石油勘探局工程技术研究院,辽宁盘锦124010 [3]辽河石油勘探局华油实业公司,辽宁盘锦124010

出　　处：《石油钻探技术》2007年第3期23-26,共4页Petroleum Drilling Techniques

摘　　要：在钻井轨道设计、井间防碰计算、实钻轨迹监控等问题中,邻井之间的最近距离计算有很重要的意义。目前最近距离扫描算法使用迭代法来计算最近距离点,计算量较大,迭代算法的收敛性对扫描算法的整体性能有较大的影响。推导了点到线段和圆弧最近距离点的解析计算公式,使用该公式替换常规扫描算法中的迭代计算过程,得到了一个快速扫描算法,该算法的总计算量一般比常规算法低一个数量级,并且有非常好的收敛性能。该快速扫描算法只适用于井段曲线为直线段和圆弧的情形。Calculation of the nearest distance among adjacent wells is very important in drilling trajectory design, interwell anti-collision calculation, and actual wellbore trajectory control. Currently, the iterative method is used to calculate the nearest points in scanning the nearest distance, which requires a large amount of calculation. The convergence of iterative algorithm has a big impact on the integrity of scanning algorithm. This paper derived an analytic formula to calculate the nearest point between a point to a line segment and an arc. Using this equation to replace the iterative procedure in the conventional scanning method, a new quicker scanning method was obtained. The calculation of this method is less than that in conventional by one magnitude. This method has a very good convergence property. This fast scanning algorithm is only suitable for line or arc trajectories.

关 键 词：井眼轨迹 距离 扫描 计算方法 钻井 

分 类 号：TE22[石油与天然气工程—油气井工程]