Abstract
Fleet automation often involves solving several strongly correlated sub-problems, including task allocation, motion planning, and coordination. Solutions need to account for very specific, domaindependent constraints. In addition, several aspects of the overall fleet management problem become known only online. We propose a method for solving the fleet-management problem grounded on a heuristically-guided search in the space of mutually feasible solutions to sub-problems. We focus on a mining application which requires online contingency handling and accommodating many domainspecific constraints. As contingencies occur, efficient reasoning is performed to adjust the plan online for the entire fleet.
| Original language | English |
|---|---|
| Pages (from-to) | 47-56 |
| Number of pages | 10 |
| Journal | Acta Polytechnica |
| Volume | 56 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Feb 2016 |
Keywords
- robot planning
- multi-robot coordination
- on-line reasoning