A Distributed Heuristic for Energy-Efficient Multirobot Multiplace Rendezvous
Authors:
- 18 November 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 25 (1) , 130-135
Abstract
We consider the problem of finding a set of trajectories for a heterogeneous group of mobile robots, such that a single service robot can rendezvous with every other member of the team in a prescribed order, and the total travel cost is minimized. We present a simple heuristic controller that runs independently on each robot, yet is guaranteed to achieve an approximation to global solution in bounded time linear in population size. Simulation experiments empirically show that the method finds approximated solutions of near-optimal quality on average.Keywords
This publication has 11 references indexed in Scilit:
- Curve Shortening and the Rendezvous Problem for Mobile Autonomous RobotsIEEE Transactions on Automatic Control, 2007
- Energy Efficient Robot Rendezvous2007
- The Frugal Feeding Problem: Energy-efficient, multi-robot, multi-place rendezvous2007
- Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary DimensionsIEEE Transactions on Automatic Control, 2006
- Recharging robot teams: A tanker approach2005
- The multi-agent rendezvous problem2004
- Geometric Methods and Optimization Problems1999
- Distributed memoryless point convergence algorithm for mobile robots with limited visibilityIEEE Transactions on Robotics and Automation, 1999
- A Newton Acceleration of the Weiszfeld Algorithm for Minimizing the Sum of Euclidean DistancesComputational Optimization and Applications, 1998
- Computational Comparison of Two Algorithms for the Euclidean Single Facility Location ProblemINFORMS Journal on Computing, 1991