In this work we formulate and study a Travelling Salesman Problem (TSP) for a scenario in which two different vehicles cooperate so as to perform a desired task in an optimal way. In particular we consider the problem where a fast vehicle with a short operative range has to be coordinated with a carrier vehicle, typically slower but with virtually infinite operativity range, in order to visit in the shortest time a given collection of points.
A travelling salesman problem for a class of heterogeneous multi-vehicle systems2012 IEEE 51st IEEE Conference on Decision and Control (CDC) / Emanuele Garone;Jean-Francois Determe; Roberto Naldi. - ELETTRONICO. - (2012), pp. 1166-1171. (Intervento presentato al convegno IEEE Conference on Decision and Control tenutosi a Maui, HI, USA nel 10-13 December 2012) [10.1109/CDC.2012.6426488].
A travelling salesman problem for a class of heterogeneous multi-vehicle systems2012 IEEE 51st IEEE Conference on Decision and Control (CDC)
NALDI, ROBERTO
2012
Abstract
In this work we formulate and study a Travelling Salesman Problem (TSP) for a scenario in which two different vehicles cooperate so as to perform a desired task in an optimal way. In particular we consider the problem where a fast vehicle with a short operative range has to be coordinated with a carrier vehicle, typically slower but with virtually infinite operativity range, in order to visit in the shortest time a given collection of points.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
