2011
DOI: 10.1016/j.automatica.2011.03.004
|View full text |Cite
|
Sign up to set email alerts
|

Time and output warping of control systems: Comparing and imitating motions

Abstract: Abstract-How can one system "mimic" a motion generated by another? To address this question we introduce an optimal tracking problem which additionally optimizes over functions which deform or "warp" the time axis and the output space. Parametric and nonparametric versions of the time-warped tracking problem are introduced and reduced to standard Bolza problems. The output warping problem is treated for piecewise affine output warping functions.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 16 publications
(12 reference statements)
0
0
0
Order By: Relevance
“…For instance, a tracking rate that adapts to system errors has been used in [3] to improve the TT guidance results for underactuated vehicles in the presence of parametric modeling uncertainties, although these authors use the term 'path following' to refer to their implementation. There are other approaches, such as the one inspired by the Dynamic Time Warping (DTW) algorithm (studied extensively in the automatic speech recognition literature) in [4], where a strictly increasing rate of progression ( . r > 0) is selected by minimizing a cost function for finite-duration movements.…”
Section: Introductionmentioning
confidence: 99%
“…For instance, a tracking rate that adapts to system errors has been used in [3] to improve the TT guidance results for underactuated vehicles in the presence of parametric modeling uncertainties, although these authors use the term 'path following' to refer to their implementation. There are other approaches, such as the one inspired by the Dynamic Time Warping (DTW) algorithm (studied extensively in the automatic speech recognition literature) in [4], where a strictly increasing rate of progression ( . r > 0) is selected by minimizing a cost function for finite-duration movements.…”
Section: Introductionmentioning
confidence: 99%