A method, system, processing device and storage medium for matching key points of a well section and sub-layers of a thin reservoir

CN122923116APending Publication Date: 2026-10-16CHINA NATIONAL OFFSHORE OIL (CHINA) CO LTD +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202611091563.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-07-22
Publication Date
2026-10-16

AI Technical Summary

Technical Problem

这种方法的缺点是:1、匹配精度低,均匀加密无法保证细分层与薄储层有效厚度段内的井段关键点精确对齐;2、多井协调困难,当多口井的薄储层分布不一致时,均匀加密无法同时满足所有井的匹配需求;3、适应性差,均匀分布无法适应薄储层在层内的非均匀分布特征

Benefits of technology

1、本发明通过动态规划全局优化,确保细分层位置与井段关键点的整体误差最小,避免局部最优问题,特别适用于薄储层中多个薄砂层的精确刻画。

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN122923116A_ABST
    Figure CN122923116A_ABST
Patent Text Reader

Abstract

The present application relates to a kind of well section key point and the matching method, system, processing device and storage medium of thin reservoir-oriented subdivision layer, the method includes: the intersection point of each well well track and each formation in it is calculated, the entry point and exit point of each well well track in each formation are obtained;The entry point and exit point between the well section key point set of each well well track in each formation and the maximum well section key point quantity are counted, determine the number of subdivision layer that current formation needs to add;The well section key point of each well is converted into the proportional value relative to the entry point of each formation in well track, determine proportional set;Determine the proportional position set of subdivision layer in current formation;Each proportional value in proportional set is respectively corresponded to the corresponding proportional position in proportional position set, so that the sum of error absolute value after correspondence is minimum, obtain optimal matching path, the present application can be widely applied in oil and gas reservoir geological modeling and grid subdivision technical field.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of oil and gas reservoir geological modeling and grid partitioning technology, and in particular to a method, system, processing equipment and storage medium for matching key points and subdivided layers in well sections for thin reservoirs. Background Technology

[0002] Thin reservoirs are characterized by their small thickness, rapid spatial distribution, and strong heterogeneity, making it difficult for traditional uniform grid subdivision methods to achieve accurate vertical characterization. To accurately depict the spatial distribution characteristics of thin reservoirs, vertical grid refinement is necessary within the effective thickness range. This involves inserting subdivided layers between the original geological strata, ensuring that the refined grid accurately reflects the thickness variations and attribute distribution characteristics of the thin reservoir. However, thin reservoirs often exhibit as multiple thin interbedded layers vertically, with the effective thickness range distributed extremely unevenly within the layer. Determining the number of subdivided layers and their proportional positions within the layer, and accurately corresponding them to key points in the effective thickness range of thin reservoirs across multiple wells, is a critical issue that urgently needs to be addressed in the refined modeling of thin reservoirs. This problem becomes even more complex when the distribution of thin reservoirs in multiple wells is inconsistent (e.g., some wells develop multiple layers of thin sand bodies, while others develop only a single layer).

[0003] In existing technologies, uniform consolidation is typically performed within the effective thickness range of the formation, i.e., a fixed number of subdivided layers are uniformly inserted between the original formations. The number of subdivided layers is usually determined empirically, and their positions are distributed proportionally. The disadvantages of this method are: 1. Low matching accuracy: uniform consolidation cannot guarantee precise alignment between the subdivided layers and key points within the effective thickness range of the thin reservoir; 2. Difficulty in coordinating multiple wells: when the distribution of thin reservoirs in multiple wells is inconsistent, uniform consolidation cannot simultaneously meet the matching requirements of all wells; 3. Poor adaptability: uniform distribution cannot adapt to the non-uniform distribution characteristics of thin reservoirs within the formation.

[0004] In existing technologies, some methods still employ a nearest neighbor matching strategy, matching key points within each thin reservoir section to the nearest sub-layer location. The disadvantages of this method are: 1. Nearest neighbor matching may lead to multiple key points matching the same sub-layer, resulting in the loss of internal structural information of the thin reservoir; 2. It only considers local optima rather than global optima; 3. When the number of sub-layers is less than the number of key points in the well section, the matching results are unstable. Summary of the Invention

[0005] To address the aforementioned problems, the purpose of this invention is to provide a matching method, system, processing equipment, and storage medium for key points and subdivided layers in thin reservoir sections, which offers high matching accuracy, good adaptability, stable matching results, considers global optimization, and can simultaneously meet the matching requirements of all wells.

[0006] To achieve the above objectives, the present invention adopts the following technical solution: Firstly, it provides a method for matching key points and subdivided layers in well sections oriented towards thin reservoirs, comprising: Traverse the stratigraphic framework, calculate the intersection of the well trajectory of each well with each stratigraphic layer within it, and obtain the entry and exit points of the well trajectory of each well in each stratigraphic layer; Statistically analyze the set of key points in the well trajectory between the entry and exit points of each formation and the maximum number of key points in the well section to determine the number of sub-layers that need to be added to the current formation. The key points of each well section are converted into proportional values ​​relative to the well trajectory entry point in each formation, and the proportional set is determined based on the maximum number of key points in the well section. Based on the number of subdivision layers that need to be added to the current stratum, determine the set of proportional locations of the subdivision layers in the current stratum; A dynamic programming algorithm is used to map each ratio value in the ratio set to the corresponding ratio position in the ratio position set, so as to minimize the sum of the absolute values ​​of the errors after mapping, thereby obtaining the optimal matching path and completing the matching of key points of well sections and subdivision layers for each well.

[0007] Furthermore, for each well, the intersection points of the well trajectory with the upper and lower layers of the current formation are calculated, which serve as the entry and exit points of the well trajectory in the current formation.

[0008] Furthermore, the method of statistically analyzing the set of key points in the well trajectory between the entry and exit points of each formation and the maximum number of key points in the well segment, and determining the number of subdivisions to be added to the current formation, includes: Traverse the formation framework and count the set of key points of each well trajectory between the entry and exit points of each formation. The set of key points of each well segment includes the top and bottom interfaces of the effective thickness of the thin reservoir in the formation, the abrupt change points of the internal properties of the thin reservoir, and other feature points specified by the user. Suppose that the current critical layer has Koujing, No. Thin reservoir intervals in the well include If there are key points in a well section, then the set of key points in all well sections is: ,in, For well Key points of the well section; The maximum number of key points in a well section within the set of key point counts. The number of sub-layers that need to be added to the current critical layer. .

[0009] Furthermore, the set of proportions , No. The proportion of key points in each well section for: ; in, ,and Arranged in ascending order; Key points of the well section The vertical depth; The vertical depth of the well trajectory at the entry point in the formation; The vertical depth of the well trajectory's exit point in the formation; The set of proportional locations of the subdivisions in the current strata ,in, For subdivision of layers The proportional position within the current strata.

[0010] Furthermore, the dynamic programming algorithm is used to map each ratio value in the ratio set to a ratio position set. The optimal matching path is obtained by determining the corresponding proportional positions in the matrix to minimize the sum of the absolute values ​​of the corresponding errors, including: Define state ,in, and These represent the number of elements in the proportion set and the number of elements in the proportion position set, respectively. Indicates the first part of the proportional set Each element matches the first element of the proportional position set. The minimum distance sum that can be obtained when there are n elements must satisfy the following condition: ; Based on the defined states, establish the state transition equations; Set boundary conditions; For each state Record the preceding state when it achieves the minimum distance; Based on the established state transition equation and the set boundary conditions, starting from the final state, backtracking is performed along the recorded predecessor states. A depth-first search is used to traverse all predecessor states to obtain an optimal matching path.

[0011] Furthermore, the state transition equation is: ; in, Indicates that the current scale position is not selected. That is, skipping the set of proportional positions The first in After each element, the proportion set will still be used. The former Each element matches the set of proportional positions. The former The minimum distance that can be obtained when there are n elements is called the skip cost; Indicates selecting the current scale position. and will and The minimum sum of distances obtained when establishing a matching relationship is called the matching cost; Represents the set of proportions The former Set of elements and proportional positions The former The minimum distance sum required for optimal matching of elements This indicates the distance generated by the current match.

[0012] Furthermore, the above refers to each state. Record the preceding state when it achieves the minimum distance, including: If the cost of skipping is less than the cost of matching, then record it. for The predecessor state indicates that the current state is skipped. This operation was transferred from elsewhere; If the matching cost is less than the skipping cost, then record it. for The predecessor state indicates that the current state is determined by "matching". and This operation was transferred from elsewhere; If the skip cost equals the matching cost, it means that both operations can achieve the same minimum distance sum. In this case, record the two predecessor states simultaneously, corresponding to "skip" and "match". "and" and "Two types of transitions; the recorded predecessor states and transition operations are connected sequentially during reverse backtracking to form the predecessor path."

[0013] Secondly, a matching system for key points and subdivided layers in well sections oriented towards thin reservoirs is provided, including: The intersection calculation module is used to traverse the formation grid, calculate the intersection of the well trajectory of each well with each formation within it, and obtain the entry and exit points of the well trajectory of each well in each formation. The well section key point set construction module is used to count the set of key points of each well trajectory between the entry and exit points of each formation and the maximum number of key points in each well section, and to determine the number of subdivision layers that need to be added to the current formation. The scaling module is used to convert the key points of each well section into proportional values ​​relative to the well trajectory at the entry point of each formation, and to determine the scale set based on the maximum number of key points in the well section. The subdivision layer location definition module is used to determine the set of proportional locations of subdivision layers in the current stratum based on the number of subdivision layers that need to be added to the current stratum. The dynamic programming matching module uses a dynamic programming algorithm to map each ratio value in the ratio set to the corresponding ratio position in the ratio position set, minimizing the sum of the absolute values ​​of the errors after mapping, thus obtaining the optimal matching path and completing the matching of key points of each well section with subdivided layers.

[0014] Thirdly, a processing device is provided, including a computer program, wherein when the computer program is executed by the processing device, it is used to implement the steps corresponding to the above-mentioned matching method between key points of well sections and subdivided layers for thin reservoirs.

[0015] Fourthly, a computer-readable storage medium is provided, on which a computer program is stored, wherein the computer program, when executed by a processor, is used to implement the steps corresponding to the above-described matching method for key points of well sections and subdivided layers in thin reservoirs.

[0016] The present invention has the following advantages due to the adoption of the above technical solutions: 1. This invention uses dynamic programming for global optimization to ensure that the overall error between the subdivided layer location and the key points of the well section is minimized, avoiding the problem of local optima. It is particularly suitable for the accurate characterization of multiple thin sand layers in thin reservoirs.

[0017] 2. The subdivision ratio position of the present invention can be any value, not limited to uniform distribution, and supports a variety of setting strategies, which can adapt to complex situations such as non-uniform distribution of thin reservoirs within the layer and concentrated distribution in multiple segments.

[0018] 3. This invention records all equivalent cost matching paths, which facilitates the selection of the best solution in subsequent geological constraints such as stratigraphic continuity and thin reservoir pinch-out relationship.

[0019] 4. The matching process of this invention maintains sequential consistency, ensuring that the vertical sequence of the subdivided layers is consistent with the actual sequence of the thin reservoir.

[0020] 5. This invention is applicable to the matching of key points and subdivided layers in any number of well sections, supports situations where the development degree of thin reservoirs is inconsistent in different well sections, and is compatible with various thin reservoir distribution patterns.

[0021] In summary, this invention can be widely applied in the field of oil and gas reservoir geological modeling and mesh generation technology. Attached Figure Description

[0022] Various other advantages and benefits will become apparent to those skilled in the art upon reading the following detailed description of preferred embodiments. The accompanying drawings are for illustrative purposes only and are not intended to limit the invention. Throughout the drawings, the same reference numerals denote the same parts. In the drawings: Figure 1 This is a schematic diagram of a method flow provided in an embodiment of the present invention; Figure 2 This is a schematic diagram of the scaled processing of key points in a well section provided in an embodiment of the present invention; Figure 3 This is a schematic diagram of a dynamic programming matching process provided in an embodiment of the present invention; Figure 4 This is a schematic diagram of the multi-path backtracking results provided in an embodiment of the present invention; Figure 5 This is a schematic diagram of a key point example of a well section provided in an embodiment of the present invention; Figure 6 This is a schematic diagram illustrating an example of how the subdivided layers and key points of the well section correspond to each other, according to an embodiment of the present invention. Detailed Implementation

[0023] Exemplary embodiments of the invention will now be described in more detail with reference to the accompanying drawings. While exemplary embodiments of the invention are shown in the drawings, it should be understood that the invention can be implemented in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided to enable a more thorough understanding of the invention and to fully convey the scope of the invention to those skilled in the art.

[0024] It should be understood that the terminology used herein is for the purpose of describing particular exemplary embodiments only and is not intended to be limiting. Unless the context clearly indicates otherwise, the singular forms “a,” “an,” and “described” as used herein may also include the plural forms. The terms “comprising,” “including,” “containing,” and “having” are inclusive and therefore indicate the presence of the stated features, steps, operations, elements, and / or components, but do not exclude the presence or addition of one or more other features, steps, operations, elements, components, and / or combinations thereof. The method steps, processes, and operations described herein are not construed as requiring them to be performed in a particular order described or illustrated unless the order of performance is explicitly indicated. It should also be understood that additional or alternative steps may be used.

[0025] Although terms such as first, second, third, etc., may be used in this document to describe multiple elements, components, regions, layers, and / or segments, these elements, components, regions, layers, and / or segments should not be limited by these terms. These terms may be used only to distinguish one element, component, region, layer, or segment from another. Unless the context clearly indicates otherwise, terms such as "first," "second," and other numerical terms used herein do not imply order or sequence. Therefore, the first element, component, region, layer, or segment discussed below may be referred to as the second element, component, region, layer, or segment without departing from the teachings of the exemplary embodiments.

[0026] Currently, the existing matching methods for key points and subdivisions in well sections have the following problems: 1) Nearest neighbor matching may cause multiple key points to be matched to the same subdivision, resulting in the loss of internal structural information of thin reservoirs; 3) Only local optima are considered instead of global optima; 4) When the number of subdivisions is less than the number of key points in the well section, the matching results are unstable. Therefore, this invention provides a method for matching key points of well sections with subdivided layers in thin reservoirs, including: traversing the formation grid, calculating the intersection points of the well trajectory of each well with each formation within it, obtaining the entry and exit points of the well trajectory in each formation; statistically analyzing the set of key points of well sections between the entry and exit points of the well trajectory in each formation and the maximum number of key points in each well section, determining the number of subdivided layers to be added to the current formation; converting the key points of each well section into proportional values ​​relative to the entry point of the well trajectory in each formation, and determining the proportion set based on the maximum number of key points in each well section; determining the proportion position set of subdivided layers in the current formation based on the number of subdivided layers to be added to the current formation; using a dynamic programming algorithm, mapping each proportion value in the proportion set to the corresponding proportion position in the proportion position set, minimizing the sum of the absolute values ​​of the errors after mapping, obtaining the optimal matching path, and completing the matching of key points of well sections with subdivided layers for each well. This invention achieves the best correspondence between key points of well sections and subdivided layers in thin reservoirs through global optimization, ensuring that the densified grid can accurately reflect the distribution characteristics of the effective thickness segment of the thin reservoir.

[0027] Correspondingly, other embodiments of the present invention provide a matching system, processing equipment, and storage medium for key points and subdivided layers in well sections oriented towards thin reservoirs.

[0028] Example 1 like Figure 1 As shown in the figure, this embodiment provides a method for matching key points and subdivided layers in well sections for thin reservoirs, including the following steps: 1) Traverse the stratigraphic grid, calculate the intersection of the well trajectory of each well with each stratigraphic layer within it, and obtain the entry and exit points of the well trajectory of each well in each stratigraphic layer.

[0029] Specifically, for each well, the intersection points of the well trajectory with the upper and lower layers of the current formation are calculated, which are used as the entry and exit points of the well trajectory in the current formation.

[0030] 2) Calculate the set of key points in the well trajectory between the entry and exit points of each formation and the maximum number of key points in the well interval to determine the number of sub-layers to be added to the current formation. Specifically: 2.1) Traverse the stratigraphic framework and count the set of key points of each well trajectory between the entry and exit points of each formation. Among them, the set of key points in the well section This includes the top and bottom interfaces of the effective thickness of thin reservoirs in the formation, abrupt change points in the internal properties of thin reservoirs, and other feature points specified by the user.

[0031] 2.2) Assume that there are in the current stratum Koujing, No. Wells within the current formation include If there are key points in a well section, then the set of key points in all well sections is: ,in, For well Key points of the well section.

[0032] 2.3) Count the maximum number of key points in a well section within the set of key points in the statistical well section. The number of subdivisions that need to be added to the current stratum. .

[0033] 3) Convert the key points of each well section into proportional values ​​relative to the well trajectory's entry point in each formation, and determine the proportional set based on the maximum number of key points in the well section. .

[0034] Specifically, such as Figure 2 As shown, the vertical depth of the well trajectory at the entry point in the formation is . The vertical depth of the well trajectory at the formation exit point is Then the first The proportion of key points in each well section relative to the well trajectory entry point in each formation. for: (1) in, ,and Arranged in ascending order; Key points of the well section The vertical depth. For well sections with fewer key points than the maximum number of key points in a given well section. For well sections, missing values ​​are filled with empty values, which are not included in the calculation during matching.

[0035] 4) Based on the number of subdivision layers that need to be added to the current stratum, determine the set of proportional locations of the subdivision layers in the current stratum. ,in, For subdivision of layers The proportional position within the current strata.

[0036] Specifically, the set of proportions of subdivisions within the current stratum. The determination method can be any of the following: ① Uniform distribution pattern: ,in, For subdivision layer numbering, For subdivision of layers The proportional location within the current stratum applies to situations where there is no prior information.

[0037] ② User-defined mode: Users specify a specific set of locations based on their geological experience.

[0038] ③ Adaptive statistical mode: Analyze the proportional distribution of key points in all thin reservoir well sections and automatically generate a set of proportional locations using the quantile method. .

[0039] ④ Interactive Adjustment Mode: In the graphical interface, users drag and drop to adjust the position of sub-layers. The system calculates and displays the matching error in real time, resulting in a set of proportional positions. .

[0040] 5) such as Figure 3 As shown, a dynamic programming algorithm is used to transform the proportion set. Each ratio value in the set corresponds to a ratio position. The optimal matching path is obtained by determining the corresponding proportional positions in the matrix to minimize the sum of the absolute values ​​of the corresponding errors. Specifically: 5.1) Define the state ,in, and Representing the sets of proportions respectively The set of number and proportion of elements in the middle Number of elements in the middle Indicates the proportion set The former Each element matches the set of proportional positions. The former The minimum distance sum that can be obtained when there are n elements must satisfy the following condition: .

[0041] Specifically, or The states are only auxiliary boundary states in the dynamic programming table and do not correspond to the scale set. or proportional position set The actual elements in the formula are used to initialize and ensure that the state transition formula holds true at the boundaries. The actual elements involved in the matching are... and , respectively representing the set of proportions The first in A set of elements and proportional positions The first in Each element.

[0042] 5.2) Based on the defined state Establish the state transition equation: (2) in, Indicates that the current scale position is not selected. That is, skipping the set of proportional positions The first in After each element, the proportion set will still be used. The former Each element matches the set of proportional positions. The former The minimum distance that can be obtained when there are n elements is called the skip cost. Indicates selecting the current scale position. and will and The minimum sum of distances obtained when establishing a matching relationship is called the matching cost. Represents the set of proportions The former Set of elements and proportional positions The former The minimum distance sum required for optimal matching of elements This indicates the distance generated by the current match.

[0043] 5.3) Set boundary conditions: (3) (4) 5.4) For each state Record the predecessor state and transition operation corresponding to the minimum distance and the corresponding time, which will be used for subsequent reverse backtracking to generate a matching path.

[0044] Specifically, if the skipping cost is less than the matching cost, then record it. for The predecessor state indicates that the current state is skipped. This operation is derived from the previous one. If the matching cost is less than the skipping cost, then record it. for The predecessor state indicates that the current state is determined by "matching". and This operation is derived from the previous one. If the skip cost equals the matching cost, it means that both of the above operations can obtain the same minimum distance sum. In this case, two predecessor states can be recorded simultaneously, corresponding to "skip" and "match". "and" and "Two types of transitions. The predecessor states and transition operations of these records are connected sequentially during reverse backtracking, thus forming the predecessor path."

[0045] 5.5) Based on the established state transition equations and the set boundary conditions, from the final state... To begin, backtrack backward along the predecessor states recorded in step 5.4 above, using a depth-first search to traverse all predecessor paths, thereby obtaining an optimal matching path.

[0046] Specifically, due to Indicates the proportion set All Each element matches the set of proportional positions. The former The minimum distance sum when there are 1 element, and the recorded predecessor states all correspond to the state transitions that achieve this minimum value. Therefore, the sum of the absolute values ​​of the errors of the matching relationships obtained by backtracking along these predecessor states is equal to the minimum distance sum. This means reaching the global minimum, thus representing the optimal matching path. If multiple predecessor states exist, a depth-first search is used to traverse all predecessor states, yielding all optimal matching paths, from which one can be selected. Ultimately, the proportion set can be... Each ratio value in the set corresponds to a ratio position. The proportional positions in the equation minimize the sum of the absolute values ​​of the corresponding errors.

[0047] Specifically, such as Figure 4 As shown, with For example, the minimum distance sum is calculated to be 0.2, indicating the existence of two optimal matching paths: Path 1 is... → , → Path 2 is → , → .

[0048] 6) After matching is completed, each subdivision layer obtains the key point data of the corresponding well section. These key points of the well section are used as the constraint conditions for constructing the subdivision layer and are used for subsequent layer interpolation calculations.

[0049] Specifically, for each well section of a formation, after matching is completed, if the sub-layers are further subdivided... Matched to key points of the well section Then, on that well, subdivided layers. The location is determined by the key points of the well section. The vertical depth is determined; for sub-layers not matched by any well segment key points, their position on the well is obtained by interpolation of adjacent matched sub-layers. The well segment key points of each sub-layer on all wells are collected to form the well point constraints for that sub-layer, which are used for subsequent layer interpolation calculations.

[0050] The following detailed embodiments illustrate the matching method of key points and subdivided layers in well sections for thin reservoirs according to the present invention: The method of this invention was applied to the actual modeling of a thin reservoir development zone. For example... Figure 5 As shown, there are 15 wells in this area. The number of key points in each well section within the effective thickness of the thin reservoir is as follows: 1 well has 8 key points, 2 wells have 7 key points, 1 well has 5 key points, 3 wells have 4 key points, 2 wells have 3 key points, 5 wells have 2 key points, and 1 well has no key points. The maximum number of key points in a single well section is also recorded. =8, therefore it is determined that 8 subdivision layers need to be added.

[0051] The subdivision of the layers is distributed uniformly. = [0.11, 0.22, 0.33, 0.44, 0.56, 0.67, 0.78, 0.89]. Dynamic programming is used to match and determine the optimal correspondence between key points in well sections and subdivision layers. The eight subdivision layers have 3, 7, 7, 7, 6, 8, 9, and 8 key point constraints for each well section, respectively.

[0052] After matching, the corresponding key points of each subdivision in the wellbore are used as constraints. Discrete Smooth Interpolation (DSI) is then used to calculate the stratigraphic level, generating smooth and continuous subdivision layers. DSI interpolation ensures that the subdivision layers pass through the constraint points with high precision, meaning the subdivision layers perfectly match the locations of the key points in the wellbore. Figure 6 As shown.

[0053] Example 2 This embodiment provides a matching system for key points and subdivided layers in well sections for thin reservoirs, including: The well section intersection calculation module is used to calculate the intersection of the effective thickness segment of the thin reservoir with the formation grid of each well, and obtain the in point and out point of each effective thickness segment of the thin reservoir in each well. The well section key point set construction module is used to traverse the formation grid, count the key point set of each thin reservoir well section between the inlet and outlet points of each well, count the maximum number of key points in the well section, and determine the number of sub-layers that need to be added to the current key layer. The scaling module is used to convert the key points of each well section into proportional values ​​relative to the well trajectory at the entry point of each formation, thus obtaining a set of proportions. The subdivision layer position definition module is used to define the set of proportional positions of subdivision layers within the current key layer; The dynamic programming matching module uses a dynamic programming algorithm to map each ratio value in the ratio set to a ratio position in the ratio position set, minimizing the sum of the absolute values ​​of the errors after mapping, thus completing the matching of key points in thin reservoir sections with subdivided layers.

[0054] The constraint construction module is used to obtain key point data of the corresponding thin reservoir well section for each sub-layer after matching is completed. These key points of the well section are used as the constraint conditions for constructing the sub-layer for subsequent layer interpolation calculation.

[0055] The system provided in this embodiment is used to execute the above-described method embodiments. For specific processes and details, please refer to the above embodiments, which will not be repeated here.

[0056] Example 3 This embodiment provides a processing device corresponding to the matching method for key points and subdivided layers of well sections for thin reservoirs provided in Embodiment 1. The processing device can be applied to client processing devices, such as mobile phones, laptops, tablets, desktop computers, etc., to execute the method of Embodiment 1.

[0057] The processing device includes a processor, a memory, a communication interface, and a bus. The processor, memory, and communication interface are connected via the bus to enable communication between them. The memory stores computer programs that can run on the processing device. When the processing device runs the computer programs, it executes the matching method for key points and subdivided layers in well sections for thin reservoirs provided in Embodiment 1.

[0058] In some implementations, the memory may be high-speed random access memory (RAM), and may also include non-volatile memory, such as at least one disk storage device.

[0059] In other implementations, the processor can be any type of general-purpose processor, such as a central processing unit (CPU) or a digital signal processor (DSP), and there is no limitation here.

[0060] Furthermore, the logical instructions in the aforementioned memory can be implemented as software functional units and sold or used as independent products, and can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0061] Those skilled in the art will understand that the structure of the above-described computing device is only a partial structure related to the present invention and does not constitute a limitation on the computing device to which the present invention is applied. A specific computing device may include more or fewer components, or combine certain components, or have different component arrangements.

[0062] Example 4 This embodiment provides a computer program product corresponding to the matching method for key points and subdivided layers of well sections for thin reservoirs provided in Embodiment 1. The computer program product may include a computer-readable storage medium on which computer-readable program instructions are loaded for executing the matching method for key points and subdivided layers of well sections for thin reservoirs described in Embodiment 1.

[0063] A computer-readable storage medium can be a tangible device that holds and stores instructions for use by an instruction execution device. A computer-readable storage medium can be, for example, but not limited to, an electrical storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any combination thereof.

[0064] The computer-readable storage medium provided in the above embodiments has a similar implementation principle and technical effect to the above method embodiments, and will not be described again here.

[0065] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by a computer program. These computer programs can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that instructions executable by the processor of the computer or other programmable data processing apparatus generate instructions for implementing the flowchart. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0066] These computer programs may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0067] These computer programs may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0068] The above embodiments are only used to illustrate the present invention. The structure, connection method and manufacturing process of each component can be varied. All equivalent transformations and improvements made on the basis of the technical solution of the present invention should not be excluded from the protection scope of the present invention.

Claims

1. A method for matching key points and subdivided layers in well sections for thin reservoirs, characterized in that, include: Traverse the stratigraphic framework, calculate the intersection of the well trajectory of each well with each stratigraphic layer within it, and obtain the entry and exit points of the well trajectory of each well in each stratigraphic layer; Statistically analyze the set of key points in the well trajectory between the entry and exit points of each formation and the maximum number of key points in the well section to determine the number of sub-layers that need to be added to the current formation. The key points of each well section are converted into proportional values ​​relative to the well trajectory entry point in each formation, and the proportional set is determined based on the maximum number of key points in the well section. Based on the number of subdivision layers that need to be added to the current stratum, determine the set of proportional locations of the subdivision layers in the current stratum; A dynamic programming algorithm is used to map each ratio value in the ratio set to the corresponding ratio position in the ratio position set, so as to minimize the sum of the absolute values ​​of the errors after mapping, thereby obtaining the optimal matching path and completing the matching of key points of well sections and subdivision layers for each well.

2. The matching method for key points and subdivided layers in well sections for thin reservoirs as described in claim 1, characterized in that, For each well, calculate the intersection points of the well trajectory with the upper and lower layers of the current formation, which are used as the entry and exit points of the well trajectory in the current formation.

3. The matching method for key points and subdivided layers in well sections for thin reservoirs as described in claim 1, characterized in that, The method involves statistically analyzing the set of key points in the well trajectory between the entry and exit points of each formation, as well as the maximum number of key points in the well segment, to determine the number of subdivisions that need to be added to the current formation, including: Traverse the formation framework and count the set of key points of each well trajectory between the entry and exit points of each formation. The set of key points of each well segment includes the top and bottom interfaces of the effective thickness of the thin reservoir in the formation, the abrupt change points of the internal properties of the thin reservoir, and other feature points specified by the user. Suppose that the current critical layer has Koujing, No. Thin reservoir intervals in the well include If there are key points in a well section, then the set of key points in all well sections is: ,in, For well Key points of the well section; The maximum number of key points in a well section within the set of key point counts. The number of sub-layers that need to be added to the current critical layer. .

4. The matching method for key points and subdivided layers in well sections for thin reservoirs as described in claim 1, characterized in that, The proportion set , No. The proportion of key points in each well section for: ; in, ,and Arranged in ascending order; Key points of the well section The vertical depth; The vertical depth of the well trajectory at the entry point in the formation; The vertical depth of the well trajectory at the exit point in the formation; The set of proportional locations of the subdivisions in the current strata ,in, For subdivision of layers The proportional position within the current strata.

5. The matching method for key points and subdivided layers in well sections for thin reservoirs as described in claim 4, characterized in that, The method employs a dynamic programming algorithm to map each ratio value in the ratio set to a ratio position set. The optimal matching path is obtained by determining the corresponding proportional positions in the matrix to minimize the sum of the absolute values ​​of the corresponding errors, including: Define state ,in, and These represent the number of elements in the proportion set and the number of elements in the proportion position set, respectively. Indicates the first part of the proportional set Each element matches the first element of the proportional position set. The minimum distance sum that can be obtained when there are n elements must satisfy the following condition: ; Based on the defined states, establish the state transition equations; Set boundary conditions; For each state Record the preceding state when it achieves the minimum distance; Based on the established state transition equation and the set boundary conditions, starting from the final state, backtracking is performed along the recorded predecessor states. A depth-first search is used to traverse all predecessor states to obtain an optimal matching path.

6. The matching method for key points and subdivided layers in well sections for thin reservoirs as described in claim 5, characterized in that, The state transition equation is: ; in, Indicates that the current scale position is not selected. That is, skipping the set of proportional positions The first in After each element, the proportion set will still be used. The former Each element matches the set of proportional positions. The former The minimum distance that can be obtained when there are n elements is called the skip cost; Indicates selecting the current scale position. and will and The minimum sum of distances obtained when establishing a matching relationship is called the matching cost; Represents the set of proportions The former Set of elements and proportional positions The former The minimum distance sum required for optimal matching of elements This indicates the distance generated by the current match.

7. The matching method for key points and subdivided layers in well sections for thin reservoirs as described in claim 6, characterized in that, The above refers to each state. Record the preceding state when it achieves the minimum distance, including: If the cost of skipping is less than the cost of matching, then record it. for The predecessor state indicates that the current state is skipped. This operation was transferred from elsewhere; If the matching cost is less than the skipping cost, then record it. for The predecessor state indicates that the current state is determined by "matching". and This operation was transferred from elsewhere; If the skip cost equals the matching cost, it means that both operations can achieve the same minimum distance sum. In this case, record the two predecessor states simultaneously, corresponding to "skip" and "match". "and" match and "Two types of transitions; the recorded predecessor states and transition operations are connected sequentially during reverse backtracking to form the predecessor path." 8. A matching system for key points and subdivided layers in well sections for thin reservoirs, characterized in that, include: The intersection calculation module is used to traverse the formation grid, calculate the intersection of the well trajectory of each well with each formation within it, and obtain the entry and exit points of the well trajectory of each well in each formation. The well section key point set construction module is used to count the set of key points of each well trajectory between the entry and exit points of each formation and the maximum number of key points in each well section, and to determine the number of subdivision layers that need to be added to the current formation. The scaling module is used to convert the key points of each well section into proportional values ​​relative to the well trajectory at the entry point of each formation, and to determine the scale set based on the maximum number of key points in the well section. The subdivision layer location definition module is used to determine the set of proportional locations of subdivision layers in the current stratum based on the number of subdivision layers that need to be added to the current stratum. The dynamic programming matching module uses a dynamic programming algorithm to map each ratio value in the ratio set to the corresponding ratio position in the ratio position set, minimizing the sum of the absolute values ​​of the errors after mapping, thus obtaining the optimal matching path and completing the matching of key points of each well section with subdivided layers.

9. A processing device, characterized in that, The system includes a computer program, wherein when executed by a processing device, the computer program is used to implement the steps corresponding to the matching method for key points of well sections and subdivided layers for thin reservoirs as described in any one of claims 1-7.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program, wherein when the computer program is executed by a processor, it is used to implement the steps corresponding to the matching method for key points of well sections and subdivided layers for thin reservoirs as described in any one of claims 1-7.