Motion Planning in Compressed Representation Spaces

• URL: http://arxiv.org/abs/2606.30940v1
• Date: Mon, 29 Jun 2026 21:48:22 GMT
• Title: Motion Planning in Compressed Representation Spaces
• Abstract summary: We learn an autoencoder with a high compression ratio and a latent space of hierarchically ordered, discrete-valued tokens.<n>We then perform motion planning by directly searching in the latent space of tokens.<n>This search can optimize arbitrary objective functions specified at test time, providing a large degree of flexibility.
• Score: 16.185835270781283
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Deep learning methods have vastly expanded the capabilities of motion planning in robotics applications, as learning priors from large-scale data has been shown to be essential in capturing the highly complex behavior required for solving tasks such as manipulation or navigation for autonomous vehicles. At the same time, model-based planning algorithms based on search or optimization remain an essential tool due to their flexibility, efficiency, and the ability to incorporate domain knowledge via expert-designed algorithms and objective functions. We propose a new generative framework to unify these two paradigms. First, we learn an autoencoder with a high compression ratio and a latent space of hierarchically ordered, discrete-valued tokens. Leveraging both the dimensionality reduction and the hierarchical coarse-to-fine structure learned by this autoencoder, we then perform motion planning by directly searching in the latent space of tokens. This search can optimize arbitrary objective functions specified at test time, providing a large degree of flexibility while maintaining efficiency and producing realistic solutions by relying on the generative capabilities of the highly compressed autoencoder. We evaluate our method on nuPlan and the Waymo Open Motion Dataset, showing how latent space search can be used for a variety of guided behavior generation tasks, achieving strong performance for closed-loop motion planning and multi-agent guided scenario synthesis without requiring any task-specific training.

Related papers

• Machine Learning-Enhanced Tabu Search for Tactical Wireless Network Design [0.688204255655161]
  We propose a data-driven framework that improves the efficiency of Tabu Search by learning to guide its move selection process.<n>We record both improving and non-improving edge-based transformations together with a set of descriptive features.<n>This information is used to train a Graph Neural Network (GNN) that predicts the impact of candidate moves on the objective function.
  arXiv  Detail & Related papers  (2026-07-31T15:03:53Z)
• Generalizable Geometric Prior and Recurrent Spiking Feature Learning for Humanoid Robot Manipulation [90.90219129619344]
  This paper presents a novel R-prior-S, Recurrent Geometric-priormodal Policy with Spiking features.<n>To ground high-level reasoning in physical reality, we leverage lightweight 2D geometric inductive biases.<n>For the data efficiency issue in robotic action generation, we introduce a Recursive Adaptive Spiking Network.
  arXiv  Detail & Related papers  (2026-01-13T23:36:30Z)
• Fast Functionally Redundant Inverse Kinematics for Robotic Toolpath Optimisation in Manufacturing Tasks [53.04487603529418]
  Inverse kinematics algorithms can solve this in a fast, reactive framework.<n>We propose a novel algorithm to solve functionally redundant inverse kinematics for robotic manipulation.
  arXiv  Detail & Related papers  (2025-12-10T22:07:07Z)
• VQ-VLA: Improving Vision-Language-Action Models via Scaling Vector-Quantized Action Tokenizers [23.868483243482558]
  We introduce an innovative vectorization based action tokenizer, leveraging over 100 times more data than previous approaches.<n>Once trained, the tokenizer can be seamlessly adapted to a wide range of tasks.<n>We conducted extensive experiments in both simulated environments and on real robotic platforms.
  arXiv  Detail & Related papers  (2025-07-01T17:59:44Z)
• Action Flow Matching for Continual Robot Learning [54.10050120844738]
  Continual learning in robotics seeks systems that can constantly adapt to changing environments and tasks.<n>We introduce a generative framework leveraging flow matching for online robot dynamics model alignment.<n>We find that by transforming the actions themselves rather than exploring with a misaligned model, the robot collects informative data more efficiently.
  arXiv  Detail & Related papers  (2025-04-25T16:26:15Z)
• Mission-driven Exploration for Accelerated Deep Reinforcement Learning with Temporal Logic Task Specifications [11.010530034121224]
  We introduce a novel Deep Q-learning algorithm that significantly improves learning speed.<n>The enhanced sample efficiency stems from a mission-driven exploration strategy that prioritizes exploration towards directions likely to contribute to mission success.
  arXiv  Detail & Related papers  (2023-11-28T18:59:58Z)
• AI planning in the imagination: High-level planning on learned abstract search spaces [68.75684174531962]
  We propose a new method, called PiZero, that gives an agent the ability to plan in an abstract search space that the agent learns during training. We evaluate our method on multiple domains, including the traveling salesman problem, Sokoban, 2048, the facility location problem, and Pacman.
  arXiv  Detail & Related papers  (2023-08-16T22:47:16Z)
• PEAR: Primitive Enabled Adaptive Relabeling for Boosting Hierarchical Reinforcement Learning [25.84621883831624]
  Hierarchical reinforcement learning (HRL) has the potential to solve complex long horizon tasks using temporal abstraction and increased exploration.<n>We present primitive enabled adaptive relabeling (PEAR)<n>We first perform adaptive relabeling on a few expert demonstrations to generate efficient subgoal supervision.<n>We then jointly optimize HRL agents by employing reinforcement learning (RL) and imitation learning (IL)
  arXiv  Detail & Related papers  (2023-06-10T09:41:30Z)
• Topological Guided Actor-Critic Modular Learning of Continuous Systems with Temporal Objectives [2.398608007786179]
  This work investigates the formal policy synthesis of continuous-state dynamic systems given high-level specifications in linear temporal logic. We use neural networks to approximate the value function and policy function for hybrid product state space.
  arXiv  Detail & Related papers  (2023-04-20T01:36:05Z)
• Option-Aware Adversarial Inverse Reinforcement Learning for Robotic Control [44.77500987121531]
  Hierarchical Imitation Learning (HIL) has been proposed to recover highly-complex behaviors in long-horizon tasks from expert demonstrations. We develop a novel HIL algorithm based on Adversarial Inverse Reinforcement Learning. We also propose a Variational Autoencoder framework for learning with our objectives in an end-to-end fashion.
  arXiv  Detail & Related papers  (2022-10-05T00:28:26Z)
• Pessimism meets VCG: Learning Dynamic Mechanism Design via Offline Reinforcement Learning [114.36124979578896]
  We design a dynamic mechanism using offline reinforcement learning algorithms. Our algorithm is based on the pessimism principle and only requires a mild assumption on the coverage of the offline data set.
  arXiv  Detail & Related papers  (2022-05-05T05:44:26Z)
• DiffSkill: Skill Abstraction from Differentiable Physics for Deformable Object Manipulations with Tools [96.38972082580294]
  DiffSkill is a novel framework that uses a differentiable physics simulator for skill abstraction to solve deformable object manipulation tasks. In particular, we first obtain short-horizon skills using individual tools from a gradient-based simulator. We then learn a neural skill abstractor from the demonstration trajectories which takes RGBD images as input.
  arXiv  Detail & Related papers  (2022-03-31T17:59:38Z)

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.