| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 718080 | IFAC Proceedings Volumes | 2012 | 8 Pages |
Abstract
In this paper we address the heterogeneous multi-vehicle routing problem by proposing a distributed algorithm based on gossip. We consider the case where a set of tasks arbitrarily distributed in a plane, each with a service cost, have to be served by a set of mobile robots, each with a given movement speed and task execution speed. Our goal is to minimize the maximum execution time of robots.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
