Stochastic Collection and Replenishment (SCAR) Optimisation for Persistent Autonomy

March 07, 2016 Β· Declared Dead Β· πŸ› IEEE/RJS International Conference on Intelligent RObots and Systems

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Andrew W. Palmer, Andrew J. Hill, Steven J. Scheding arXiv ID 1603.01932 Category cs.RO: Robotics Cross-listed cs.MA Citations 18 Venue IEEE/RJS International Conference on Intelligent RObots and Systems Last Checked 4 months ago
Abstract
Robots have a finite supply of resources such as fuel, battery charge, and storage space. The aim of the Stochastic Collection and Replenishment (SCAR) scenario is to use dedicated agents to refuel, recharge, or otherwise replenish robots in the field to facilitate persistent autonomy. This paper explores the optimisation of the SCAR scenario with a single replenishment agent, using several different objective functions. The problem is framed as a combinatorial optimisation problem, and A* is used to find the optimal schedule. Through a computational study, a ratio objective function is shown to have superior performance compared with a total weighted tardiness objective function, with a greater performance advantage present when using shorter schedule lengths. The importance of incorporating uncertainty in the objective function used in the optimisation process is also highlighted, in particular for scenarios in which the replenishment agent is under- or fully-utilised.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Robotics

Died the same way β€” πŸ‘» Ghosted