The tactical movement problem: solution by linear relaxation

Beasley, Peter M. and McAree, Peter R. (2012). The tactical movement problem: solution by linear relaxation. In: Proceedings of the 2012 Australian Mining Technology Conference. 2012 Australian Mining Technology Conference, Perth, Australia, (175-184). 8-10 October 2012.

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads
Author Beasley, Peter M.
McAree, Peter R.
Title of paper The tactical movement problem: solution by linear relaxation
Conference name 2012 Australian Mining Technology Conference
Conference location Perth, Australia
Conference dates 8-10 October 2012
Proceedings title Proceedings of the 2012 Australian Mining Technology Conference
Place of Publication Brisbane, Australia
Publisher Colourwise Digital
Publication Year 2012
Sub-type Fully published paper
Start page 175
End page 184
Total pages 10
Collection year 2013
Language eng
Abstract/Summary The Tactical Movement Problem seeks to determine the minimum cost mission for a robotic agent tasked to complete an assignment that involves both moving through its environment and manipulating that environment. The problem arises in several contexts including open-pit mining automation when a robotic excavator is tasked to remove a designated area of material. The work involves the excavator progressively digging earth, which is usually loaded to trucks. After each load cycle, a decision about from where to take the next dig must be made. Periodically this involves moving the excavator to a new location. The objective is to complete the task in minimum time or at a minimum energy cost or some similarly motivated cost function. The problem becomes one of determining the optimal path that the excavator should take and the dig operations that should be completed at each point along the path. In this paper the problem is posed as a linear relaxation that is solved successively to near optimality. Simulated results show that cost effective paths can be generated however there is still significant computation burden due to the high complexity of the problem. This result allows the solution of much larger task planning problems than were previously possible, thus moving towards the goal of cost effective automated excavation.
Q-Index Code EX
Q-Index Status Confirmed Code
Institutional Status UQ

Document type: Conference Paper
Collections: School of Mechanical & Mining Engineering Publications
Version Filter Type
Citation counts: Google Scholar Search Google Scholar
Created: Wed, 10 Apr 2013, 10:16:22 EST by Rose Clements on behalf of School of Mechanical and Mining Engineering