首页|一种稳健的水力压裂裂缝平面识别算法

一种稳健的水力压裂裂缝平面识别算法

扫码查看
原文链接
  • 万方数据
  • 维普
提出一种稳健的水力压裂裂缝平面识别算法——抽样投影算法(RANSAC-MP),通过随机抽样方法弱化无关破裂事件导致的离群噪声,并提出最大投影平面拟合算法以减小环境噪声的影响,同时结合了 RANSAC 算法的抗噪性和投影方法的降维效果.以实际直井微地震数据为例进行裂缝平面拟合,结果表明:RANSAC-MP 算法在多重噪声影响下表现出更强的稳健性和更高的计算精度,当压裂仅形成单一裂缝时,该算法可以直接处理原始数据.
A Robust Plane Identification Algorithm for Hydraulic Fracture
The fracture morphology of hydraulic fracturing is a key parameter for evaluating the fracturing effect and predicting the yield.At present,the fracture information of fractured cracks is mainly extracted by microseismic monitoring at home and abroad,and it is difficult to obtain the fracture morphology through the planar identification algorithm by utilizing the microseismic data due to the existence of complex noise.For this reason,this paper proposes a robust planar identification algorithm for hydraulic fracturing cracks,the sampling projection algorithm(RANSAC-MP),which weakens the outlier noise caused by irrelevant rupture events through random sampling,and proposes a maximal projection planar fitting algorithm to minimize the influence of environmental noise,and at the same time,combines the noise resistance of the RANSAC algorithm and the advantages of the projection method with the noise resistance of the RANSAC algorithm.noise immunity and the dimension reduction effect of the projection method.The results show that the RANSAC-MP algorithm shows stronger robustness and higher computational accuracy under the influence of multiple noises,and the algorithm can directly process the original data when only a single fracture is formed by fracturing.

multiple noise effectssampling-projection(RANSAC-MP)fracture identificationhydraulic fracturingmicroseismic data pointsrobustness

林子愉、刘月田、裴雪皓、樊平天、薛亮

展开 >

中国石油大学(北京)石油工程学院,北京 102249

延长油田股份有限公司南泥湾采油厂,陕西 延安 716000

多重噪声影响 抽样投影(RANSAC-MP) 裂缝平面识别 水力压裂 微地震数据点 稳健性

国家自然科学基金北京市自然科学基金陕西省技术创新引导专项计划项目中国石油科技创新基金项目

5227404832220372023-YD-CGZH-022020D-5007-0203

2024

10.19596/j.cnki.1001-246x.8773

计算物理
中国核学会

计算物理

CSTPCD北大核心
影响因子：0.366
ISSN：1001-246X
年,卷(期)：2024.41(5)