Cooperative mission planning for a class of carrier-vehicle systems
Author(s)Garone, Emanuele; Naldi, Roberto; Casavola, Alessandro; Frazzoli, Emilio
MetadataShow full item record
In this work we focus on mission planning problems in scenarios in which a carrier vehicle, typically slow but with virtually infinite range, and a carried vehicle, which on the contrary is typically fast but has a shorter range, are coordinated to make the faster vehicle visit a given collection of points in minimum time. In particular in this paper we will address two mission planning problems: a first one, in which we have to sequentially visit a list of points under the hypothesis the takeoff/landing sequence is not determined a priori and a second one, a Traveling Salesman Problem (TSP), in which the optimal visiting sequence of points has to be determined. Those two problems will be analyzed, sub-optimal heuristics will be presented and their properties pointed out.
DepartmentMassachusetts Institute of Technology. Department of Aeronautics and Astronautics
Proceedings of the 49th IEEE Conference on Decision and Control (CDC), 2010
Institute of Electrical and Electronics Engineers
Garone, Emanuele et al. “Cooperative mission planning for a class of carrier-vehicle systems.” IEEE, 2010. 1354-1359. © 2011 IEEE.
Final published version
INSPEC Accession Number: 11848469