Pith. sign in

REVIEW 2 cited by

Motion Planning Transformers: A Motion Planning Framework for Mobile Robots

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2106.02791 v2 pith:D4DN5AQG submitted 2021-06-05 cs.RO cs.AI

classification cs.ROcs.AI
keywords planningsearchspacemotionsystemsmethodnon-holonomicplanners
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Fast and efficient sampling-based motion planning (SMP) is an integral component of many robotic systems, such as autonomous cars. A popular technique to improve the efficiency of these planners is to restrict search space in the planning domain. Existing algorithms define parametric functions to bound the search space, but these do not extend to non-holonomic robotic systems. Recent learning-based methods use a combination of convolutional and fully connected networks to encode the planning space. However, these methods are restricted to fixed map sizes, which are often not realistic in the real world. In this paper, we introduce a transformer-based approach, Motion Planning Transformer, to restrict the search space by learning to discern regions with a valid path from prior data. The model learns not only to restrict search spaces for simple 2D systems but also for non-holonomic robotic systems. We validate our method on various randomly generated environments with different map sizes and plan trajectories for a physical non-holonomic robot. We also provide a ROS2 plugin of our method for the Nav2 planning stack. The results show that our method reduces search space nodes by 2-12 times compared to traditional planners and has better generalizability than recent learning-based planners.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Cascaded Diffusion Models for Neural Motion Planning

    cs.RO 2025-05 conditional novelty 5.0 of 10

    A cascaded diffusion planner with a coarse global model, a local refiner, and a one-shot collision-patching step improves success rates by roughly 3 to 5 percentage points over prior learned planners in simulated navi...

  2. Neural-Network-Driven Reward Prediction as a Heuristic: Advancing Q-Learning for Mobile Robot Path Planning

    cs.RO 2024-12 conditional novelty 4.0 of 10

    A neural network's predicted guideline and region are used as a reward function and Q-table initializer, cutting Q-learning convergence steps by about 90% in grid path planning simulations.

Pith tools