A graph-based approach to multi-robot rendezvous for recharging in persistent tasks
- 1 May 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10504729,p. 3497-3502
Abstract
This paper addresses the problem of maintaining persistence in coordinated tasks performed by a team of autonomous robots. We introduce a dedicated team of charging robots to service a team of primary working robots. Given that the trajectories of the working robots are known within a planning interval, the objective is to plan routes for the charging robots such that they rendezvous with and recharge all working robots to guarantee their continuous operation. To this end, the working robot trajectories are discretized to form a finite set of recharging points at which rendezvous can occur. The problem is formulated as a directed acyclic graph with vertex partitions containing sets of charging points for each working robot. Solutions consist of paths through the graph for each of the charging robots. The problem is shown to be NP-hard and a mixed integer linear program formulation is presented and solved for small problem instances. Finally, it is shown that while the optimal solution is not computationally feasible for large problem sizes, it is possible to graphically transform the single charging robot problem to a Traveling Salesman Problem, for which existing heuristic and approximation algorithms can be applied. Simulation results are presented for both single and multiple charging robot scenarios.Keywords
This publication has 11 references indexed in Scilit:
- Cooperative Patrolling via Weighted Tours: Performance Analysis and Distributed AlgorithmsIEEE Transactions on Robotics, 2012
- Persistent Robotic Tasks: Monitoring and Sweeping in Changing EnvironmentsIEEE Transactions on Robotics, 2012
- Sampling-Based Path Planning for a Visual Reconnaissance Unmanned Air VehicleJournal of Guidance, Control, and Dynamics, 2012
- Automatic Battery Replacement System for UAVs: Analysis and DesignJournal of Intelligent & Robotic Systems, 2011
- Energy-aware coverage control with docking for robot teams2011
- General k-opt submoves for the Lin–Kernighan TSP heuristicMathematical Programming Computation, 2009
- A Distributed Heuristic for Energy-Efficient Multirobot Multiplace RendezvousIEEE Transactions on Robotics, 2008
- Coverage Control for Mobile Sensing NetworksIEEE Transactions on Robotics and Automation, 2004
- Finding the k shortest paths2002
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973