A gossip algorithm for heterogeneous multi-vehicle routing problems

FRANCESCHELLI, MAURO;ROSA, DANIELE;SEATZU, CARLA;Bullo F.

2012-01-01

---

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.