Enhancing Path Planning Performance through Image Representation Learning of High-Dimensional Configuration Spaces
Not on the map. Why?
Abstract (arXiv)
This paper presents a novel method for accelerating path-planning tasks in unknown scenes with obstacles by utilizing Wasserstein Generative Adversarial Networks (WGANs) with Gradient Penalty (GP) to approximate the distribution of waypoints for a collision-free path using the Rapidly-exploring Random Tree algorithm. Our approach involves conditioning the WGAN-GP with a forward diffusion process in a continuous latent space to handle multimodal datasets effectively. We also propose encoding the waypoints of a collision-free path as a matrix, where the multidimensional ordering of the waypoints is naturally preserved. This method not only improves model learning but also enhances training convergence. Furthermore, we propose a method to assess whether the trained model fails to accurately capture the true waypoints. In such cases, we revert to uniform sampling to ensure the algorithm's probabilistic completeness; a process that traditionally involves manually determining an optimal ratio for each scenario in other machine learning-based methods. Our experiments demonstrate promising results in accelerating path-planning tasks under critical time constraints. The source code is openly available at https://bitbucket.org/joro3001/imagewgangpplanning/src/master/.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 11 of its 28 references that are in the map. First posted on arXiv 11 Jan 2025.
Builds on
11 of 28 references.
References · 11
- 2017Attention Is All You Needcited by 59,932
- 2017Improved Training of Wasserstein GANscited by 2,223
- 2017Convolutional Sequence to Sequence Learningcited by 550
- 2023Diffusion-based Generation, Optimization, and Planning in 3D Scenescited by 237
- 2021Generative Modeling with Optimal Transport Mapscited by 80
- 2017Learning Sampling Distributions for Robot Motion Planningcited by 79
- 2019Motion Planning Networks: Bridging the Gap Between Learning-based and Classical Motion Plannerscited by 62
- 2024Deep Generative Models in Robotics: A Survey on Learning from Multimodal Demonstrationscited by 35
- 2021Parallelised Diffeomorphic Sampling-based Motion Planningcited by 16
- 2020Generative Adversarial Network based Heuristics for Sampling-based Path Planningcited by 7
- 2020Efficient Heuristic Generation for Robot Path Planning with Recurrent Generative Modelcited by 4
Built on by
Not cited yet.