mlsanityData to 14 Oct 2026

Parallelised Diffeomorphic Sampling-based Motion Planning

arXiv 2108.11775 ↗First posted 26 Aug 2021cs.RO cs.LGcited by 16

Not on the map. Why?

Abstract (arXiv)

We propose Parallelised Diffeomorphic Sampling-based Motion Planning (PDMP). PDMP is a novel parallelised framework that uses bijective and differentiable mappings, or diffeomorphisms, to transform sampling distributions of sampling-based motion planners, in a manner akin to normalising flows. Unlike normalising flow models which use invertible neural network structures to represent these diffeomorphisms, we develop them from gradient information of desired costs, and encode desirable behaviour, such as obstacle avoidance. These transformed sampling distributions can then be used for sampling-based motion planning. A particular example is when we wish to imbue the sampling distribution with knowledge of the environment geometry, such that drawn samples are less prone to be in collisions. To this end, we propose to learn a continuous occupancy representation from environment occupancy data, such that gradients of the representation defines a valid diffeomorphism and is amenable to fast parallel evaluation. We use this to "morph" the sampling distribution to draw far fewer collision-prone samples. PDMP is able to leverage gradient information of costs, to inject specifications, in a manner similar to optimisation-based motion planning methods, but relies on drawing from a sampling distribution, retaining the tendency to find more global solutions, thereby bridging the gap between trajectory optimisation and sampling-based planning methods.

Key facts. Cited by 16 papers in the map (data through 14 Oct 2026). Builds on 12 of its 32 references that are in the map. First posted on arXiv 26 Aug 2021.

Builds on

12 of 32 references.

References · 12

  1. 2019DeepSDF: Learning Continuous Signed Distance Functions for Shape Representationcited by 2,689
  2. 2015Variational Inference with Normalizing Flowscited by 2,170
  3. 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,323
  4. 2019Neural Spline Flowscited by 596
  5. 2018Analyzing Inverse Problems with Invertible Neural Networkscited by 242
  6. 2018PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learningcited by 90
  7. 2017Learning Sampling Distributions for Robot Motion Planningcited by 82
  8. 2018Balancing Global Exploration and Local-connectivity Exploitation with Rapidly-exploring Random disjointed-Treescited by 8
  9. 2019Bayesian Local Sampling-based Planningcited by 7
  10. 2017Informed Sampling for Asymptotically Optimal Path Planning (Consolidated Version)cited by 5
  11. 2020Learning to Plan Optimally with Flow-based Motion Plannercited by 3
  12. 2021Rapidly-exploring Random Forest: Adaptively Exploits Local Structure with Generalised Multi-Trees Motion Planningcited by 3

Built on by

Cited by year (2026 to 14 Oct)

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

16 papers.

Sort:

By area: