Asymptotic Optimality of a Time Optimal Path Parametrization Algorithm

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.