Determining non-linear petrofacies using cross-plot partitioning
10664635 ยท 2020-05-26
Assignee
Inventors
Cpc classification
International classification
Abstract
Systems and methods for determining non-linear petrofacies using cross-plot partitioning to define petrofacies boundaries that distinguish the petrofacies by appearance and/or composition using systematic and automated data analysis techniques.
Claims
1. A method for predicting hydrocarbon production from a subsurface reservoir by determining non-linear petrofacies, which comprises: partitioning a cross-plot using a data frequency of data points of properties related to petrofacies in the subsurface reservoir in the cross-plot and a computer processor; repartitioning the cross-plot by one of refining one or more partitions in the cross-plot using a data frequency of data points in an investigation window in the cross-plot and modifying the one or more partitions in the cross-plot using a sensitivity analysis of data points in a first predefined region to grow and a second predefined region to reduce to generate a repartitioned cross-plot with a grown first predefined region and a reduced second predefined region defined by the one or more partitions either or both refined and modified as part of repartitioning the cross-plot; and identifying the non-linear petrofacies of the subsurface reservoir by analyzing the repartitioned cross-plot across a plurality of regions in the repartitioned cross-plot.
2. The method of claim 1, further comprising: determining a data frequency minima and location within a YY range and a XX range of the cross-plot; computing one or more partitions within the cross-plot using the data frequency minima and each respective location; determining a data-frequency maxima and location within a YY range and a XX range of each region in the cross-plot formed by the one or more computed partitions; locating a source term for each region in the cross-plot using the data frequency maxima and each respective location; and partitioning the cross-plot using the source term for each respective region in the cross-plot.
3. The method of claim 1, further comprising: creating an inscribed matrix in the cross-plot based on defined matrix cell dimensions for the cross-plot; determining a data frequency of data points in each cell of the inscribed matrix in the cross-plot; connecting each inscribed matrix cell with a data frequency that meets a defined petrofacies partition criteria to a contiguous inscribed matrix cell with a data frequency that meets the petrofacies partition criteria; defining each petrofacies region and each petrofacies partition formed by the connected inscribed matrix cells using a unique name and index identifier; and projecting each defined petrofacies region and each defined petrofacies partition from the inscribed matrix onto the cross-plot using each respective name and index identifier as part of partitioning the cross-plot using the data frequency of the data points in the cross-plot.
4. The method of claim 3, further comprising: connecting isolated cells in the inscribed matrix with a petrofacies partition comprising the connected inscribed matrix cells by enforcing a connected cell condition value.
5. The method of claim 3, further comprising: adding isolated cells in the inscribed matrix to cells forming a petrofacies region by enforcing a connected cell condition value.
6. The method of claim 2, wherein the investigation window is created in the cross-plot using a source term for a selected region in the cross-plot as a center and predetermined dimensions.
7. The method of claim 1, further comprising refining each partition in the cross-plot that intersects the investigation window by reorienting each intersecting partition to be tangent to a side of the investigation window that the intersecting partition intersects.
8. The method of claim 1, further comprising: measuring a distance between each data point in the region to reduce and a common partition between the region to reduce and the region to grow; and normalizing each distance.
9. The method of claim 8, further comprising assigning a predetermined threshold normalized distance to each normalized distance that does not meet the predetermined threshold normalized distance.
10. A non-transitory program carrier device tangibly carrying computer-executable instructions for predicting hydrocarbon production from a subsurface reservoir by determining non-linear petrofacies, the instructions, when executed, implement: partitioning a cross-plot using a data frequency of data points of properties related to petrofacies in the subsurface reservoir in the cross-plot; repartitioning the cross-plot by one of refining one or more partitions in the cross-plot using a data frequency of data points in an investigation window in the cross-plot and modifying the one or more partitions in the cross-plot using a sensitivity analysis of data points in a first predefined region to grow and a second predefined region to reduce to generate a repartitioned cross-plot with a grown first predefined region and a reduced second predefined region defined by the one or more partitions either or both refined and modified as part of repartitioning the cross-plot; and identifying the non-linear petrofacies of the subsurface reservoir by analyzing the repartitioned cross-plot across a plurality of regions in the repartitioned cross-plot.
11. The program carrier device of claim 10, further comprising: determining a data frequency minima and location within a YY range and a XX range of the cross-plot; computing one or more partitions within the cross-plot using the data frequency minima and each respective location; determining a data-frequency maxima and location within a YY range and a XX range of each region in the cross-plot formed by the one or more computed partitions; locating a source term for each region in the cross-plot using the data frequency maxima and each respective location; and partitioning the cross-plot using the source term for each respective region in the cross-plot.
12. The program carrier device of claim 10, further comprising: creating an inscribed matrix in the cross-plot based on defined matrix cell dimensions for the cross-plot; determining a data frequency of data points in each cell of the inscribed matrix in the cross-plot; connecting each inscribed matrix cell with a data frequency that meets a defined petrofacies partition criteria to a contiguous inscribed matrix cell with a data frequency that meets the petrofacies partition criteria; defining each petrofacies region and each petrofacies partition formed by the connected inscribed matrix cells using a unique name and index identifier; and projecting each defined petrofacies region and each defined petrofacies partition from the inscribed matrix onto the cross-plot using each respective name and index identifier as part of partitioning the cross-plot using the data frequency of the data points in the cross-plot.
13. The program carrier device of claim 12, further comprising: connecting isolated cells in the inscribed matrix with a petrofacies partition comprising the connected inscribed matrix cells by enforcing a connected cell condition value.
14. The program carrier device of claim 12, further comprising: adding isolated cells in the inscribed matrix to cells forming a petrofacies region by enforcing a connected cell condition value.
15. The program carrier device of claim 11 wherein the investigation window is created in the cross-plot using a source term for a selected region in the cross-plot as a center and predetermined dimensions.
16. The program carrier device of claim 10, further comprising refining each partition in the cross-plot that intersects the investigation window by reorienting each intersecting partition to be tangent to a side of the investigation window that the intersecting partition intersects.
17. The program carrier device of claim 10, further comprising: measuring a distance between each data point in the region to reduce and a common partition between the region to reduce and the region to grow; and normalizing each distance.
18. The program carrier of claim 17, further comprising assigning a predetermined threshold normalized distance to each normalized distance that does not meet the predetermined threshold normalized distance.
19. A non-transitory program carrier device tangibly carrying computer-executable instructions for predicting hydrocarbon production from a subsurface reservoir by determining non-linear petrofacies, the instructions, when executed, implement: partitioning a cross-plot using a data frequency of data points of properties related to petrofacies in the subsurface reservoir in the cross-plot; repartitioning the cross-plot by modifying one or more partitions in the cross-plot using a sensitivity analysis of data points in a first predefined region to grow and a second predefined region to reduce to generate a repartitioned cross-plot with a grown first predefined region and a reduced second predefined region defined by the one or more partitions either or both refined and modified as part of repartitioning the cross-plot; measuring and normalizing a distance between each data point in the second predefined region to reduce the region and a common partition forming at least part of the region to reduce as part of generating the repartitioned cross-plot; and identifying the non-linear petrofacies of the subsurface reservoir by analyzing the repartitioned cross-plot across a plurality of regions.
20. The program carrier of claim 19, further comprising assigning a predetermined threshold normalized distance to each normalized distance that does not meet the predetermined threshold normalized distance.
Description
BRIEF DESCRIPTION OF THE DRAWINGS
(1) The present disclosure is described below with references to the accompanying drawings in which like elements are referenced with like reference numerals, and in which:
(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)
(10)
(11)
(12)
(13)
(14)
(15)
(16)
(17)
(18)
(19)
(20)
(21)
(22)
(23)
(24)
(25)
(26)
(27)
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
(28) The present disclosure overcomes one or more deficiencies in the prior art by providing systems and methods for determining non-linear petrofacies using cross-plot partitioning to define petrofacies boundaries that distinguish the petrofacies by appearance and/or composition using systematic and automated data analysis techniques.
(29) In one embodiment, the present disclosure includes a method for predicting hydrocarbon production from a subsurface reservoir by determining non-linear petrofacies, which comprises: i) partitioning a cross-plot using a data frequency of data points in the cross-plot and a computer processor; and ii) repartitioning the cross-plot by one of refining one or more partitions in the cross-plot using a data frequency of data points in an investigation window in the cross-plot and modifying one or more partitions in the cross-plot using a sensitivity analysis of data points in a predefined region to grow and a predefined region to reduce.
(30) In another embodiment, the present disclosure includes a non-transitory program carrier device tangibly carrying computer-executable instructions for predicting hydrocarbon production from a subsurface reservoir by determining non-linear petrofacies, the instructions being executable to implement: i) partitioning a cross-plot using a data frequency of data points in the cross-plot; and ii) repartitioning the cross-plot by one of refining one or more partitions in the cross-plot using a data frequency of data points in an investigation window in the cross-plot and modifying one or more partitions in the cross-plot using a sensitivity analysis of data points in a predefined region to grow and a predefined region to reduce.
(31) In yet another embodiment, the present disclosure includes a non-transitory program carrier device tangibly carrying computer-executable instructions for predicting hydrocarbon production from a subsurface reservoir by determining non-linear petrofacies, the instructions being executable to implement: i) partitioning a cross-plot using a data frequency of data points in the cross-plot; ii) repartitioning the cross-plot by modifying one or more partitions in the cross-plot using a sensitivity analysis of data points in a predefined region to grow and a predefined region to reduce; iii) measuring a distance between each data point in the region to reduce and a common partition between the region to reduce and the region to grow; and iv) normalizing each distance.
(32) The subject matter of the present disclosure is described with specificity; however, the description itself is not intended to limit the scope of the disclosure. The subject matter thus, might also be embodied in other ways, to include different steps or combinations of steps similar to the ones described herein, in conjunction with other present or future technologies. Moreover, although the term step may be used herein to describe different elements of methods employed, the term should not be interpreted as implying any particular order among or between various steps herein disclosed unless otherwise expressly limited by the description to a particular order. While the present disclosure may be applied in the oil and gas industry, it is not limited thereto and may also be applied in other industries to achieve similar results.
Method Description
(33) The following description includes automated methods for determining non-linear petrofacies using cross-plot partitioning to define petrofacies boundaries that distinguish the petrofacies by appearance and/or composition. The methods described herein also enable batch processing of multiple petrofacies determination projects simultaneously.
(34) Referring now to
(35) In step 101, a cross-plot of rock and fluid property arrays is automatically input or may be input using the client interface and/or the video interface described further in reference to
(36) In step 102, the method 100 determines whether a source term is required based on the preferred partitioning technique using the client interface and/or the video interface described further in reference to
(37) In step 104, one or more source terms are located for each region in the cross-plot from step 101. One embodiment of a method for performing this step is described further in reference to
(38) In step 106, Voronoi partitioning is performed using the one or more source terms located for each respective region in the cross-plot from step 104 and techniques well known in the art to generate one or more partitions in the cross-plot. An exemplary Voronoi partitioning of the cross-plot in
(39) In step 108, the method 100 determines whether the partition(s) generated in step 106 need to be refined based on the accuracy of the geometry and/or connectivity of the partitions. If the partition(s) do not need to be refined, then the method 100 proceeds to step 114. Otherwise, the method 100 proceeds to step 110 to refine the partition(s).
(40) In step 110, the partition(s) generated in step 106 are refined. One embodiment of a method for performing this step is described further in reference to
(41) In step 112, Rich Neighbors Matrix partitioning is performed using the cross-plot from step 101 to generate one or more partitions in the cross-plot. One embodiment of a method for performing this step is described further in reference to
(42) In step 114, the method determines whether a sensitivity analysis of the partition(s) generated in step 106, 110, or 112 is required based on the accuracy of the location of each partition using the client interface and/or the video interface described further in reference to
(43) In step 116, a sensitivity analysis is performed on the partition(s) generated in step 106, 110, or 112 using techniques well known in the art to modify the location of a partition. Using the results of step 112 as an example, the sensitivity analysis is performed on the location and geometry of predefined interrogation regions and a common partition in the partitioned cross-plot (e.g. a region to grow, a region to reduce and a common partition). In
(44) The partition(s) that result from steps 106, 110, 112 and 116 represent petrofacies boundaries between regions in the cross-plot. The partitioned cross-plot may be used in a numerical reservoir simulation without consideration of variability of the defined petrofacies. The numerical reservoir simulation results generated as a result of applying a repartitioned cross-plot in step 116 also allow for a comparison with the numerical reservoir simulation results generated as a result of applying a partitioned cross-plot from steps 106, 110 and/or 112.
(45) Referring now to
(46) In step 202, data frequency of the data points within the cross-plot from step 101 is determined by performing a horizontal sweep and a vertical sweep of the cross-plot using techniques well known in the art, a predetermined Y axis value about a central sweep line Y (where Y and Y are real numbers) for the horizontal sweep and a predetermined X axis value about a central sweep line X (where X and X are real numbers) for the vertical sweep. The data frequency is determined within the YY range for the horizontal sweep and the XX range for the vertical sweep. An exemplary horizontal sweep and vertical sweep of the cross-plot in
(47) In step 204, the data frequency minima within the YY range and the XX range from step 202, and their respective location, are determined and recorded using techniques well known in the art. The location of data frequency minima along the lines of sweep represents the location of a vertical or horizontal partition to enforce. The data frequency minima for the horizontal sweep in
(48) In step 206, one or more partitions in the cross-plot are computed using the recorded location of the data frequency minima within the YY range and the XX range from step 204. Because the partitions are either vertical or horizontal, they will intersect in the cross-plot to form initial petrofacies boundaries between regions in the cross-plot of
(49) In step 210, data frequency of the data points within each region of the cross-plot formed by the partition(s) computed in step 206 with a minimum of two data points is determined by performing a horizontal sweep and a vertical sweep of each region using techniques well known in the art, a predetermined Y axis value about a central sweep line Y (where Y and Y are real numbers) for the horizontal sweep and a predetermined X axis value about a central sweep line X (where X and X are real numbers) for the vertical sweep. The data frequency is determined within the YY range for the horizontal sweep and the XX range for the vertical sweep.
(50) In step 212, the data frequency maxima within the YY range and the XX range for each region from step 210, and their respective location, are determined and recorded using techniques well known in the art. As a result, a line is generated in the region corresponding to the location of the data frequency maxima within the YY range and another line is generated in the region corresponding to the location of the data frequency maxima within the XX range. An exemplary vertical sweep and horizontal sweep of each non-swept region A-D in
(51) In step 214, a source term is located for each swept region in the cross-plot. The location of each source term in a respective swept region is the intersection of each line in the region formed by the location of the data frequency maxima within the YY range and the XX range from step 212. The location of each source term for a respective swept region in the cross-plot is returned to step 106 in
(52) Referring now to
(53) In step 302, matrix cell dimensions (e.g. number of matrix cells in X and Y dimensions of the cross-plot from step 101), a petrofacies partition criteria and a connected cell condition value are defined using the client interface and/or the video interface described further in reference to
(54) In step 304, an inscribed matrix is created in the cross-plot from step 101 using the matrix cell dimensions from step 302 and techniques well known in the art for creating an inscribed matrix. An exemplary inscribed matrix for the cross-plot in
(55) In step 306, the data frequency of the data points in each cell of the inscribed matrix created in step 304 is determined by counting the data points in the XY range (X.sub.min<X<X.sub.max; Y.sub.min<Y<Y.sub.max) for each cell of the inscribed matrix. The data frequency of the data points in each cell of the inscribed matrix in
(56) In step 308, each inscribed matrix cell with a data frequency from step 306 that meets the petrofacies partition criteria defined in step 302 is connected to a contiguous (i.e. having a common face and/or corner) inscribed matrix cell with a data frequency from step 306 that meets the petrofacies partition criteria defined in step 302 using any well-known connectivity algorithm such as, for example, connectivity algorithms routinely used in image reconstruction/analysis, as well as non-destructive evaluation of porous media in civil and petroleum engineering. An implicit result of the connected cells is the creation of one or more petrofacies regions comprising the remaining unconnected cells in the inscribed matrix, which are bound by one or more petrofacies partitions comprising the connected cells. In the example illustrated by
(57) In step 310, the method 300 determines whether to enforce the connected cell condition value defined in step 302 based on the detection of one or more isolated cells in the inscribed matrix using the client interface and/or the video interface described further in reference to
(58) In step 312, the isolated cells in the inscribed matrix are connected with a petrofacies partition comprising the cells connected in step 308 or they are added to the remaining cells forming a petrofacies region in step 308 by enforcing the connected cell condition value. If the same numbers of cells surrounding an isolated cell (i.e. having a common face and/or corner) as the connected cell condition value have the same data frequency, then the isolated cell belongs to that group of cells with a data frequency that meets the petrofacies partition criteria or the petrofacies region criteria. In this manner, each isolated cell is either connected with a petrofacies partition comprising the cells connected in step 308 or it is added to the remaining cells forming a petrofacies region in step 308.
(59) In step 314, each petrofacies region and each petrofacies partition from step 308 or step 312 is defined by a unique name and index identifier using the client interface and/or the video interface described further in reference to
(60) In step 316, the petrofacies regions and the petrofacies partitions defined in step 314 are projected from the inscribed matrix onto the cross-plot, which may be scaled according to the resolution of the cross-plot, using each respective name and index identifier from step 314. The partitions in the cross-plot are returned to step 114 in
(61) Referring now to
(62) In step 402, a petrofacies region is selected between the one or more partitions in the cross-plot from step 106 using the client interface and/or the video interface described further in reference to
(63) In step 404, dimensions for an investigation window are determined using the source term for the petrofacies region selected in step 402 as a center of the investigation window and one of a predetermined spacing value (dx) or a calculated spacing value using dx=p/m where (p) is the distance between the source term for the petrofacies region selected in step 402 and the closest partition in the cross-plot from step 106, and (m) is the number of even spacings desired between the source term and the closest partition. An exemplary investigation window for the cross-plot in
(64) In step 406, an investigation window is created in the cross-plot using the source term for the petrofacies region selected in step 402 as the center and the dimensions (i.e. dx) determined in step 404. The investigation window may be created by adding concentric cells of 2*dx about the cell in which the source point is located.
(65) In step 408, a minimum rate of inclusion is set using the client interface and/or the video interface described further in reference to
(66) In step 410, the method 400 determines if the data frequency of the data points in the investigation window created in step 406, which represents a rate of inclusion, is greater than the minimum rate of inclusion set in step 408. If the rate of inclusion is not greater than the minimum rate of inclusion, then the method 400 proceeds to step 414. Otherwise, the method 400 proceeds to step 412 to expand the investigation window.
(67) In step 412, the investigation window created in step 406 is expanded by 2*dx on each side and the method 400 returns to step 410. The expansion of the investigation window in
(68) In step 414, the method 400 determines if the investigation window created in step 406 intersects the one or more partitions in the cross-plot from step 106. If the investigation window does not intersect the one or more partitions in the cross-plot, then the method 400 returns the one or more partitions in the cross-plot to step 114 in
(69) In step 416, each partition in the cross-plot from step 106 that intersects the investigation window created in step 406 is refined by reorienting each intersecting partition to be tangent to a side of the investigation window that it intersects. The method 400 then returns the one or more original and refined partitions in the cross-plot to step 114 in
System Description
(70) The present disclosure may be implemented through a computer-executable program of instructions, such as program modules, generally referred to as software applications or application programs executed by a computer. The software may include, for example, routines, programs, objects, components, data structures, etc., that perform particular tasks or implement particular abstract data types. The software forms an interface to allow a computer to react according to a source of input. DecisionSpace Geosciences and Nexus Desktop, which are commercial software applications marketed by Landmark Graphics Corporation, may be used as interface applications to implement the present disclosure. The software may also cooperate with other code segments to initiate a variety of tasks in response to data received in conjunction with the source of the received data. Other code segments may provide optimization components including, but not limited to, neural networks, earth modeling, history-matching, optimization, visualization, data management, reservoir simulation and economics. The software may be stored and/or carried on any variety of memory such as CD-ROM, magnetic disk, bubble memory and semiconductor memory (e.g., various types of RAM or ROM). Furthermore, the software and its results may be transmitted over a variety of carrier media such as optical fiber, metallic wire, and/or through any of a variety of networks, such as the Internet.
(71) Moreover, those skilled in the art will appreciate that the disclosure may be practiced with a variety of computer-system configurations, including hand-held devices, multiprocessor systems, microprocessor-based or programmable-consumer electronics, minicomputers, mainframe computers, and the like. Any number of computer-systems and computer networks are acceptable for use with the present disclosure. The disclosure may be practiced in distributed-computing environments where tasks are performed by remote-processing devices that are linked through a communications network. In a distributed-computing environment, program modules may be located in both local and remote computer-storage media including memory storage devices. The present disclosure may therefore, be implemented in connection with various hardware, software or a combination thereof, in a computer system or other processing system.
(72) Referring now to
(73) The memory primarily stores the application programs, which may also be described as program modules containing computer-executable instructions, executed by the computing unit for implementing the present disclosure described herein and illustrated in
(74) Although the computing unit is shown as having a generalized memory, the computing unit typically includes a variety of computer readable media. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. The computing system memory may include computer storage media in the form of volatile and/or nonvolatile memory such as a read only memory (ROM) and random access memory (RAM). A basic input/output system (BIOS), containing the basic routines that help to transfer information between elements within the computing unit, such as during start-up, is typically stored in ROM. The RAM typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by the processing unit. By way of example, and not limitation, the computing unit includes an operating system, application programs, other program modules, and program data.
(75) The components shown in the memory may also be included in other removable/non-removable, volatile/nonvolatile computer storage media or they may be implemented in the computing unit through an application program interface (API) or cloud computing, which may reside on a separate computing unit connected through a computer system or network. For example only, a hard disk drive may read from or write to non-removable, nonvolatile magnetic media, a magnetic disk drive may read from or write to a removable, nonvolatile magnetic disk, and an optical disk drive may read from or write to a removable, nonvolatile optical disk such as a CD ROM or other optical media. Other removable/non-removable, volatile/nonvolatile computer storage media that can be used in the exemplary operating environment may include, but are not limited to, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM, and the like. The drives and their associated computer storage media discussed above provide storage of computer readable instructions, data structures, program modules and other data for the computing unit.
(76) A client may enter commands and information into the computing unit through the client interface, which may be input devices such as a keyboard and pointing device, commonly referred to as a mouse, trackball or touch pad. Input devices may include a microphone, joystick, satellite dish, scanner, voice recognition or gesture recognition, or the like. These and other input devices are often connected to the processing unit through the client interface that is coupled to a system bus, but may be connected by other interface and bus structures, such as a parallel port or a universal serial bus (USB).
(77) A monitor or other type of display device may be connected to the system bus via an interface, such as a video interface. A graphical user interface (GUI) may also be used with the video interface to receive instructions from the client interface and transmit instructions to the processing unit. In addition to the monitor, computers may also include other peripheral output devices such as speakers and printer, which may be connected through an output peripheral interface.
(78) Although many other internal components of the computing unit are not shown, those of ordinary skill in the art will appreciate that such components and their interconnection are well known.
(79) While the present disclosure has been described in connection with presently preferred embodiments, it will be understood by those skilled in the art that it is not intended to limit the disclosure to those embodiments. It is therefore, contemplated that various alternative embodiments and modifications may be made to the disclosed embodiments without departing from the spirit and scope of the disclosure defined by the appended claims and equivalents thereof.