RRT*former: Environment-Aware Sampling-Based Motion Planning using Transformer

• URL: http://arxiv.org/abs/2511.15414v1
• Date: Wed, 19 Nov 2025 13:14:10 GMT
• Title: RRT*former: Environment-Aware Sampling-Based Motion Planning using Transformer
• Authors: Mingyang Feng, Shaoyuan Li, Xiang Yin,
• Abstract summary: We propose a novel sampling-based planning algorithm, called emphRRT*former, which integrates the standard RRT* algorithm with a Transformer network in a novel way.<n>Our experiments demonstrate that, compared to existing sampling-based approaches such as RRT*, Neural RRT*, and their variants, our algorithm achieves considerable improvements in both the optimality of the path and sampling efficiency.
• Score: 13.195728234274803
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We investigate the sampling-based optimal path planning problem for robotics in complex and dynamic environments. Most existing sampling-based algorithms neglect environmental information or the information from previous samples. Yet, these pieces of information are highly informative, as leveraging them can provide better heuristics when sampling the next state. In this paper, we propose a novel sampling-based planning algorithm, called \emph{RRT*former}, which integrates the standard RRT* algorithm with a Transformer network in a novel way. Specifically, the Transformer is used to extract features from the environment and leverage information from previous samples to better guide the sampling process. Our extensive experiments demonstrate that, compared to existing sampling-based approaches such as RRT*, Neural RRT*, and their variants, our algorithm achieves considerable improvements in both the optimality of the path and sampling efficiency. The code for our implementation is available on https://github.com/fengmingyang666/RRTformer.

Related papers

• Swift Sampler: Efficient Learning of Sampler by 10 Parameters [5.595723519561982]
  An effective data sampler assigns proper sampling probability for training data. textbfSS can be applied on large-scale data sets with high efficiency.
  arXiv  Detail & Related papers  (2024-10-08T00:26:29Z)
• TraceMesh: Scalable and Streaming Sampling for Distributed Traces [51.08892669409318]
  TraceMesh is a scalable and streaming sampler for distributed traces. It accommodates previously unseen trace features in a unified and streamlined way. TraceMesh outperforms state-of-the-art methods by a significant margin in both sampling accuracy and efficiency.
  arXiv  Detail & Related papers  (2024-06-11T06:13:58Z)
• Align Your Steps: Optimizing Sampling Schedules in Diffusion Models [63.927438959502226]
  Diffusion models (DMs) have established themselves as the state-of-the-art generative modeling approach in the visual domain and beyond. A crucial drawback of DMs is their slow sampling speed, relying on many sequential function evaluations through large neural networks. We propose a general and principled approach to optimizing the sampling schedules of DMs for high-quality outputs.
  arXiv  Detail & Related papers  (2024-04-22T18:18:41Z)
• CBAGAN-RRT: Convolutional Block Attention Generative Adversarial Network for Sampling-Based Path Planning [0.0]
  We propose a novel image-based learning algorithm using a Convolutional Block Attention Generative Adrial Network (CBAGAN-RRT)<n>Our algorithm outperforms the previous state-of-the-art algorithms using both the image quality generation metrics and path planning metrics.
  arXiv  Detail & Related papers  (2023-05-13T20:06:53Z)
• Towards Automated Imbalanced Learning with Deep Hierarchical Reinforcement Learning [57.163525407022966]
  Imbalanced learning is a fundamental challenge in data mining, where there is a disproportionate ratio of training samples in each class. Over-sampling is an effective technique to tackle imbalanced learning through generating synthetic samples for the minority class. We propose AutoSMOTE, an automated over-sampling algorithm that can jointly optimize different levels of decisions.
  arXiv  Detail & Related papers  (2022-08-26T04:28:01Z)
• Sampling Through the Lens of Sequential Decision Making [9.101505546901999]
  We propose a reward-guided sampling strategy called Adaptive Sample with Reward (ASR) Our approach optimally adjusts the sampling process to achieve optimal performance. Empirical results in information retrieval and clustering demonstrate ASR's superb performance across different datasets.
  arXiv  Detail & Related papers  (2022-08-17T04:01:29Z)
• Adaptive Client Sampling in Federated Learning via Online Learning with Bandit Feedback [31.826205004616227]
  Client sampling plays an important role in federated learning (FL) systems as it affects the convergence rate of optimization algorithms.<n>We propose an online mirror descent (OSMD) algorithm designed to minimize the sampling variance.<n>We show how our sampling method can improve the convergence speed of federated optimization algorithms over the widely used uniform sampling.
  arXiv  Detail & Related papers  (2021-12-28T23:50:52Z)
• Reparameterized Sampling for Generative Adversarial Networks [71.30132908130581]
  We propose REP-GAN, a novel sampling method that allows general dependent proposals by REizing the Markov chains into the latent space of the generator. Empirically, extensive experiments on synthetic and real datasets demonstrate that our REP-GAN largely improves the sample efficiency and obtains better sample quality simultaneously.
  arXiv  Detail & Related papers  (2021-07-01T10:34:55Z)
• Local policy search with Bayesian optimization [73.0364959221845]
  Reinforcement learning aims to find an optimal policy by interaction with an environment. Policy gradients for local search are often obtained from random perturbations. We develop an algorithm utilizing a probabilistic model of the objective function and its gradient.
  arXiv  Detail & Related papers  (2021-06-22T16:07:02Z)
• Generative Adversarial Network based Heuristics for Sampling-based Path Planning [34.368519009432426]
  We present a novel image-based path planning algorithm to overcome limitations of sampling-based path planning. Specifically, a generative adversarial network (GAN) is designed to take the environment map as the input without other preprocessing works. We conduct a number of simulation experiments to validate the effectiveness of the proposed method, and the results demonstrate that our method performs much better in terms of the quality of initial solution and the convergence speed to the optimal solution.
  arXiv  Detail & Related papers  (2020-12-07T07:29:57Z)
• Non-Adaptive Adaptive Sampling on Turnstile Streams [57.619901304728366]
  We give the first relative-error algorithms for column subset selection, subspace approximation, projective clustering, and volume on turnstile streams that use space sublinear in $n$. Our adaptive sampling procedure has a number of applications to various data summarization problems that either improve state-of-the-art or have only been previously studied in the more relaxed row-arrival model.
  arXiv  Detail & Related papers  (2020-04-23T05:00:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.