Asymptotic Optimality of a Time Optimal Path Parametrization Algorithm

Author(s)
Spasojevic, Igor; Murali, Varun; Karaman, Sertac
Thumbnail
DownloadSubmitted version (306.1Kb)
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
The time optimal path parametrization problem addresses minimizing the traversal time of a specified path by an actuation constrained agent. Recently, an efficient numerical algorithm for solving this problem has been proposed. This letter theoretically establishes convergence of the former algorithm to the optimum for the whole class of problems solved optimally by computationally more demanding approaches based on convex programming. Additionally, we provide a characterization of the optimum, which may be of independent interest.
Date issued
2019-05
URI
https://hdl.handle.net/1721.1/126543
Department
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems; Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Journal
IEEE Control Systems Letters
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Spasojevic, Igor, Varun Murali and Sertac Karaman. “Asymptotic Optimality of a Time Optimal Path Parametrization Algorithm.” IEEE Control Systems Letters, vol. 3, no. 4, 2019, pp. 835 - 840 © 2019 The Author(s)
Version: Original manuscript
ISSN
2475-1456
Collections