Reaching Through Latent Space: From Joint Statistics to Path Planning in Manipulation
Not on the map. Why?
Abstract (arXiv)
We present a novel approach to path planning for robotic manipulators, in which paths are produced via iterative optimisation in the latent space of a generative model of robot poses. Constraints are incorporated through the use of constraint satisfaction classifiers operating on the same space. Optimisation leverages gradients through our learned models that provide a simple way to combine goal reaching objectives with constraint satisfaction, even in the presence of otherwise non-differentiable constraints. Our models are trained in a task-agnostic manner on randomly sampled robot poses. In baseline comparisons against a number of widely used planners, we achieve commensurate performance in terms of task success, planning time and path length, performing successful path planning with obstacle avoidance on a real 7-DoF robot arm.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 17 of its 44 references that are in the map. First posted on arXiv 21 Oct 2022.
Builds on
17 of 44 references.
References · 17
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2013Auto-Encoding Variational Bayescited by 3,980
- 2018Learning Latent Dynamics for Planning from Pixelscited by 1,221
- 2016Learning Hand-Eye Coordination for Robotic Grasping with Deep Learning and Large-Scale Data Collectioncited by 312
- 2015Embed to Control: A Locally Linear Latent Dynamics Model for Control from Raw Imagescited by 266
- 2016Deep Variational Bayes Filters: Unsupervised Learning of State Space Models from Raw Datacited by 154
- 2017InfoVAE: Information Maximizing Variational Autoencoderscited by 124
- 2018Taming VAEscited by 85
- 2018Motion Planning Networkscited by 78
- 2017Continuous-Time Gaussian Process Motion Planning via Probabilistic Inferencecited by 49
- 2018Riemannian Motion Policiescited by 45
- 2018Robot Motion Planning in Learned Latent Spacescited by 40
5 more
- 2017Robust Locally-Linear Controllable Embeddingcited by 37
- 2013Fast Marching Tree: a Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensionscited by 25
- 2017Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Searchcited by 22
- 2020Neural Manipulation Planning on Constraint Manifoldscited by 15
- 2020First Steps: Latent-Space Control with Semantic Constraints for Quadruped Locomotioncited by 7
Built on by
Citing papers per year: 2023: 3; 2024: 2; 2025: 2; 2026: 1.
8 papers.
- 2024Neural Contractive Dynamical Systemscited by 14
- 2023Leveraging Scene Embeddings for Gradient-Based Motion Planning in Latent Spacecited by 4
- 2023Fine-Tuning Generative Models as an Inference Method for Robotic Taskscited by 4
- 2023Approximate Shielding of Atari Agents for Safe Explorationcited by 2
- 2024Extended Neural Contractive Dynamical Systems: On Multiple Tasks and Riemannian Safety Regionscited by 1
- 2026Toward Generalist Neural Motion Planners for Robotic Manipulators: Challenges and Opportunitiescited by 1
- 2025Improving Trajectory Stitching with Flow Modelscited by 0
- 2025A Cross-Environment and Cross-Embodiment Path Planning Framework via a Conditional Diffusion Modelcited by 0
- 2026Toward Generalist Neural Motion Planners for Robotic Manipulators: Challenges and Opportunities25 Mar 2026
- 2025A Cross-Environment and Cross-Embodiment Path Planning Framework via a Conditional Diffusion Model21 Oct 2025
- 2025Improving Trajectory Stitching with Flow Models12 May 2025
- 2024Extended Neural Contractive Dynamical Systems: On Multiple Tasks and Riemannian Safety Regions18 Nov 2024
- 2024Neural Contractive Dynamical Systems17 Jan 2024
- 2023Fine-Tuning Generative Models as an Inference Method for Robotic Tasks19 Oct 2023
- 2023Approximate Shielding of Atari Agents for Safe Exploration21 Apr 2023
- 2023Leveraging Scene Embeddings for Gradient-Based Motion Planning in Latent Space6 Mar 2023