Traveling salesperson problems for a double integrator
Name
Savla-2009-Traveling Salesperso.pdf
Size
372.49 KB
Format
Adobe PDF
Checksum (MD5)
58641a9c29407e0d0eb9f7375745585e
Author(s) • •
Savla, Ketan
Bullo, Francesco
Frazzoli, Emilio
Date Issued
April 2009
Journal
IEEE Transactions on Automatic Control
Publisher
Institute of Electrical and Electronics Engineers
Citation
Savla, K., F. Bullo, and E. Frazzoli. “Traveling Salesperson Problems for a Double Integrator.” Automatic Control, IEEE Transactions on 54.4 (2009): 788-793. © 2009 IEEE
Version
Final published version
Abstract
This technical note studies the following version of the Traveling Salesperson Problem (TSP) for a double integrator with bounded velocity and bounded control inputs: given a set of points in Ropf[superscript d], find the fastest tour over the point set. We first give asymptotic bounds on the time taken to complete such a tour in the worst case. Then, we study a stochastic version of the TSP for a double integrator in Ropf[superscript 2] and Ropf[superscript 3], where we propose novel algorithms that asymptotically perform within a constant factor of the optimal strategy with probability one. Lastly, we study a dynamic TSP in Ropf[superscript 2] and Ropf[superscript 3] , where we propose novel stabilizing algorithms whose performances are within a constant factor from the optimum.
Subjects
traveling salesperson problem (TSP)
Dynamic traveling repairperson problem (DTRP)
MIT Department
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
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
http://dx.doi.org/10.1109/TAC.2008.2007856