Abstract:A computational/analytics framework for assessing the value of drill-hole information in ore grade estimation is described using Gaussian Process and statistics. A distinguishing feature is that it presents both a near-term and long-term vision, circumvents conditional simulations and avoids making rigid assumptions such as stationarity and uncorrelated errors. Two experiments are devised to cater for situations where geological domains are differentiated or mixed. In scenario 1, performance (learning) curves are obtained to inform in-fill drilling and spacing consideration consistent with current practice. Analysis shows it is possible to estimate the incremental cost and reward via a proxy measure without relying on the ground truth, using insights obtained from a similar deposit, adjacent bench or domain. Scenario 2 examines adaptive sampling strategies and focuses on applying these in geologically complex areas with discontinuities and heterogeneous composition. Evaluation is made based on structural similarity, the mean and uncertainty in the posterior predictive distribution for the grade. The results highlight situations where regular grid sampling is suboptimal, and demonstrate an adaptive strategy that targets spatial complexity is capable of narrowing this gap. The proposed methodology can potentially be used in the future in an exploration--exploitation setting that involves sampling, machine learning, reasoning and cooperation between robots with embodied intelligence on a mine site.
| Comments: | To appear in IEEE International Conference on Industrial Informatics 2026 |
| Subjects: | Computational Engineering, Finance, and Science (cs.CE) |
| MSC classes: | 68U99, 60G15, 65D15, 62L05 |
| Cite as: | arXiv:2605.23172 [cs.CE] |
| (or arXiv:2605.23172v1 [cs.CE] for this version) | |
| https://doi.org/10.48550/arXiv.2605.23172 arXiv-issued DOI via DataCite (pending registration) |
From: Raymond Leung [view email]
[v1]
Fri, 22 May 2026 02:45:50 UTC (2,504 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。