2020
DOI: 10.1109/lra.2020.2972893
|View full text |Cite
|
Sign up to set email alerts
|

Memory of Motion for Warm-Starting Trajectory Optimization

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
27
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
4

Relationship

2
7

Authors

Journals

citations
Cited by 39 publications
(27 citation statements)
references
References 22 publications
0
27
0
Order By: Relevance
“…The problem of inferring the warm start is formulated as a regression problem g(θ) = y where the input task consists of the current robot state and goal location, and the output y consists of the corresponding state and control trajectories. Such a memory of motion [27], [38] has been shown to improve the convergence of DDP significantly. It relies on a dataset of optimal trajectories built off-line and encoded by machine learning.…”
Section: A Building the Memory Datasetmentioning
confidence: 99%
See 1 more Smart Citation
“…The problem of inferring the warm start is formulated as a regression problem g(θ) = y where the input task consists of the current robot state and goal location, and the output y consists of the corresponding state and control trajectories. Such a memory of motion [27], [38] has been shown to improve the convergence of DDP significantly. It relies on a dataset of optimal trajectories built off-line and encoded by machine learning.…”
Section: A Building the Memory Datasetmentioning
confidence: 99%
“…Yet the task considered in this work is multimodal, i.e., there are several qualitatively different trajectories to achieve one task. For such problem, GPR performs poorly as observed in [38], hence we choose NN in this work instead.…”
Section: A Building the Memory Datasetmentioning
confidence: 99%
“…1) Learning Single-step Motion: Following our previous work [23], we formulate the problem of learning the singlestep motion as a regression problem to approximate the mapping f : x → y, where x is the task and y is the corresponding trajectory output. We separate the database into left-leg and right-leg movements, as this yields better results than combining both and let the memory learns how to choose the leg.…”
Section: Learning Strategiesmentioning
confidence: 99%
“…The research has been supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany's Excellence Strategy. 1 Learning & Intelligent Systems Lab, TU Berlin, Germany 2 BITS Pilani, India the initial trajectory [21], [19], [10]. Hence, these methods usually work well in environments with few obstacles or when provided with good initial guesses [20], e.g.…”
Section: Introductionmentioning
confidence: 99%