Generation of buffer zones for buried assets

• US 8,878,648 B2
• Filed: 06/13/2014
• Issued: 11/04/2014
• Est. Priority Date: 07/06/2012
• Status: Active Grant

• Current Assignee: UTTO Incorporated
• Original Assignee: IPEG Corporation
• Inventors: Haddy, Alan
• Primary Examiner(s): Lim, Steven
• Assistant Examiner(s): Knox, Kaleria
• Application Number:
  US14/303,772
• Publication Number:
  US 20140292486A1
• Time in Patent Office: 144 Days
• Field of Search: 340/8.1, 702/130, 4554516-4566
• US Class Current: 340/8.1
• CPC Class Codes: G01S 5/0244 Accuracy or reliability of position solution or of measurements contributing thereto
• CPC Class Codes: G08C 17/02 using a radio link
• CPC Class Codes: H02G 1/06 for laying cables, e.g. laying apparatus on vehicle
• CPC Class Codes: H02G 9/00 Installations of electric cables or lines in or on the ground or water

Abstract

A method on a computing device for defining a buffer zone around a buried asset at an above-surface location is provided that solves the above-described problems. The method includes receiving and storing buried asset data points, wherein each buried asset data point comprises a geographical coordinate and a precision data value corresponding to the geographical coordinate, for a buried asset, wherein the buried asset data points correspond to signals that were detected and read from the buried asset at the above-surface location. The method further includes generating a two dimensional area comprising a buffer zone by defining circles around geographical coordinates of the buried asset data points, wherein a size of each circle is based on the precision data value of the corresponding buried asset data point, and defining trapezoids that connect adjacent circles.

Claims

1. A method on a computing device for defining a buffer zone around a buried asset at an above-surface location, the method comprising:

receiving and storing, by a processor on the computing device, a plurality of buried asset data points, wherein each buried asset data point comprises a geographical coordinate and a precision data value corresponding to the geographical coordinate, for a buried asset, wherein the plurality of buried asset data points correspond to analog radio frequency signals that were detected and read from the buried asset at the above-surface location; and

generating, by the processor, a first data structure that represents a two dimensional area comprising a buffer zone at the above-surface location, wherein the first data structure is generated by;

(a) defining, by the processor, a first circle around a geographical coordinate of a buried asset data point and a second circle around a geographical coordinate of an adjacent buried asset data point of the plurality of buried asset data points, and wherein a size of each circle is based on the precision data value of the corresponding buried asset data point;

(b) defining, by the processor, a trapezoid, wherein a first side of the trapezoid is a line that bisects the first circle and wherein a second side of the trapezoid is a line that bisects the second circle; and

(c) repeating, by the processor, steps (a) and (b) for each adjacent pair of buried asset data points, and wherein a combination of the circles and trapezoids generated comprise the two dimensional area of the first data structure.

2. The method of claim 1, further comprising:

receiving, by the processor, a second data structure that represents a two dimensional area comprising an excavation zone at the above-surface location;

calculating, by the processor, whether the two dimensional area of the first data structure intersects with the two dimensional area of the second data structure; and

transmitting, by the processor, a request for a locate procedure to a user via a communications network communicatively coupled with the computing device, if the two dimensional area of the first data structure intersects with the two dimensional area of the second data structure.

3. The method of claim 2, wherein the step (b) of the step of generating the first data structure that represents the two dimensional area, further comprises:

defining, by the processor, a trapezoid, wherein a first side of the trapezoid is a line that bisects, and is bound by, the first circle, and wherein a second side of the trapezoid is a line that bisects, and is bound by, the second circle.

4. The method of claim 2, wherein the step (b) of the step of generating the first data structure that represents the two dimensional area, further comprises:

defining, by the processor, a straight line between the geographical coordinate of the first circle and the geographical coordinate of the second circle; and

defining, by the processor, a trapezoid, wherein a first side of the trapezoid is a line that;

i) bisects the first circle, ii) is bound by the first circle, and iii) is perpendicular to the straight line, and wherein a second side of the trapezoid is a line that;

i) bisects the second circle, ii) is bound by the second circle, and iii) is perpendicular to the straight line.

5. The method of claim 4, wherein the step (b) of the step of generating the first data structure that represents the two dimensional area, further comprises:

defining, by the processor, a trapezoid, wherein a third side of the trapezoid is a line that connects one end of the first side with one end of the second side, and wherein the fourth side of the trapezoid is a line that connects another end of the first side with another end of the second side.

6. The method of claim 2, wherein the step of receiving and storing a plurality of buried asset data points further comprises:

receiving, by the processor, from a mobile computing device via the communications network, the plurality of buried asset data points.

7. The method of claim 6, wherein the step of receiving and storing a plurality of buried asset data points further comprises:

receiving, by the processor, the plurality of buried asset data points, wherein each buried asset data point further comprises a precision data value corresponding to a depth measurement of the buried asset data point.

8. A method on a server for defining a buffer zone around a buried asset, the server communicatively coupled with a communications network, the method comprising:

generating a first data structure that represents a three dimensional solid comprising a buffer zone, wherein the first data structure is generated by defining a three dimensional solid around the geographical coordinates of the plurality of buried asset data points, wherein a size of the three dimensional solid is based on the precision data values of the plurality of buried asset data points;

receiving and storing, by a processor on the computing device, a plurality of buried asset data points, wherein each buried asset data point comprises a depth measurement data, a geographical coordinate and a precision data value corresponding to the geographical coordinate, for a buried asset, wherein the plurality of buried asset data points correspond to analog radio frequency signals that were detected and read from the buried asset at the above-surface location; and

generating, by the processor, a first data structure that represents a three dimensional solid comprising a buffer zone, wherein the first data structure is generated by;

(a) defining, by the processor, a first sphere around a geographical coordinate of a buried asset data point and a second sphere around a geographical coordinate of an adjacent buried asset data point of the plurality of buried asset data points, and wherein a size of each sphere is based on the precision data value of the corresponding buried asset data point;

(b) defining, by the processor, a truncated cone, wherein a first side of the truncated zone is a circle that bisects the first sphere and wherein a second side of the truncated zone is a circle that bisects the second sphere; and

(c) repeating, by the processor, steps (a) and (b) for each adjacent pair of buried asset data points, and wherein a combination of the spheres and truncated cones generated comprise the three dimensional solid of the first data structure.

9. The method of claim 8, further comprising:

receiving, by the processor, a second data structure that represents a two dimensional surface comprising an excavation zone;

calculating, by the processor, whether the three dimensional solid of the first data structure intersects with the two dimensional surface of the second data structure; and

transmitting, by the processor, a request for a locate procedure to a user via the communications network, if the three dimensional solid of the first data structure intersects with the two dimensional surface of the second data structure.

10. The method of claim 9, wherein the step (b) of the step of generating the first data structure that represents the three dimensional solid, further comprises:

defining, by the processor, a truncated cone, wherein a first side of the truncated cone is a circle that bisects, and is bound by, the first sphere, and wherein a second side of the truncated cone is a circle that bisects, and is bound by, the second sphere.

11. The method of claim 9, wherein the step (b) of the step of generating the first data structure that represents the three dimensional solid, further comprises:

defining, by the processor, a straight line between the geographical coordinate of the first sphere and the geographical coordinate of the second sphere; and

defining, by the processor, a truncated cone, wherein a first side of the truncated cone is a circle that;

i) bisects the first sphere, ii) is bound by the first sphere, and iii) is perpendicular to the straight line, and wherein a second side of the truncated cone is a line that;

i) bisects the second sphere, ii) is bound by the second sphere, and iii) is perpendicular to the straight line.

12. The method of claim 11, wherein the step (b) of the step of generating the first data structure that represents the three dimensional solid, further comprises:

defining, by the processor, a truncated cone, wherein a main body of the truncated cone connects the first side of the truncated cone with the second side of the truncated cone.

13. The method of claim 9, wherein the step of receiving and storing a plurality of buried asset data points further comprises:

receiving, by the processor, from a mobile computing device via the communications network, the plurality of buried asset data points.

14. The method of claim 13, wherein the step of receiving and storing a plurality of buried asset data points further comprises:

receiving, by the processor, the plurality of buried asset data points, wherein each buried asset data point further comprises a precision data value corresponding to a depth measurement of the buried asset data point.

15. A method on a computing device for defining a buffer zone around a buried asset at an above-surface location, the method comprising:

receiving and storing, by a processor on the computing device, a plurality of buried asset data points, wherein each buried asset data point comprises depth measurement data, electrical current measurement data, a geographical coordinate and a precision data value corresponding to the geographical coordinate, for a buried asset, wherein the plurality of buried asset data points correspond to analog radio frequency signals that were detected and read from the buried asset at the above-surface location; and

generating, by the processor, a first data structure that represents a two dimensional area comprising a buffer zone at the above-surface location, wherein the first data structure is generated by;

(a) defining, by the processor, a first circle around a geographical coordinate of a buried asset data point and a second circle around a geographical coordinate of an adjacent buried asset data point of the plurality of buried asset data points, and wherein a size of each circle is based on the precision data value of the corresponding buried asset data point;

(b) defining, by the processor, a trapezoid, wherein a first side of the trapezoid is a line that bisects the first circle and wherein a second side of the trapezoid is a line that bisects the second circle; and

(c) repeating, by the processor, steps (a) and (b) for each adjacent pair of buried asset data points, and wherein a combination of the circles and trapezoids generated comprise the two dimensional area of the first data structure.

16. The method of claim 15, further comprising:

receiving, by the processor, a second data structure that represents a two dimensional area comprising an excavation zone at the above-surface location;

calculating, by the processor, whether the two dimensional area of the first data structure intersects with the two dimensional area of the second data structure; and

transmitting, by the processor, a request for a locate procedure to a user via a communications network communicatively coupled with the computing device, if the two dimensional area of the first data structure intersects with the two dimensional area of the second data structure.

17. The method of claim 16, wherein the step (b) of the step of generating the first data structure that represents the two dimensional area, further comprises:

defining, by the processor, a trapezoid, wherein a first side of the trapezoid is a line that bisects, and is bound by, the first circle, and wherein a second side of the trapezoid is a line that bisects, and is bound by, the second circle.

18. The method of claim 16, wherein the step (b) of the step of generating the first data structure that represents the two dimensional area, further comprises:

defining, by the processor, a straight line between the geographical coordinate of the first circle and the geographical coordinate of the second circle; and

defining, by the processor, a trapezoid, wherein a first side of the trapezoid is a line that;

i) bisects the first circle, ii) is bound by the first circle, and iii) is perpendicular to the straight line, and wherein a second side of the trapezoid is a line that;

i) bisects the second circle, ii) is bound by the second circle, and iii) is perpendicular to the straight line.

19. The method of claim 18, wherein the step (b) of the step of generating the first data structure that represents the two dimensional area, further comprises:

defining, by the processor, a trapezoid, wherein a third side of the trapezoid is a line that connects one end of the first side with one end of the second side, and wherein the fourth side of the trapezoid is a line that connects another end of the first side with another end of the second side.