A Distributed Heuristic for Energy-Efficient Multirobot Multiplace Rendezvous

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 i...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on robotics Vol. 25; no. 1; pp. 130 - 135
Main Authors Litus, Y., Zebrowski, P., Vaughan, R.T.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.02.2009
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1552-3098
1941-0468
DOI:10.1109/TRO.2008.2007459