WO2012120241A1 - Procede informatique d'estimation, procede d'exploration et d'exploitation petroliere mettant en oeuvre un tel procede - Google Patents
Procede informatique d'estimation, procede d'exploration et d'exploitation petroliere mettant en oeuvre un tel procede Download PDFInfo
- Publication number
- WO2012120241A1 WO2012120241A1 PCT/FR2012/050492 FR2012050492W WO2012120241A1 WO 2012120241 A1 WO2012120241 A1 WO 2012120241A1 FR 2012050492 W FR2012050492 W FR 2012050492W WO 2012120241 A1 WO2012120241 A1 WO 2012120241A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- subspace
- locations
- matrix
- denotes
- location
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 85
- 239000011159 matrix material Substances 0.000 claims abstract description 61
- 230000008569 process Effects 0.000 claims description 15
- 230000000295 complement effect Effects 0.000 claims description 9
- 229930195733 hydrocarbon Natural products 0.000 claims description 9
- 150000002430 hydrocarbons Chemical class 0.000 claims description 9
- 230000017105 transposition Effects 0.000 claims description 7
- 239000004215 Carbon black (E152) Substances 0.000 claims description 5
- 238000005192 partition Methods 0.000 claims description 5
- 239000003208 petroleum Substances 0.000 claims description 5
- 238000009434 installation Methods 0.000 claims description 4
- 238000004590 computer program Methods 0.000 claims description 2
- 238000003384 imaging method Methods 0.000 claims description 2
- 239000000872 buffer Substances 0.000 description 16
- 230000006870 function Effects 0.000 description 7
- 230000003068 static effect Effects 0.000 description 5
- 238000005259 measurement Methods 0.000 description 4
- 238000012360 testing method Methods 0.000 description 4
- 230000008901 benefit Effects 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 3
- 238000010845 search algorithm Methods 0.000 description 3
- 238000010276 construction Methods 0.000 description 2
- 239000012530 fluid Substances 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000004088 simulation Methods 0.000 description 2
- 239000000243 solution Substances 0.000 description 2
- 101001114868 Bacillus subtilis (strain 168) 30S ribosomal protein S21 Proteins 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000001174 ascending effect Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000002301 combined effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 238000000354 decomposition reaction Methods 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 238000010790 dilution Methods 0.000 description 1
- 239000012895 dilution Substances 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000013386 optimize process Methods 0.000 description 1
- 239000011295 pitch Substances 0.000 description 1
- 239000004576 sand Substances 0.000 description 1
- 230000035945 sensitivity Effects 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
- G01V99/00—Subject matter not provided for in other groups of this subclass
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
- G01V11/00—Prospecting or detecting by methods combining techniques covered by two or more of main groups G01V1/00 - G01V9/00
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
- G01V11/00—Prospecting or detecting by methods combining techniques covered by two or more of main groups G01V1/00 - G01V9/00
- G01V11/002—Details, e.g. power supply systems for logging instruments, transmitting or recording data, specially adapted for well logging, also if the prospecting method is irrelevant
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
- G01V20/00—Geomodelling in general
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
- G01V2210/00—Details of seismic processing or analysis
- G01V2210/60—Analysis
- G01V2210/66—Subsurface modeling
- G01V2210/665—Subsurface modeling using geostatistical modeling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
Definitions
- the present invention relates to computer estimation methods, exploration and petroleum exploitation methods implementing such methods.
- the invention relates to a computer process for estimating a set of quantities associated with locations of a space, for example a method for modeling petrophysical quantities of a reservoir or a method for mapping the depth or thickness of a geological layer.
- interpolation methods such as kriging are used.
- Kriging is an unbiased interpolator that minimizes the mean squared prediction error and allows for honoring available data (it is an exact interpolator).
- a difficulty with kriging is that it requires a large computing power to invert the covariance matrix. This is especially true when working on a large space, using many observational data.
- the present invention is intended to overcome these disadvantages.
- a computerized method for estimating a set of quantities associated with locations of a space comprising the following steps:
- a magnitude associated with at least one location of the second subspace is estimated by kriging from the first subspace, the second subspace, and the determined precision matrix for the first subspace.
- the precision matrix is the inverse of the covariance matrix.
- step d) the precision matrix of the second subspace is determined from the precision matrix of the first subspace and the Schur complement from the covariance matrix of one of the first and second subspaces. subspaces;
- the second subspace is obtained by adding locations to the first subspace, and in step d), resolving:
- A denotes all the locations of the first subspace
- the second subspace is obtained by removing locations in the first subspace, and in which, in step d), resolving:
- A denotes all the locations of the second subspace
- -1 denotes the matrix inversion operation
- t denotes the matrix transposition operation
- the second subspace is obtained by both adding and removing locations in the first subspace
- the subspaces comprise at least 16 locations, for example, at least 200 locations;
- step b) it is estimated by kriging a set of magnitudes associated with a plurality of locations of the first subspace when the first subspace is sufficiently close to said plurality of locations; in step c), determining the second subspace from the first subspace;
- step c) one of the following operations is implemented:
- step z) is implemented during which a tree of the locations for which quantities are obtained in step a) is constructed;
- step c) the second subspace is determined from said tree
- the tree comprises a plurality of levels each defining a partition of all the locations determined in step a), each node of a level comprising a group of locations, said group being partitioned at least one node of the directly lower level branched on this node, except for groups associated with terminal nodes;
- the first subset is constructed by traversing the tree in search of the locations closest to the location for which the magnitude is to be estimated;
- step c) constructing the second subset using the first subset and the distance between the locations for which it is desired to determine the quantities in step b) and step d);
- step c) in order to impose a distribution of the nearest neighbors, the search for the nearest neighbors is constrained according to several sectors and then the searches are merged; ordering the rows and columns of the precision matrix according to the distance of the locations of the second subspace at the location considered from said tree;
- the space is a subsoil
- the quantities are geological quantities of said subsoil
- the method is implemented by using in step a) quantities obtained by well measurement or seismic acquisition;
- the invention relates to the hydrocarbon produced by such a process.
- the invention relates to the computer program product adapted to implement the steps of such methods when it is implemented on a programmable machine.
- FIG. 1 is a diagrammatic sectional view of a space
- FIG. 2 is a schematic view from above of observations data obtained in space
- FIG. 3 is a schematic view of a method for searching for neighboring subspaces
- FIG. 4 is a schematic view of a kd tree
- FIG. 5 is a schematic view from above of a set of magnitudes estimated by an embodiment of the method
- FIG. 6 is a descriptive flow chart of an exemplary embodiment of the method
- Figure 7 is a schematic view of a computer system adapted to implement the method.
- Figure 1 shows schematically a section of a space 1 which is desired to estimate the oil character.
- the space studied can for example be two-dimensional, such as the plane shown, or three-dimensional, comprising a large number of such sections distributed in the normal direction to the section plane of Figure 1.
- Z is the vertical direction
- X is the horizontal direction included in the plan.
- the space studied is for example a basement for which it is planned to carry out an oil exploitation. For this purpose, it is possible to seek to determine a certain number of characteristic quantities of the subsoil.
- the quantities that are to be estimated are typical quantities of a hydrocarbon reservoir such as the thicknesses of geological layers disposed in the subsoil, the presence and quantity of fluids, hydrocarbons, the net-gross (of acronym NG for "net-to-gross” in English), fluid velocities, porosity, net sand, ... and combinations of these quantities, in particular, any size allowing to model a reservoir of hydrocarbon in the space under consideration.
- FIG. 2 represents, in a number of locations 2a, 2b, 2c, the value of the quantity measured for this location.
- the locations represented in light gray, such as the location 2a show that the quantity measured here is greater than a certain upper threshold.
- locations, such as location 2c, shown in dark gray the measured value of the magnitude is below a certain lower threshold.
- the value measured for the magnitude is between the two thresholds mentioned above. In this way, measurements of the value of the quantity are obtained in a limited number of locations in the space, the value of the quantity in the other locations being unknown.
- observation data 2a, 2b, 2c are obtained by seismic imaging of the subsoil.
- the locations for which the magnitude is measured may have very disparate spacings. For example, in Figure 2, they may be spaced on the order of several meters to several kilometers.
- a given vector of observations Z fc (Z (S i) ...; Z (S n )), where S i, Si, S is provided n represent the locations at which observation data were obtained, and Z (S ⁇ ) represents the observation data at the point S i.
- a location xo is determined for which it is desired to estimate the magnitude Z (x 0 ).
- the point xo is represented by a triangle facing upwards in Figure 3.
- the locations Si are represented by crosses in this figure.
- a neighborhood V (x 0 ) of the location x is determined.
- This neighborhood is for example constituted by a set of n 0 locations S i for which a measure of the magnitude is available, and preferably located at a distance less than a predetermined threshold of the location xo.
- the distance in question can be any suitable distance for the situation, such as the distance from Manhattan and Euclidean, or other ....
- the number can be for example sixteen locations Si, two hundred locations Si, or other.
- step 104 it is then estimated by kriging the value of the magnitude Z k (xo) at the point xo.
- C is the covariance matrix n ⁇ n whose elements are C (s a - sp) and where C (h) is the covariance function of the quantity Z, ⁇ is the vector of the n scalers ⁇ ⁇ , and Co is the element vector C (so-s a ).
- the matrix C is symmetrical, definite, positive and invertible. Inversion of the matrix C gives the kriging weights:
- any appropriate covariance function such as the exponential covariance function, exponential square function, or any other permissible covariance function is used.
- the kriging system is then
- step 105 a location xi close to xo is determined.
- the location xi is indicated by a downward-pointing triangle in FIG. 3.
- the location xi is determined according to location Xo in any appropriate manner. , such as, for example, the location closest to Xo for which no value has yet been estimated for the magnitude.
- step 106 the neighborhood V (Xi) of the locations close to Xi for which a value measured for the magnitude is determined is determined.
- the neighborhood V (Xi) is represented delimited by a dotted line on the figure 3.
- step 108 it is determined whether an estimate of the magnitude values has been obtained for sufficient spacing. If this is not the case, return to step 106 by incrementing the index i of the location for which the value of the quantity is estimated at step 109.
- the neighborhood V (Xi) of a point Xi will eventually be different from the neighborhood V (Xi_i) for the preceding location Xi_i. That is, the process operates by sliding the neighborhood.
- the location X 2 is represented by a triangle oriented to the right, and the neighborhood V (X 2 ) by a mixed line.
- the neighborhood V (X 2 ) is distinguished from the neighborhood V ( ⁇ ) by the addition of identified locations S + and the removal of identified locations S_.
- the second subspace is obtained by adding locations to the first subspace.
- the algorithm is fast, already knowing C A l A
- the number of operations to perform this inversion is of the order of n 3 + 2 (N 2 n + n 2 N), that is to say that one remains of the order of N 2 operations. This is a considerable time saver.
- the second subspace is obtained by deleting locations in the first subspace.
- Locations s_ are the locations to remove. It is assumed here that these sites concern the last rows and columns of the matrix. So we have a matrix:
- step 107 the magnitude value in S2 is estimated by kriging.
- the process is looped until the estimate has been obtained for all the desired locations (end of step 110), for example thousands of locations.
- the method therefore makes it possible to work with large neighborhoods, by putting the precision matrix (inverse of the covariance matrix) up to date according to the equations above.
- Working with a big neighborhood has several advantages:
- the precision matrix is maintained so that the sites are ranked in the order of their increasing distance to the estimation site. This for the following reasons:
- the closest neighbor search algorithm returns the sites in that order
- FIG. 5 An example of representation of the results resulting from the method described above is given in FIG. 5. This corresponds to the result of the simulation method implemented on the basis of the observation data represented in FIG. 2, and the same color code applies to this figure. Zones 2a ', 2b', 2c 'respectively corresponding to zones 2a, 2b, 2c of FIG. 2 are thus recognized. Tests carried out on the same computer system make it possible to obtain, in 10 minutes, the result shown in FIG. 5, while about 120 minutes are needed to obtain a similar result for a conventional process. The conventional method involved only 16 locations in the vicinity, whereas in this test the present method was implemented with 200 locations in the vicinity. The result obtained is therefore more precise for a comparable computing power.
- One of the steps of the invention is to determine a location neighborhood of the considered point where the value of the magnitude is to be estimated.
- An example of a method for the construction of such a neighborhood involves trees Kd (in English: Kd-tree) 3 as shown in FIG.
- the tree structure used is a binary tree in which each node represents both a subset of the given locations and a part it ion of this subset.
- the root node 3o represents the entirety of the given locations.
- Each non-terminal node 3 ⁇ has two child nodes 3 ⁇ + ⁇ , 3i + 2, which represent the two subsets defined by the part ion ionization.
- the terminal nodes 3 Z represent small mutually disjoint subsets which form a partition of the given locations.
- the ionization part For each non-terminal node, the ionization part consists in determining on the associated locations the maximum variability component, then choosing the median value of this component as the separation limit.
- the maximum number of slots for each non-terminal node is set to an arbitrary value nb.
- each node of the tree corresponds a padded domain encompassing the locations associated with this node, the limits of which are defined by the successive portions associated with the parent nodes.
- the domain corresponding to the root node is the entire space.
- the volume of the domain decreases according to the level of increasing depth in the tree.
- the tree of the above locations is then constructed during an initial stage, after obtaining the observation data.
- the search algorithm uses a recursive path in depth of the tree.
- the recursive procedure considers the root node at the first call. If the considered node is terminal then all associated locations are examined. A list of the k nearest neighbors encountered as well as their dissimilarity at the query location is kept in search of a priority queue. When a surveyed location is found closer than the most remote location on this list, the list is updated. If the considered node is non-terminal, then the recursive procedure is called on the child node representing the locations on the same side of the partition as the request location.
- a test is performed to determine if it is necessary to examine the locations on the opposite side of the partition to the request location. The examination is necessary when the domain delimiting these locations intercepts the ball centered at the query location and radius equal to the dissimilarity of the nearest current k th . If yes, the recursive procedure is called on the child node representing these locations.
- a test is carried out to determine if it is necessary to continue the search. Tracking is not necessary when the ball centered at the query location and radius equal to the dissimilarity of the nearest current k th is fully contained in the domain associated with the considered node.
- the above search algorithm is for example implemented at step 103 to determine the vicinity of the x-location.
- This method could be implemented to determine the neighborhood of each location. According to a particular embodiment, it is possible to seek to further improve the accuracy of the results by improving the distribution of the close neighbors used. By decreasing the alea and the inhomogeneity of the distribution of the points taken into account for kriging, compared to the point studied, the risk of errors or artefact is reduced.
- One solution considered is to force the distribution of the nearest neighbors in all directions. In the case of an application to a three-dimensional domain, it is possible to force the distribution of the nearest neighbors according to the octants around the point at kriger.
- octants consists in constraining the search for nearest neighbors after each octant and then merging the searches. You have to do one or more (one by octant) traverses of the tree.
- the set of nearest preselected neighbors must be at least equal to V.
- a simple way is to take a number N close to V. This number N can be adapted according to the distribution of the measurements, the number of sectors, the points to kriger, ...
- V / S neighbors For each sector, if possible, a number of V / S neighbors is selected.
- the distance used in the description below is the Euclidean distance, or any other suitable distance.
- D t (i) the distance from the i th nearest neighbor (if one of the pitches, s n) x t and C t as the initial search terminal is guaranteed to find at least the k nearest neighbors of x t .
- D t (k) ⁇ C t .
- the k nearest neighbors of the query location at the position x t are ⁇ pi, P 2 , ..., p k ⁇ and D t (k) is the maximum distance from these locations to x t ⁇
- the query location moves to the position Xt + i ⁇ Then!
- the steps consist firstly in initializing the initial search terminal C t as explained above and then executing a new static search. This determines the location V (x t )
- the set P of the k nearest neighbors of the query location at the position x t is P ⁇ pi, p 2 , ..., P k ⁇ , D t (k) is the distance maximum of these locations at x t and D t (k + 1) is the minimum distance from locations outside this set P to x t .
- the neighborhood obtained still contains the locations pi satisfying D t (i) ⁇ D t (k + 1) -25
- the m nearest neighbors of the request location at the position x t are stored in a buffer, where m> k.
- D t (k) and D t (m) are the k th th respectively -
- the query location moves to the position x t + 1 . Then it is not necessary to update the buffer if
- ⁇ is the distance between x t and x t + i.
- the search is executed for the nearest neighbors.
- the result is stored in a buffer and the k nearest neighbors are extracted.
- the first step is to check if the neighborhood is contained in the buffer. If so, just look at the buffer locations. If not, the next step is to perform a new static search for the nearest neighbors.
- the result is stored in the buffer and the k nearest neighbors are extracted.
- the first buffer is for candidate locations for the current query position.
- the second buffer is for candidate locations for the next query position.
- the search for the k nearest neighbors is executed while calculating for each location examined the distance from this location to the next request position.
- the k closest current neighbors are maintained in the first buffer and the best k results for the next query position are stored in the second buffer.
- the locations of the second buffer are copied to the first buffer and the maximum distance from these locations to the current query position is used as the initial search terminal.
- the locations of the second buffer are kept but sorted this time in ascending order of their distance to the next query position. Then a new search for k nearest neighbors is executed and both buffers are updated.
- the initial search terminal in this example is thus always lower than that in the method according to the first example.
- the method which is described above for a magnitude can be implemented for a set of magnitudes comprising one or more magnitudes to estimate. If the above process makes it possible to confirm the presence of hydrocarbons to be extracted in the zone considered, it is possible to construct an oil exploitation installation 4 of the space under consideration.
- the grid obtained by the above method can be used to estimate the characteristics of the hydrocarbon field, and, therefore, to estimate the installation characteristics of the oil exploitation facility. This exploitation then makes it possible to extract hydrocarbons.
- FIG. 7 describes an exemplary simulation device 600.
- the device comprises a computer 600 comprising receiving means 601 arranged to receive an observation of a given magnitude of the geological region such as, for example a 601 modem connected to a network 605, itself in communication with a device 606 providing observation data.
- the device 600 further comprises a memory for storing a mesh of the studied space.
- Processing means for example a processor 602, are adapted to implement the above method from the observation data obtained and the mesh stored in the memory.
- the processing means 602 are for example capable of performing the steps 101 to 110 of FIG. 6.
Landscapes
- Physics & Mathematics (AREA)
- Life Sciences & Earth Sciences (AREA)
- General Life Sciences & Earth Sciences (AREA)
- General Physics & Mathematics (AREA)
- Geophysics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Geophysics And Detection Of Objects (AREA)
- Radar Systems Or Details Thereof (AREA)
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
NO20131328A NO346088B1 (no) | 2011-03-09 | 2012-03-08 | Datamaskin-estimeringsfremgangsmåte og fremgangsmåte for oljeleting og -utvinning ved bruk av en slik fremgangsmåte |
US14/004,052 US9891344B2 (en) | 2011-03-09 | 2012-03-08 | Computer estimation method, and method for oil exploration and development using such a method |
GB1315670.8A GB2502918B (en) | 2011-03-09 | 2012-03-08 | Computer estimation method, and method for oil exploration and exploitation using such a method |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR1151911A FR2972539B1 (fr) | 2011-03-09 | 2011-03-09 | Procede informatique d'estimation, procede d'exploration et d'exploitation petroliere mettant en oeuvre un tel procede |
FR1151911 | 2011-03-09 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2012120241A1 true WO2012120241A1 (fr) | 2012-09-13 |
Family
ID=45974383
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/FR2012/050492 WO2012120241A1 (fr) | 2011-03-09 | 2012-03-08 | Procede informatique d'estimation, procede d'exploration et d'exploitation petroliere mettant en oeuvre un tel procede |
Country Status (5)
Country | Link |
---|---|
US (1) | US9891344B2 (fr) |
FR (1) | FR2972539B1 (fr) |
GB (1) | GB2502918B (fr) |
NO (1) | NO346088B1 (fr) |
WO (1) | WO2012120241A1 (fr) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CA2877507A1 (fr) * | 2012-06-26 | 2014-01-03 | Total Sa | Determination de diagramme de troncature pour une estimation plurigaussienne |
AU2016428597A1 (en) * | 2016-11-04 | 2019-03-14 | Landmark Graphics Corporation | Determining active constraints in a network using pseudo slack variables |
US11734384B2 (en) | 2020-09-28 | 2023-08-22 | International Business Machines Corporation | Determination and use of spectral embeddings of large-scale systems by substructuring |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5539704A (en) * | 1995-06-23 | 1996-07-23 | Western Atlas International, Inc. | Bayesian sequential Gaussian simulation of lithology with non-linear data |
US5995906A (en) * | 1997-10-03 | 1999-11-30 | Western Atlas International, Inc. | Method for reconciling data at seismic and well-log scales in 3-D earth modeling |
US7254091B1 (en) | 2006-06-08 | 2007-08-07 | Bhp Billiton Innovation Pty Ltd. | Method for estimating and/or reducing uncertainty in reservoir models of potential petroleum reservoirs |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FR2890453B1 (fr) * | 2005-09-05 | 2007-10-19 | Inst Francais Du Petrole | Methode pour mettre a jour un modele geologique de reservoir a l'aide de donnees dynamiques |
WO2009138290A2 (fr) | 2008-05-16 | 2009-11-19 | Ephesia Consult Sa | Modélisation de gisement multipoint |
AU2009295270B2 (en) | 2008-09-19 | 2015-02-05 | The University Of Sydney | A method and system of data modelling |
BRPI0919457A2 (pt) | 2008-09-30 | 2015-12-01 | Exxonmobil Upstream Res Co | método para simular escoamento de fluido em um reservatório de hidrocarboneto |
US8374836B2 (en) * | 2008-11-12 | 2013-02-12 | Geoscape Analytics, Inc. | Methods and systems for constructing and using a subterranean geomechanics model spanning local to zonal scale in complex geological environments |
AU2009251043A1 (en) | 2009-01-07 | 2010-07-22 | The University Of Sydney | A method and system of data modelling |
-
2011
- 2011-03-09 FR FR1151911A patent/FR2972539B1/fr active Active
-
2012
- 2012-03-08 NO NO20131328A patent/NO346088B1/no unknown
- 2012-03-08 WO PCT/FR2012/050492 patent/WO2012120241A1/fr active Application Filing
- 2012-03-08 GB GB1315670.8A patent/GB2502918B/en active Active
- 2012-03-08 US US14/004,052 patent/US9891344B2/en active Active
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5539704A (en) * | 1995-06-23 | 1996-07-23 | Western Atlas International, Inc. | Bayesian sequential Gaussian simulation of lithology with non-linear data |
US5995906A (en) * | 1997-10-03 | 1999-11-30 | Western Atlas International, Inc. | Method for reconciling data at seismic and well-log scales in 3-D earth modeling |
US7254091B1 (en) | 2006-06-08 | 2007-08-07 | Bhp Billiton Innovation Pty Ltd. | Method for estimating and/or reducing uncertainty in reservoir models of potential petroleum reservoirs |
Also Published As
Publication number | Publication date |
---|---|
GB2502918A (en) | 2013-12-11 |
NO20131328A1 (no) | 2013-10-03 |
US9891344B2 (en) | 2018-02-13 |
FR2972539B1 (fr) | 2013-04-26 |
NO346088B1 (no) | 2022-02-07 |
GB201315670D0 (en) | 2013-10-16 |
US20140149044A1 (en) | 2014-05-29 |
GB2502918B (en) | 2016-08-03 |
FR2972539A1 (fr) | 2012-09-14 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP2037080B1 (fr) | Méthode pour estimer la preméabilité d'un réseau de fractures à partir d'une analyse de connectivité | |
EP2628893B1 (fr) | Procédé d'exploitation d'un gisement à partir d'une technique de sélection des positions de puits à former | |
EP3144468B1 (fr) | Procédé pour caracteriser le réseau de fractures d'un gisement fracture et procédé pour l'exploiter | |
EP2356493B1 (fr) | Procede de modelisation geologique de donnees sismiques par correlation de traces | |
EP2568110B1 (fr) | Procéde d'exploitation d'un gisement pétrolier à partir d'une technique de selection des positions des puits à forer | |
CA3043212A1 (fr) | Procede pour la detection d'objets geologiques dans une image sismique | |
EP2685291B1 (fr) | Procédé d'exploitation d'un réservoir géologique a partir d'un modèle de reservoir calé par le calcul d'une loi analytique de distribution conditionnelle de paramètres incertains du modèle | |
EP2963235B1 (fr) | Procede d'exploitation d'un gisement petrolier a partir d'une technique de positionnement des puits a forer | |
WO2010061135A1 (fr) | Estimation de proprietes lithologiques d'une zone geologique. | |
EP2650471A1 (fr) | Procédé de sélection des positions de puits a forer pour l'exploitation d'un gisement pétrolier | |
WO2012120241A1 (fr) | Procede informatique d'estimation, procede d'exploration et d'exploitation petroliere mettant en oeuvre un tel procede | |
EP2813668A1 (fr) | Méthode pour optimiser l'exploitation d'un gisement de fluide par prise en compte d'un terme d'échange géologique et transitoire entre blocs matriciels et fractures | |
FR2956746A1 (fr) | Methode pour exploiter un milieu souterrain a partir de calage d'historique d'un modele geologique comportant un reseau de failles. | |
EP2873989A1 (fr) | Procédé de construction d'une grille représentative de la distribution d'une propriété physique d'une formation souterraine par simulation statistique multipoint conditionnelle | |
WO2009090522A1 (fr) | Procede, programme et systeme informatique de construction d'un modele geologique 3d | |
Tunkiel et al. | Automated Iterative Gap Filling Method for Drilling Logs and Other Data Series | |
CA2968579A1 (fr) | Procede d'exploitation des hydrocarbures d'une formation souterraine, au moyen d'une mise a l'echelle optimisee | |
FR2925735A1 (fr) | Procede de traitement d'une carte de differences determinee a partir de modeles numeriques de terrain | |
FR3120087A1 (fr) | Procédé de sélection, pour au moins une formation souterraine comportant des hydrocarbures, d’une technique d’exploitation de ladite formation souterraine | |
Boiko et al. | Calibration of Dobson model for improving soil moisture retrievals from AMSR satellite imagery | |
WO2021063804A1 (fr) | Procede pour determiner une trajectoire d'un puits dans un reservoir petrolier | |
FR3087274A1 (fr) | Étalonnage d’images sismiques répétitives pour des opérations de production | |
FR3093878A1 (fr) | Procédé et dispositif d’estimation de distributions probabilistes d’une métrique additive | |
FR3011961A1 (fr) | Procede et dispositif de determination de groupes de facies geologiques | |
FR2983615A1 (fr) | Rotations a partir de directions par gradient |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 12714755 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 1315670 Country of ref document: GB Kind code of ref document: A Free format text: PCT FILING DATE = 20120308 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1315670.8 Country of ref document: GB |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 14004052 Country of ref document: US |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 12714755 Country of ref document: EP Kind code of ref document: A1 |