Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Fast motion planning from experience: trajectory prediction for speeding up movement generation

Fast motion planning from experience: trajectory prediction for speeding up movement generation 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. This article describes a novel method to learn from such data and speed up motion generation, a method we denote tajectory pediction. The main idea is to use demonstrated optimal motions to quickly predict appropriate trajectories for novel situations. These can be used to initialize and thereby drastically speed-up subsequent optimization of robotic movements. Our approach has two essential ingredients. First, to generalize from previous situations to new ones we need a situation descriptor—we construct features for such descriptors and use a sparse regularized feature selection approach to improve generalization. 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. We present extensive results in simulation to illustrate the benefits of the new method, and demonstrate it also with real robot hardware. Our experiments in diverse tasks show that we can predict good motion trajectories in new situations for which the refinement is much faster than an optimization from scratch. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Autonomous Robots Springer Journals

Fast motion planning from experience: trajectory prediction for speeding up movement generation

Jetchev, Nikolay; Toussaint, Marc
Autonomous Robots , Volume 34 (2) – Jan 12, 2013
Download PDF
17 pages

Loading next page...
 
/lp/springer-journals/fast-motion-planning-from-experience-trajectory-prediction-for-knwk31e9YO

References (33)

Publisher
Springer Journals
Copyright
Copyright © 2013 by Springer Science+Business Media New York
Subject
Engineering; Robotics and Automation; Control, Robotics, Mechatronics; Artificial Intelligence (incl. Robotics); Computer Imaging, Vision, Pattern Recognition and Graphics
ISSN
0929-5593
eISSN
1573-7527
DOI
10.1007/s10514-012-9315-y
Publisher site
See Article on Publisher Site

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. This article describes a novel method to learn from such data and speed up motion generation, a method we denote tajectory pediction. The main idea is to use demonstrated optimal motions to quickly predict appropriate trajectories for novel situations. These can be used to initialize and thereby drastically speed-up subsequent optimization of robotic movements. Our approach has two essential ingredients. First, to generalize from previous situations to new ones we need a situation descriptor—we construct features for such descriptors and use a sparse regularized feature selection approach to improve generalization. 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. We present extensive results in simulation to illustrate the benefits of the new method, and demonstrate it also with real robot hardware. Our experiments in diverse tasks show that we can predict good motion trajectories in new situations for which the refinement is much faster than an optimization from scratch.

Journal

Autonomous Robots – Springer Journals

Published: Jan 12, 2013

There are no references for this article.