Energy Efficient Robot Rendezvous
Authors:
- 1 May 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 139-148
Abstract
We examine the problem of finding a single meeting location for a group of heterogeneous autonomous mobile robots, such that the total system cost of traveling to the rendezvous is minimized. We propose two algorithms that solve this problem. The first method computes an approximate globally optimal meeting point using numerical simplex minimization. The second method is a computationally cheap heuristic that computes a local heading for each robot: by iterating this method, all robots arrive at the globally optimal location. We compare the performance of both methods to a naive algorithm (center of mass). Finally, we show how to extend the methods with inter-robot communication to adapt to new environmental information.Keywords
This publication has 7 references indexed in Scilit:
- The Frugal Feeding Problem: Energy-efficient, multi-robot, multi-place rendezvous2007
- Recharging robot teams: A tanker approach2005
- Reducing spatial interference in robot teams by local-investment aggression2005
- Information based adaptive robotic exploration2003
- Most valuable player: a robot device server for distributed control2002
- The Fermat-Steiner ProblemThe American Mathematical Monthly, 2002
- The vector field histogram-fast obstacle avoidance for mobile robotsIEEE Transactions on Robotics and Automation, 1991