A method for real-time dynamic fleet mission planning for autonomous mining

2Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper introduces a method for dynamic fleet mission planning for autonomous mining (in loop-free maps), in which a dynamic fleet mission is defined as a sequence of static fleet missions, each generated using a modified genetic algorithm. For the case of static fleet mission planning (where each vehicle completes just one mission), the proposed method is able to reliably generate, within a short optimization time, feasible fleet missions with short total duration and as few stops as possible. For the dynamic case, in simulations involving a realistic mine map, the proposed method is able to generate efficient dynamic plans such that the number of completed missions per vehicle is only slightly reduced as the number of vehicles is increased, demonstrating the favorable scaling properties of the method as well as its applicability in real-world cases.

Cite

CITATION STYLE

APA

Wahde, M., Bellone, M., & Torabi, S. (2019). A method for real-time dynamic fleet mission planning for autonomous mining. Autonomous Agents and Multi-Agent Systems, 33(5), 564–590. https://doi.org/10.1007/s10458-019-09416-y

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free