GAIDE: Graph-based Attention Masking for Spatial- and Embodiment-aware Motion Planning

• URL: http://arxiv.org/abs/2603.04463v1
• Date: Tue, 03 Mar 2026 17:35:16 GMT
• Title: GAIDE: Graph-based Attention Masking for Spatial- and Embodiment-aware Motion Planning
• Abstract summary: 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.
• Score: 3.4672098154671995
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Sampling-based motion planning algorithms are widely used for motion planning of robotic manipulators, but they often struggle with sample inefficiency in high-dimensional configuration spaces due to their reliance on uniform or hand-crafted informed sampling primitives. Neural informed samplers address this limitation by learning the sampling distribution from prior planning experience to guide the motion planner towards planning goal. However, existing approaches often struggle to encode the spatial structure inherent in motion planning problems. To address this limitation, we introduce Graph-based Attention Masking for Spatial- and Embodiment-aware Motion Planning (GAIDE), a neural informed sampler that leverages both the spatial structure of the planning problem and the robotic manipulator's embodiment to guide the planning algorithm. GAIDE represents these structures as a graph and integrates it into a transformer-based neural sampler through attention masking. We evaluate GAIDE against baseline state-of-the-art sampling-based planners using uniform sampling, hand-crafted informed sampling, and neural informed sampling primitives. Evaluation results demonstrate that GAIDE improves planning efficiency and success rate.

Related papers

• Self-Supervised Bio-Inspired Robotic Trajectory Planning with Obstacle Avoidance [0.0]
  Trajectory planning is a fundamental problem in robotics, requiring the generation of collision-free and efficient trajectories in a potentially complex environment.<n>While sampling-based planners remain the dominant approach, they are often computationally expensive, particularly in high-dimensional spaces and obstacle-rich environments.<n> Methods based on model learning offer a promising alternative, enabling efficient planning through a bounded number of forward passes through a neural trajectory planner.
  arXiv  Detail & Related papers  (2026-07-22T21:47:56Z)
• Navigating the Clutter: Waypoint-Based Bi-Level Planning for Multi-Robot Systems [54.887871365121775]
  Multi-robot control in cluttered environments is a challenging problem that involves complex physical constraints.<n>We propose a hybrid multi-robot control framework that jointly optimize task and motion planning.<n>Our approach consistently improves task success over motion-agnostic and VLA-based baselines.
  arXiv  Detail & Related papers  (2026-04-22T22:58:47Z)
• Spatially Grounded Long-Horizon Task Planning in the Wild [49.614308474374035]
  GroundedPlanBench is a newly curated benchmark for spatially grounded long-horizon action planning in the wild.<n>Video-to-Spatially Grounded Planning (V2GP) is an automated data generation framework that leverages real-world robot video demonstrations to improve spatially grounded long-horizon planning.
  arXiv  Detail & Related papers  (2026-03-13T05:42:18Z)
• Global Tensor Motion Planning [18.678206099088843]
  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.
  arXiv  Detail & Related papers  (2024-11-28T22:07:46Z)
• 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)
• Planning as In-Painting: A Diffusion-Based Embodied Task Planning Framework for Environments under Uncertainty [56.30846158280031]
  Task planning for embodied AI has been one of the most challenging problems. We propose a task-agnostic method named 'planning as in-painting' The proposed framework achieves promising performances in various embodied AI tasks.
  arXiv  Detail & Related papers  (2023-12-02T10:07:17Z)
• DiMSam: Diffusion Models as Samplers for Task and Motion Planning under Partial Observability [58.75803543245372]
  Task and Motion Planning (TAMP) approaches are suited for planning multi-step autonomous robot manipulation. We propose to overcome these limitations by composing diffusion models using a TAMP system. We show how the combination of classical TAMP, generative modeling, and latent embedding enables multi-step constraint-based reasoning.
  arXiv  Detail & Related papers  (2023-06-22T20:40:24Z)
• Leveraging Scene Embeddings for Gradient-Based Motion Planning in Latent Space [24.95320093765214]
  AMP-LS is able to plan in novel, complex scenes while outperforming traditional planning baselines in terms of speed by an order of magnitude. We show that the resulting system is fast enough to enable closed-loop planning in real-world dynamic scenes.
  arXiv  Detail & Related papers  (2023-03-06T18:49:39Z)
• Reducing Collision Checking for Sampling-Based Motion Planning Using Graph Neural Networks [10.698553177585973]
  We propose new learning-based methods for reducing collision checking to accelerate motion planning. We train graph neural networks (GNNs) that perform path exploration and path smoothing. Experimental results show that the learned components can significantly reduce collision checking and improve overall planning efficiency.
  arXiv  Detail & Related papers  (2022-10-17T09:02:04Z)
• Neural Motion Planning for Autonomous Parking [6.1805402105389895]
  This paper presents a hybrid motion planning strategy that combines a deep generative network with a conventional motion planning method. The proposed method effectively learns the representations of a given state, and shows improvement in terms of algorithm performance.
  arXiv  Detail & Related papers  (2021-11-12T14:29:38Z)
• Graph Neural Networks for Motion Planning [108.51253840181677]
  We present two techniques, GNNs over dense fixed graphs for low-dimensional problems and sampling-based GNNs for high-dimensional problems. We examine the ability of a GNN to tackle planning problems such as identifying critical nodes or learning the sampling distribution in Rapidly-exploring Random Trees (RRT) Experiments with critical sampling, a pendulum and a six DoF robot arm show GNNs improve on traditional analytic methods as well as learning approaches using fully-connected or convolutional neural networks.
  arXiv  Detail & Related papers  (2020-06-11T08:19:06Z)
• Hallucinative Topological Memory for Zero-Shot Visual Planning [86.20780756832502]
  In visual planning (VP), an agent learns to plan goal-directed behavior from observations of a dynamical system obtained offline. Most previous works on VP approached the problem by planning in a learned latent space, resulting in low-quality visual plans. Here, we propose a simple VP method that plans directly in image space and displays competitive performance.
  arXiv  Detail & Related papers  (2020-02-27T18:54:42Z)

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.