Approximate Inference-based Motion Planning by Learning and Exploiting Low-Dimensional Latent Variable Models
Jung-Su Ha, Hyeok-Joo Chae, Han-Lim Choi

TL;DR
This paper introduces a novel framework that combines low-dimensional latent variable models and approximate inference to efficiently generate high-quality motion plans for high-DOF robots, overcoming the curse of dimensionality.
Contribution
It proposes integrating GP-LVM with an approximate inference algorithm to transform high-dimensional motion planning into a tractable probabilistic inference problem.
Findings
Efficient motion planning for high-DOF robots demonstrated.
Low-dimensional latent space effectively captures complex configurations.
Approximate inference yields high-quality trajectories.
Abstract
This work presents an efficient framework to generate a motion plan of a robot with high degrees of freedom (e.g., a humanoid robot). High-dimensionality of the robot configuration space often leads to difficulties in utilizing the widely-used motion planning algorithms, since the volume of the decision space increases exponentially with the number of dimensions. To handle complications arising from the large decision space, and to solve a corresponding motion planning problem efficiently, two key concepts are adopted in this work: First, the Gaussian process latent variable model (GP-LVM) is utilized for low-dimensional representation of the original configuration space. Second, an approximate inference algorithm is used, exploiting through the duality between control and estimation, to explore the decision space and to compute a high-quality motion trajectory of the robot. Utilizing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsGaussian Process
