mlsanityData to 14 Oct 2026

Motion Planning by Learning the Solution Manifold in Trajectory Optimization

arXiv 2107.05842 ↗First posted 13 Jul 2021cs.RO cs.LGcited by 13

Not on the map. Why?

Abstract (arXiv)

The objective function used in trajectory optimization is often non-convex and can have an infinite set of local optima. In such cases, there are diverse solutions to perform a given task. Although there are a few methods to find multiple solutions for motion planning, they are limited to generating a finite set of solutions. To address this issue, we presents an optimization method that learns an infinite set of solutions in trajectory optimization. In our framework, diverse solutions are obtained by learning latent representations of solutions. Our approach can be interpreted as training a deep generative model of collision-free trajectories for motion planning. The experimental results indicate that the trained model represents an infinite set of homotopic solutions for motion planning problems.

Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). Builds on 30 of its 69 references that are in the map. First posted on arXiv 13 Jul 2021.

Builds on

30 of 69 references.

References · 30

  1. 2013Auto-Encoding Variational Bayescited by 4,053
  2. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
  3. 2021Convex optimizationcited by 2,515
  4. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
  5. 2016InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Netscited by 860
  6. 2018Diversity is All You Need: Learning Skills without a Reward Functioncited by 752
  7. 2018An Algorithmic Perspective on Imitation Learningcited by 459
  8. 2018Data-Efficient Hierarchical Reinforcement Learningcited by 455
  9. 2016The Option-Critic Architecturecited by 448
  10. 2017FeUdal Networks for Hierarchical Reinforcement Learningcited by 337
  11. 2018Inference Suboptimality in Variational Autoencoderscited by 132
  12. 2017Stochastic Neural Networks for Hierarchical Reinforcement Learningcited by 124
18 more
  1. 2018Near-Optimal Representation Learning for Hierarchical Reinforcement Learningcited by 110
  2. 2018Neural probabilistic motor primitives for humanoid controlcited by 97
  3. 2018Understanding and Improving Interpolation in Autoencoders via an Adversarial Regularizercited by 88
  4. 2018Semi-Amortized Variational Autoencoderscited by 83
  5. 2018Learning Disentangled Joint Continuous and Discrete Representationscited by 83
  6. 2020One Solution is Not All You Need: Few-Shot Extrapolation via Structured MaxEnt RLcited by 79
  7. 2017Continuous-Time Gaussian Process Motion Planning via Probabilistic Inferencecited by 49
  8. 2018Directed-Info GAIL: Learning Hierarchical Policies from Unsegmented Demonstrations using Directed Informationcited by 41
  9. 2018Universal Planning Networkscited by 30
  10. 2017Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Searchcited by 23
  11. 2019Harnessing Reinforcement Learning for Neural Motion Planningcited by 21
  12. 2021Discovering Diverse Solutions in Deep Reinforcement Learning by Maximizing State-Action-Based Mutual Informationcited by 19
  13. 2019Learning to Plan in High Dimensions via Neural Exploration-Exploitation Treescited by 18
  14. 2020Multimodal Trajectory Optimization for Motion Planningcited by 12
  15. 2020Describing Physics For Physical Reasoning: Force-based Sequential Manipulation Planningcited by 7
  16. 2019Hierarchical Reinforcement Learning via Advantage-Weighted Information Maximizationcited by 6
  17. 2019Riemannian Motion Policy Fusion through Learnable Lyapunov Function Reshapingcited by 6
  18. 2019Motion Planning Explorer: Visualizing Local Minima using a Local-Minima Treecited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 4; 2023: 1; 2024: 3; 2025: 3; 2026: 2.

13 papers.

Sort:

By area: