|
|
|
|
| LEADER |
01347 am a22002053u 4500 |
| 001 |
126543 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Spasojevic, Igor
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
|e contributor
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
|e contributor
|
| 700 |
1 |
0 |
|a Murali, Varun
|e author
|
| 700 |
1 |
0 |
|a Karaman, Sertac
|e author
|
| 245 |
0 |
0 |
|a Asymptotic Optimality of a Time Optimal Path Parametrization Algorithm
|
| 260 |
|
|
|b Institute of Electrical and Electronics Engineers (IEEE),
|c 2020-08-12T16:15:53Z.
|
| 856 |
|
|
|z Get fulltext
|u https://hdl.handle.net/1721.1/126543
|
| 520 |
|
|
|a 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.
|
| 546 |
|
|
|a en
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t 10.1109/LCSYS.2019.2919809
|
| 773 |
|
|
|t IEEE Control Systems Letters
|
