Memory of Motion for Warm-starting Trajectory Optimization

Abstract

Trajectory optimization for motion planning requires good initial guesses to obtain good performance. In our proposed approach, we build a memory of motion based on a database of robot paths to provide good initial guesses. The memory of motion relies on function approximators and dimensionality reduction techniques to learn the mapping between the tasks and the robot paths. Three function approximators are compared: $k$-Nearest Neighbor, Gaussian Process Regression, and Bayesian Gaussian Mixture Regression. In addition, we show that the memory can be used as a metric to choose between several possible goals, and using an ensemble method to combine different function approximators results in a significantly improved warm-starting performance. We demonstrate the proposed approach with motion planning examples on the dual-arm robot PR2 and the humanoid robot Atlas.

arXiv comment8 pages

References in corpus (1)

• Bayesian Gaussian mixture model for robotic policy imitation

Cited by in corpus (5)

• Speeding Up Optimization-based Motion Planning through Deep Learning
• Motion Memory: Leveraging Past Experiences to Accelerate Future Motion Planning
• Multi-stage warm started optimal motion planning for over-actuated mobile platforms
• Learning Sampling Distributions Using Local 3D Workspace Decompositions for Motion Planning in High Dimensions
• CoverLib: Classifiers-equipped Experience Library by Iterative Problem Distribution Coverage Maximization for Domain-tuned Motion Planning