# US 10,310,114 B2 · Identifying an error bound of a stimulated reservoir volume of a subterranean region

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 10,310,114 B2
- Document ID: US10310114B2
- Status: Granted
- Kind: B2
- Application number: 15/304,990
- Filed: 2014-05-19
- Published: 2017-05-18
- Granted: 2019-06-04
- Earliest claimed: 2014-05-19
- Assignees: Halliburton Energy Services, Inc.
- Applicants: Halliburton Energy Services, Inc.
- Inventors: Baidurja Ray; Avi Lin; Jianfu Ma
- Web page: https://patentgrep.com/patent/US10310114B2

## CPC

- G01V 1/288: {Event detection in seismic signals, e.g. microseismics (G01V1/36 takes precedence)}
- G01V 1/42: using generators in one well and receivers elsewhere or vice versa (G01V1/52 takes precedence)
- G01V 1/34: Displaying seismic recordings {or visualisation of seismic data or attributes}
- G01V 2210/1232: Earthquakes
- G01V 2210/1234: Hydrocarbon reservoir, e.g. spontaneous or induced fracturing
- G01V 2210/646: Fractures
- G01V 2210/65: Source localisation, e.g. faults, hypocenters or reservoirs
- G01V 2210/667: Determining confidence or uncertainty in parameters
- G01V: GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS (means for indicating the location of accidentally buried, e.g. snow-buried, persons A63B29/02)

## Abstract

In some aspects, a closed boundary is computed based on locations and location-uncertainty domains of microseismic events associated with a stimulation treatment of a subterranean region. The closed boundary encloses the locations and respective location-uncertainty domains of multiple microseismic event data points. An error bound of a stimulated reservoir volume (SRV) for the stimulation treatment is identified based on the closed boundary.

## Claims

### Claim 1

A method comprising:
computing, by operation of a computer system, a closed boundary based on locations and respective location-uncertainty domains of microseismic events associated with a stimulation treatment of a subterranean region, the closed boundary enclosing the locations and location-uncertainty domains, wherein computing the closed boundary comprises:
identifying boundary points on an uncertainty boundary of each location-uncertainty domain; and
computing a convex hull based on the boundary points;
identifying an error bound of a stimulated reservoir volume (SRV) for the stimulation treatment based on the closed boundary; and
assessing stimulation treatment field development, evaluating efficiency of the stimulation treatment, modifying, and managing a plan for the stimulation treatment plan using the closed boundary.

### Claim 2 (depends on 1)

The method of claim 1, wherein each of the location-uncertainty domains is represented as a radius associated with one of the respective locations.

### Claim 3 (depends on 2)

The method of claim 2, wherein each of the location-uncertainty domains comprises a circle centered about one of the respective locations.

### Claim 4 (depends on 1)

The method of claim 1, wherein computing the closed boundary comprises identifying one or more of the microseismic events as a degenerate microseismic event.

### Claim 5 (depends on 1)

The method of claim 1, wherein computing the closed boundary comprises identifying one or more arcs connecting vertices of the convex hull.

### Claim 6 (depends on 1)

The method of claim 1, comprising computing the convex hull according to an algorithm selected by a user.

### Claim 7 (depends on 1)

The method of claim 1, comprising computing the convex hull according to an algorithm that is selected based on at least one of:
a computational precision tolerance for identifying the error bound; or
a run-time tolerance for identifying the error bound.

### Claim 8 (depends on 1)

The method of claim 1, wherein identifying the boundary points comprises identifying direct common tangent (DCT) points.

### Claim 9 (depends on 1)

The method of claim 1, wherein computing the convex hull comprises performing a binary search of a left tangent point from a reference point on each sub-boundary that encloses a respective subset of the boundary points.

### Claim 10 (depends on 1)

The method of claim 1, wherein computing the convex hull comprises:
identifying subsets of the boundary points;
computing sub-boundaries based on the subsets;
identifying a first reference point on each of the sub-boundaries;
identifying a left tangent point from the first reference point on each of the sub-boundaries in logarithmic time;
identifying a second reference point based on the left tangent points; and
computing the convex hull based on the first reference point and the second reference point.

### Claim 11 (depends on 10)

The method of claim 10, wherein identifying a left tangent point from the first reference point on each of the sub-boundaries comprises accounting for collinear points; and computing the convex hull based on the first reference point and the second reference point comprises accounting for the collinear points.

### Claim 12 (depends on 1)

The method of claim 1, wherein the SRV is computed based on the locations of the microseismic events, and identifying the error bound comprises identifying the maximum positive error of the SRV.

### Claim 13

A non-transitory computer-readable medium storing instructions that, when executed by data processing apparatus, cause the data processing apparatus to perform operations comprising:
computing a closed boundary based on locations and respective location-uncertainty domains of microseismic events associated with a stimulation treatment of a subterranean region, the boundary enclosing the locations and location-uncertainty domains, wherein computing the closed boundary comprises:
identifying boundary points on an uncertainty boundary of each location-uncertainty domain; and
computing a convex hull based on the boundary points;
identifying an error bound of a stimulated reservoir volume (SRV) for the stimulation treatment based on the closed boundary; and
assessing stimulation treatment field development, evaluating efficiency of the stimulation treatment, modifying, and managing a plan for the stimulation treatment plan using the closed boundary.

### Claim 14 (depends on 13)

The computer-readable medium of claim 13, wherein each of the location-uncertainty domains is represented as a radius associated with one of the respective locations.

### Claim 15 (depends on 13)

The computer-readable medium of claim 13, wherein identifying the boundary points comprises identifying direct common tangent (DCT) points.

### Claim 16 (depends on 13)

The computer-readable medium of claim 13, wherein the SRV is computed based on the locations of the microseismic events, and identifying the error bound comprises identifying the maximum positive error of the SRV.

### Claim 17

A computing system comprising:
data processing apparatus; and
memory storing computer-readable instructions that, when executed by the data processing apparatus, cause the data processing apparatus to perform operations comprising:
computing a closed boundary based on locations and respective location-uncertainty domains of microseismic events associated with a stimulation treatment of a subterranean region, the closed boundary enclosing the locations and location-uncertainty domains, wherein computing the closed boundary comprises:
identifying boundary points on an uncertainty boundary of each location-uncertainty domain; and
computing a convex hull based on the boundary points; and
identifying an error bound of a stimulated reservoir volume (SRV) for the stimulation treatment based on the closed boundary; and
assessing stimulation treatment field development, evaluating efficiency of the stimulation treatment, modifying, and managing a plan for the stimulation treatment plan using the closed boundary.

### Claim 18 (depends on 17)

The computing system of claim 17, wherein each of the location-uncertainty domains is represented as a radius associated with one of the respective locations.

### Claim 19 (depends on 17)

The computing system of claim 17, wherein identifying the boundary points comprises identifying direct common tangent (DCT) points.
