Cooperative mission planning for a class of carrier-vehicle systems
Name
Frazzoli-2010-Cooperative mission planning for a class.pdf
Size
442.64 KB
Format
Adobe PDF
Checksum (MD5)
a7e4876c3c988b39797c52fec84279d0
Author(s)
Garone, Emanuele
Naldi, Roberto
Casavola, Alessandro
Frazzoli, Emilio
Date Issued
February 2011
Journal
Proceedings of the 49th IEEE Conference on Decision and Control (CDC), 2010
Publisher
Institute of Electrical and Electronics Engineers
Citation
Garone, Emanuele et al. “Cooperative mission planning for a class of carrier-vehicle systems.” IEEE, 2010. 1354-1359. © 2011 IEEE.
Version
Final published version
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/CDC.2010.5717171
