IP Library › Granted Patent US 7,519,515
Granted Patent B2
US 7,519,515 · App. 10/530,845 · Granted Apr 14, 2009

System and method(s) of mine planning, design and processing

Assignee: BHP Billiton Innovation Pty. Ltd.
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,519,515
App. No.
10/530,845
Granted
Apr 14, 2009
Kind
B2
Abstract

The present invention relates to the field of extracting resource(s) from a particular location. In particular, the present invention relates to the planning, design and processing related to a mine location in a manner based on enhancing the extraction of material considered of value, relative to the effort and/or time in extracting that material. The present application discloses, amongst other things, a method of and apparatus for determining slope constraints, determining a cluster of material, determining characteristics of a selected portion of material, analysing a selected volume of material, propagating dusters, forming clusters, mine design, aggregation of blocks into collections or clusters, splitting of waste and ore in clumps, determining a selected group of blocks to be mined, clump ordering and identifying clusters for pushback design.

Claims (37)

1. A method of determining extraction of material from a mine having at least one pit comprising:

forming, using a data processing system, a block model of the pit in which material is divided into a plurality of blocks;

processing, using the data processing system, the blocks of the block model based on at least one criteria to define a plurality of clusters each comprising a plurality of blocks;

forming, using the data processing system, a cone for each cluster propagating upwardly by precedence arcs extending from each cluster; and

defining, using the data processing system, clumps of material from the intersection of the cones, the clumps comprising volumes of material not crossed by precedence arcs, so that material is extractable from the mine in any extraction ordering of the clumps that is feasible according to the precedence arcs to provide flexibility in the extraction of the material from the mine.

2. The method according to claim 1 wherein the at least one criteria comprises spatial position of blocks relative to one another.

3. The method according to claim 2 comprising determining a time of extraction for the blocks.

4. The method according to claim 2 wherein at least one further criteria comprises a variable selected from the group comprising value of material, grade of material, and material type.

5. The method according to claim 4 further comprising increasing an emphasis of the further criteria so that clusters are formed from blocks which are more spatially fragmented but more closely follow an optimal extraction schedule.

6. The method according to claim 4 further comprising decreasing an emphasis of the further criteria so the clusters are formed from blocks which are spatially compact but ignore an optimal extraction sequence.

7. The method according to claim 1 wherein when the plurality of clusters has been defined, the clusters are ordered in time and the plurality of cones are propagated upwardly from each cluster in order of time, and wherein any blocks already assigned to a first cone are not included in a second cone or any subsequent cone, and any blocks assigned to the second cone are not included in any subsequent cone and so-on.

8. The method according to claim 1 wherein a size of each cluster is controlled to a predetermined size by reducing oversized clusters by reassigning blocks of that cluster according to their probability of belonging to other clusters.

9. An apparatus for determining extraction of material from a mine having at least one pit comprising:

a processor for receiving a block model of the pit in which material is divided into a plurality of blocks;

a memory for storing computer program code, that, upon execution by the processor, perform operations comprising:

processing the blocks of the block model based on at least one criteria to define a plurality of clusters each comprising a plurality of blocks;

forming a cone for each cluster propagating upwardly by precedence arcs extending from each cluster; and

defining clumps of material from an intersection of the cones, the clumps comprising volumes of material not crossed by precedence arcs, so that material is extractable from the mine in any extraction ordering of the clumps that is feasible according to the precedence arcs to provide flexibility in the extraction of the material from the mine.

10. The apparatus according to claim 9 wherein the at least one criteria used to define each cluster comprises spatial position of blocks relative to one another.

11. The apparatus according to claim 10 wherein the the processor is also for determining a time of extraction.

12. The apparatus according to claim 10 wherein at least one further criteria comprises a variable selected from the group comprising value of material, grade of material, and material type.

13. The apparatus according to claim 12 wherein an emphasis of the further criteria is increased so that clusters are formed from blocks which are more spatially fragmented but more closely follow an optimal extraction schedule.

14. The apparatus according to claim 12 wherein an emphasis of the further criteria is decreased so the clusters are formed from blocks which are spatially compact but ignore an optimal extraction sequence.

15. The apparatus according to claim 9 wherein the processor is also for, when the plurality of clusters has been defined, ordering the clusters in time and the plurality of cones are propagated upwardly from each cluster in order of time, and wherein any blocks already assigned to a first cone are not included in a second cone or any subsequent cone, and any blocks assigned to the second cone are not included in any subsequent cone and so-on.

16. The apparatus according to claim 9 wherein the processor is also for controlling a size of each cluster to a predetermined size by reducing oversized clusters by reassigning blocks of that cluster according to their probability of belonging to other clusters.

17. A computer readable medium having thereon computer program code which when executed by a processor determines extraction of material from a mine having at least one pit, the computer program code comprising:

code for receiving a block model of the pit in which material is divided into a plurality of blocks;

code for processing the blocks of the block model based on at least one criteria to define a plurality of clusters each comprising a plurality of blocks;

code for forming a cone for each cluster propagating upwardly by precedence arcs extending from each cluster; and

code for defining clumps of material from an intersection of the cones so that material is extractable from the mine in any extraction ordering of the clumps that is feasible according to the precedence arcs to provide flexibility in the extraction of the material from the mine.

18. The computer readable medium according to claim 17 wherein at least one criteria used by the code to define each cluster comprises spatial position of blocks relative to one another.

19. The computer readable medium according to claim 18 comprising code for determining a time of extraction.

20. The computer readable medium according to claim 18 wherein at least one further criteria used by the code comprises a variable selected from the group comprising value of material, grade of material, and material type.

21. The computer readable medium according to claim 20 wherein emphasis of at least one further criteria is increased so that clusters are formed from blocks which are more spatially fragmented but more closely follow an optimal extraction schedule.

22. The computer readable medium according to claim 20 wherein emphasis of at least one further criteria is decreased so the clusters are formed from blocks which are spatially compact but ignore an optimal extraction sequence.

23. The computer readable medium according to claim 17 comprising code for when the plurality of clusters have been defined, ordering the clusters in time and propagating the plurality of cones upwardly from each cluster in order of time, and wherein any blocks already assigned to a first cone are not included in a second cone or any subsequent cone, and any blocks assigned to the second cone are not included in any subsequent cone and so-on.

24. The computer readable medium according to claim 17 further comprising code for controlling a size of each cluster to a predetermined size by reducing oversized clusters by reassigning blocks of that cluster according to their probability of belonging to other clusters.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 23, 2006
From: FROYLAND, GARY ALLAN; MENABDE, MERAB
To: BHP BILLITON INNOVATION PTY LTD.
Reel/Frame 017285/0107 →
Priority Claims (5)
AU 2002951891 · Oct 9, 2002 · national
AU 2002951893 · Oct 9, 2002 · national
AU 2002951894 · Oct 9, 2002 · national
AU 2002951896 · Oct 9, 2002 · national
AU 2003901021 · Mar 5, 2003 · national
Continuity (1)
Related Publication 20060190219A1 · Aug 24, 2006