Arrow Research search

Author name cluster

Arman Melkumyan

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

4 papers
2 author rows

Possible papers

4

ICRA Conference 2012 Conference Paper

A geological perception system for autonomous mining

  • Sven Schneider 0003
  • Arman Melkumyan
  • Richard J. Murphy
  • Eric Nettleton

There is a strong push within the mining sector to develop and adopt automation technology, including autonomous vehicles such as excavators, trucks and drills. However, for autonomous systems to operate effectively in this domain, new perception capabilities are required to build rich models of a mine. A key element of this is an ability to sense and model the sub-surface geological structure as well as the more traditional robotic models, which typically estimate terrain and obstacles. This paper presents a new automated geological perception system to support autonomous mining. It uses hyperspectral imaging sensors and a supervised learning algorithm to detect and classify geological structures, and ultimately build a rich model of the operating environment. The presented algorithm uses Gaussian Processes (GPs) and an Observation Angle Dependent (OAD) covariance function. Further, the resulting geological model can be improved by fusing data from two hyperspectral scanners which measure different regions of the spectrum. The approach is demonstrated using data from an operational iron-ore mine. Fusion of classification results from the two sensors shows better agreement with ground truth mapping done in the field, compared to results from individual sensors.

ICRA Conference 2011 Conference Paper

Detection of geological structure using gamma logs for autonomous mining

  • Katherine L. Silversides
  • Arman Melkumyan
  • Derek A. Wyman
  • Peter Hatherly
  • Eric Nettleton

This work is motivated by the need to develop new perception and modeling capabilities to support a fully autonomous, remotely operated mine. The application differs from most existing robotics research in that it requires a detailed world model of the sub-surface geological structure. This in-ground geological information is then used to drive many of the planning and control decisions made on a mine site. This paper formulates a method for automatically detecting in-ground geological boundaries using geophysical logging sensors and a supervised learning algorithm. The algorithm uses Gaussian Processes (GPs) and a single length scale squared exponential covariance function. The approach is demonstrated on data from a producing iron-ore mine in Australia. Our results show that two separate distinctive geological boundaries can be automatically identified with an accuracy of over 99 percent. The alternative approach to automatic detection involves manual examination of these data.

IJCAI Conference 2011 Conference Paper

Multi-Kernel Gaussian Processes

  • Arman Melkumyan
  • Fabio Ramos

Multi-task learning remains a difficult yet important problem in machine learning. In Gaussian processes the main challenge is the definition of valid kernels (covariance functions) able to capture the relationships between different tasks. This paper presents a novel methodology to construct valid multi-task covariance functions (Mercer kernels) for Gaussian processes allowing for a combination of kernels with different forms. The method is based on Fourier analysis and is general for arbitrary stationary covariance functions. Analytical solutions for cross covariance terms between popular forms are provided including Mat´ ern, squared exponential and sparse covariance functions. Experiments are conducted with both artificial and real datasets demonstrating the benefits of the approach.

IJCAI Conference 2009 Conference Paper

  • Arman Melkumyan
  • Fabio Ramos

Despite the success of Gaussian processes (GPs) in modelling spatial stochastic processes, dealing with large datasets is still challenging. The problem arises by the need to invert a potentially large covariance matrix during inference. In this paper we address the complexity problem by constructing a new stationary covariance function (Mercer kernel) that naturally provides a sparse covariance matrix. The sparseness of the matrix is defined by hyperparameters optimised during learning. The new covariance function enables exact GP inference and performs comparatively to the squared-exponential one, at a lower computational cost. This allows the application of GPs to large-scale problems such as ore grade prediction in mining or 3D surface modelling. Experiments show that using the proposed covariance function, very sparse covariance matrices are normally obtained which can be effectively used for faster inference and less memory usage.

v2026.09.13