Global Tensor Motion Planning

• URL: http://arxiv.org/abs/2411.19393v3
• Date: Thu, 29 May 2025 07:05:44 GMT
• Title: Global Tensor Motion Planning
• Abstract summary: Global Motion Planning (GTMP) is a sampling-based motion planning algorithm comprising only tensor operations.<n>We introduce a novel discretization structure represented as a random multipartite graph, enabling efficient vectorized sampling, collision checking, and search.<n> Experiments on lidar-scanned occupancy maps and the MotionBenchMarker dataset demonstrate GTMP's efficiency in batch planning compared to baselines.
• Score: 18.678206099088843
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Batch planning is increasingly necessary to quickly produce diverse and quality motion plans for downstream learning applications, such as distillation and imitation learning. This paper presents Global Tensor Motion Planning (GTMP) -- a sampling-based motion planning algorithm comprising only tensor operations. We introduce a novel discretization structure represented as a random multipartite graph, enabling efficient vectorized sampling, collision checking, and search. We provide a theoretical investigation showing that GTMP exhibits probabilistic completeness while supporting modern GPU/TPU. Additionally, by incorporating smooth structures into the multipartite graph, GTMP directly plans smooth splines without requiring gradient-based optimization. Experiments on lidar-scanned occupancy maps and the MotionBenchMarker dataset demonstrate GTMP's computation efficiency in batch planning compared to baselines, underscoring GTMP's potential as a robust, scalable planner for diverse applications and large-scale robot learning tasks.

Related papers

• Anytime Global Tensor Motion Planning [1.1470070927586018]
  Global Motion Planning (GTMP) solves motion planning with batched tensor operations over a layered multipartite graph.<n>We generalize GTMP so that adjacent-layer edges are realized by any black-box local planner.<n>We provide two anytime policies on top of this generalization: Anytime GTMP with random restarts at a fixed budget, and AO-GTMP with informed expansion with growing budgets.
  arXiv  Detail & Related papers  (2026-08-26T14:08:22Z)
• Fast Asymptotically Optimal Kinodynamic Planning via Vectorization [0.764671395172401]
  We present Parallel Asymptotically Optimal Kinodynamic RRTPAKR, a massively parallel kinodynamic planner leveraging JAX and the XLA compiler.<n>By combining our parallel planner with the AO-x meta-algorithm, we achieve optimality through fast iterative replanning.
  arXiv  Detail & Related papers  (2026-07-04T19:07:03Z)
• Coupling Tensor Trains with Graph of Convex Sets: Effective Compression, Exploration, and Planning in the C-Space [2.449133239966462]
  We present TANGO, a novel motion planning framework that integrates tensor-based compression with structured graph optimization.<n>By coupling tensor-based compression with structured graph reasoning, TANGO enables efficient, geometry-aware motion planning and lays the groundwork for more expressive and scalable representations of configuration space in future robotic systems.
  arXiv  Detail & Related papers  (2026-03-12T08:28:06Z)
• ViterbiPlanNet: Injecting Procedural Knowledge via Differentiable Viterbi for Planning in Instructional Videos [15.697653554425045]
  Procedural planning aims to predict a sequence of actions that transforms an initial visual state into a desired goal.<n>Existing approaches rely on large-scale models that learn procedural structures implicitly.<n>We introduce ViterbiPlanNet, a principled framework that explicitly integrates procedural knowledge into the learning process.
  arXiv  Detail & Related papers  (2026-03-04T16:50:07Z)
• GAIDE: Graph-based Attention Masking for Spatial- and Embodiment-aware Motion Planning [3.4672098154671995]
  We introduce Graph-based Attention Masking for Spatial- and Embodiment-aware Motion Planning (GAIDE)<n>GAIDE represents these structures as a graph and integrates it into a transformer-based neural sampler through attention masking.<n>We evaluate GAIDE against baseline state-of-the-art sampling-based planners using uniform sampling, hand-crafted informed sampling, and neural informed sampling primitives.
  arXiv  Detail & Related papers  (2026-03-03T17:35:16Z)
• Multi Graph Search for High-Dimensional Robot Motion Planning [18.868434737285412]
  Multi-Graph Search (MGS) is a search-based motion planning algorithm that generalizes classical unidirectional and bidirectional search to a multi-graph setting.<n>We prove that MGS is complete and bounded-suboptimal, and empirically demonstrate its effectiveness on a range of manipulation and mobile manipulation tasks.
  arXiv  Detail & Related papers  (2026-02-12T15:50:15Z)
• Parallel Stochastic Gradient-Based Planning for World Models [39.699893143984916]
  We propose a robust and highly parallelizable planner that leverages the differentiability of the learned world model for efficient optimization.<n>Our method treats states as optimization variables ("virtual states") with soft dynamics constraints, enabling parallel and easier optimization.<n>Our planner, which we call GRASP (GradAxed Planner), can be viewed as a valid version of a non-condensed or collocation-based optimal controller.
  arXiv  Detail & Related papers  (2026-01-31T02:57:47Z)
• Closing the Train-Test Gap in World Models for Gradient-Based Planning [64.36544881136405]
  We propose improved methods for training world models that enable efficient gradient-based planning.<n>At test time, our approach outperforms or matches the classical gradient-free cross-entropy method.
  arXiv  Detail & Related papers  (2025-12-10T18:59:45Z)
• Planning with Sketch-Guided Verification for Physics-Aware Video Generation [71.29706409814324]
  We propose SketchVerify as a training-free, sketch-verification-based planning framework for video generation.<n>Our method predicts multiple candidate motion plans and ranks them using a vision-language verifier.<n>We iteratively refine the motion plan until a satisfactory one is identified, which is then passed to the trajectory-conditioned generator for final synthesis.
  arXiv  Detail & Related papers  (2025-11-21T17:48:02Z)
• Search-Based Robot Motion Planning With Distance-Based Adaptive Motion Primitives [1.8874301050354767]
  This work proposes a motion planning algorithm for robotic manipulators that combines sampling-based and search-based planning methods.<n>The core contribution of the proposed approach is the usage of burs of free configuration space (C-space) as adaptive motion primitives.<n>Results demonstrate that the bur-based approach outperforms fixed-primitive planning in complex scenarios.
  arXiv  Detail & Related papers  (2025-07-01T21:33:33Z)
• Plan-over-Graph: Towards Parallelable LLM Agent Schedule [53.834646147919436]
  Large Language Models (LLMs) have demonstrated exceptional abilities in reasoning for task planning. This paper introduces a novel paradigm, plan-over-graph, in which the model first decomposes a real-life textual task into executable subtasks and constructs an abstract task graph. The model then understands this task graph as input and generates a plan for parallel execution.
  arXiv  Detail & Related papers  (2025-02-20T13:47:51Z)
• DHIL-GT: Scalable Graph Transformer with Decoupled Hierarchy Labeling [10.556366638048384]
  Graph Transformer (GT) has recently emerged as a promising neural network architecture for learning graph-structured data. We propose DHIL-GT, a scalable Graph Transformer that simplifies network learning by fully decoupling the graph computation to a separate stage in advance. DHIL-GT is efficient in terms of computational boost and mini-batch capability over existing scalable Graph Transformer designs on large-scale benchmarks.
  arXiv  Detail & Related papers  (2024-12-06T02:59:01Z)
• Real-Time Polygonal Semantic Mapping for Humanoid Robot Stair Climbing [19.786955745157453]
  We present a novel algorithm for real-time planar semantic mapping tailored for humanoid robots navigating complex terrains such as staircases. We utilize an anisotropic diffusion filter on depth images to effectively minimize noise from gradient jumps while preserving essential edge details. Our approach achieves real-time performance, processing single frames at rates exceeding $30Hz$, which facilitates detailed plane extraction and map management swiftly and efficiently.
  arXiv  Detail & Related papers  (2024-11-04T09:34:55Z)
• Searching for Efficient Linear Layers over a Continuous Space of Structured Matrices [88.33936714942996]
  We present a unifying framework that enables searching among all linear operators expressible via an Einstein summation. We show that differences in the compute-optimal scaling laws are mostly governed by a small number of variables. We find that Mixture-of-Experts (MoE) learns an MoE in every single linear layer of the model, including the projection in the attention blocks.
  arXiv  Detail & Related papers  (2024-10-03T00:44:50Z)
• Learning to Explore for Stochastic Gradient MCMC [15.286308920219446]
  We propose a meta-learning strategy to build glssgmcmc which can efficiently explore the multi-modal target distributions. Our algorithm allows the learned SGMCMC to quickly explore the high-density region of the posterior landscape.
  arXiv  Detail & Related papers  (2024-08-17T08:36:42Z)
• A Meta-Engine Framework for Interleaved Task and Motion Planning using Topological Refinements [51.54559117314768]
  Task And Motion Planning (TAMP) is the problem of finding a solution to an automated planning problem. We propose a general and open-source framework for modeling and benchmarking TAMP problems. We introduce an innovative meta-technique to solve TAMP problems involving moving agents and multiple task-state-dependent obstacles.
  arXiv  Detail & Related papers  (2024-08-11T14:57:57Z)
• Unlocking Large Language Model's Planning Capabilities with Maximum Diversity Fine-tuning [10.704716790096498]
  Large language models (LLMs) have demonstrated impressive task-solving capabilities, achieved through either prompting techniques or system designs. This paper investigates the impact of fine-tuning on LLMs' planning capabilities. We propose the Maximum Diversity Fine-Tuning (MDFT) strategy to improve the sample efficiency of fine-tuning in the planning domain.
  arXiv  Detail & Related papers  (2024-06-15T03:06:14Z)
• Transformer-Enhanced Motion Planner: Attention-Guided Sampling for State-Specific Decision Making [6.867637277944729]
  Transformer-Enhanced Motion Planner (TEMP) is a novel deep learning-based motion planning framework. TEMP synergizes an Environmental Information Semantic (EISE) with a Motion Planning Transformer (MPT)
  arXiv  Detail & Related papers  (2024-04-30T09:48:11Z)
• Provably Efficient Representation Learning with Tractable Planning in Low-Rank POMDP [81.00800920928621]
  We study representation learning in partially observable Markov Decision Processes (POMDPs) We first present an algorithm for decodable POMDPs that combines maximum likelihood estimation (MLE) and optimism in the face of uncertainty (OFU) We then show how to adapt this algorithm to also work in the broader class of $gamma$-observable POMDPs.
  arXiv  Detail & Related papers  (2023-06-21T16:04:03Z)
• Reconfigurable Distributed FPGA Cluster Design for Deep Learning Accelerators [59.11160990637615]
  We propose a distributed system based on lowpower embedded FPGAs designed for edge computing applications. The proposed system can simultaneously execute diverse Neural Network (NN) models, arrange the graph in a pipeline structure, and manually allocate greater resources to the most computationally intensive layers of the NN graph.
  arXiv  Detail & Related papers  (2023-05-24T16:08:55Z)
• Energy-efficient Task Adaptation for NLP Edge Inference Leveraging Heterogeneous Memory Architectures [68.91874045918112]
  adapter-ALBERT is an efficient model optimization for maximal data reuse across different tasks. We demonstrate the advantage of mapping the model to a heterogeneous on-chip memory architecture by performing simulations on a validated NLP edge accelerator.
  arXiv  Detail & Related papers  (2023-03-25T14:40:59Z)
• EasyDGL: Encode, Train and Interpret for Continuous-time Dynamic Graph Learning [92.71579608528907]
  This paper aims to design an easy-to-use pipeline (termed as EasyDGL) composed of three key modules with both strong ability fitting and interpretability. EasyDGL can effectively quantify the predictive power of frequency content that a model learn from the evolving graph data.
  arXiv  Detail & Related papers  (2023-03-22T06:35:08Z)
• h-analysis and data-parallel physics-informed neural networks [0.7614628596146599]
  We explore the data-parallel acceleration of machine learning schemes with a focus on physics-informed neural networks (PINNs) We detail a novel protocol based on $h$-analysis and data-parallel acceleration through the Horovod training framework. We show that the acceleration is straightforward to implement, does not compromise training, and proves to be highly efficient and controllable.
  arXiv  Detail & Related papers  (2023-02-17T12:15:18Z)
• Sequence-Based Plan Feasibility Prediction for Efficient Task and Motion Planning [36.300564378022315]
  We present a learning-enabled Task and Motion Planning (TAMP) algorithm for solving mobile manipulation problems in environments with many articulated and movable obstacles. The core of our algorithm is PIGINet, a novel Transformer-based learning method that takes in a task plan, the goal, and the initial state, and predicts the probability of finding motion trajectories associated with the task plan.
  arXiv  Detail & Related papers  (2022-11-03T04:12:04Z)
• Visual Learning-based Planning for Continuous High-Dimensional POMDPs [81.16442127503517]
  Visual Tree Search (VTS) is a learning and planning procedure that combines generative models learned offline with online model-based POMDP planning. VTS bridges offline model training and online planning by utilizing a set of deep generative observation models to predict and evaluate the likelihood of image observations in a Monte Carlo tree search planner. We show that VTS is robust to different observation noises and, since it utilizes online, model-based planning, can adapt to different reward structures without the need to re-train.
  arXiv  Detail & Related papers  (2021-12-17T11:53:31Z)
• A Graph Deep Learning Framework for High-Level Synthesis Design Space Exploration [11.154086943903696]
  High-Level Synthesis is a solution for fast prototyping application-specific hardware. We propose HLS, for the first time in the literature, graph neural networks that jointly predict acceleration performance and hardware costs. We show that our approach achieves prediction accuracy comparable with that of commonly used simulators.
  arXiv  Detail & Related papers  (2021-11-29T18:17:45Z)
• PnP-DETR: Towards Efficient Visual Analysis with Transformers [146.55679348493587]
  Recently, DETR pioneered the solution vision tasks with transformers, it directly translates the image feature map into the object result. Recent transformer-based image recognition model andTT show consistent efficiency gain.
  arXiv  Detail & Related papers  (2021-09-15T01:10:30Z)

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.