Asymptotic Optimality of a Time Optimal Path Parametrization Algorithm.

IEEE Control Systems Letters(2019)

Cited 3|Views3
No score
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 ...
More
Translated text
Key words
Acceleration,Convex functions,Automobiles,Upper bound,Indexes,Robots,Switches
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined