Trajectory prediction: learning to map situations to robot trajectories
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Trajectory planning and optimization is a fundamental problem in articulated robotics. Algorithms used typically for this problem compute optimal trajectories from scratch in a new situation. In effect, extensive data is accumulated containing situations together with the respective optimized trajectories - but this data is in practice hardly exploited. The aim of this paper is to learn from this data. Given a new situation we want to predict a suitable trajectory which only needs minor refinement by a conventional optimizer. Our approach has two essential ingredients. First, to generalize from previous situations to new ones we need an appropriate situation descriptor - we propose a sparse feature selection approach to find such well-generalizing features of situations. Second, the transfer of previously optimized trajectories to a new situation should not be made in joint angle space - we propose a more efficient task space transfer of old trajectories to new situations. Experiments on a simulated humanoid reaching problem show that we can predict reasonable motion prototypes in new situations for which the refinement is much faster than an optimization from scratch.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Estimating the sources of motor errors for adaptation and generalization
Berniker, M., & Kording, K. (2008) · Nature Neuroscience · doi:10.1038/nn.2229 · Cited by 316 · cited 2×
“This choice of task space helps to generalize to translations in obstacle position, see (Berniker & Kording, 2008).”
Background
Cited by
A policy-blending formalism for shared control
Dragan, A. D., & Srinivasa, S. S. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913490324 · Cited by 387
“…to struggle with high-cost local minima in the complex spaces induced by manipulation tasks, this issue can be alleviated to a certain extent by learning to place the optimizer in good basins of attraction from prior experience (Jetchev and Toussaint, 2009; Dragan et al., 2011a; Dey et al., 2012).”
BackgroundTrajectory planning for optimal robot catching in real-time
Lampariello, R., Nguyen-Tuong, D., Castellini, C., Hirzinger, G., & Peters, J. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980114 · Cited by 117
Learning to Play Minigolf: A Dynamical System-Based Approach
Khansari-Zadeh, S. M., Kronander, K., & Billard, A. (2012) · Advanced Robotics · doi:10.1080/01691864.2012.728692 · Cited by 28
Metadata
- Authors
- Jetchev, N., & Toussaint, M.
- Venue
- Proceedings of the 26th Annual International Conference on Machine Learning
- Publisher
- ACM
- Published
- 2009-06-14
- Pages
- 449-456
- OpenAlex
- W2141853154
- Cited by
- 52
- References
- 1
- FWCI
- 6.16
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.