Multi-robot long-term persistent coverage with fuel constrained robots
Authors:
- 1 May 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10504729,p. 1093-1099
Abstract
In this paper, we present an algorithm to solve the Multi-Robot Persistent Coverage Problem (MRPCP). Here, we seek to compute a schedule that will allow a fleet of agents to visit all targets of a given set while maximizing the frequency of visitation and maintaining a sufficient fuel capacity by refueling at depots. We also present a heuristic method to allow us to compute bounded suboptimal results in real time. The results produced by our algorithm will allow a team of robots to efficiently cover a given set of targets or tasks persistently over long periods of time, even when the cost to transition between tasks is dynamic.Keywords
This publication has 11 references indexed in Scilit:
- Implicit depot assignments and rotations in vehicle routing heuristicsEuropean Journal of Operational Research, 2014
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraintsDiscrete Optimization, 2014
- Order-first split-second methods for vehicle routing problems: A reviewTransportation Research Part C: Emerging Technologies, 2014
- Heuristics for Routing Heterogeneous Unmanned Vehicles with Fuel ConstraintsMathematical Problems in Engineering, 2014
- Algorithms for Routing an Unmanned Aerial Vehicle in the Presence of Refueling DepotsIEEE Transactions on Automation Science and Engineering, 2013
- Tour splitting algorithms for vehicle routing problemsInternational Journal of Production Research, 2008
- Formulations and exact algorithms for the vehicle routing problem with time windowsComputers & Operations Research, 2008
- To Fill or Not to Fill: The Gas Station Problem2007
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow FormulationOperations Research, 2004
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955