Spectral Decomposition of Inverse Dynamics for Fast Exploration in Model-Based Manipulation

• URL: http://arxiv.org/abs/2603.27796v1
• Date: Sun, 29 Mar 2026 18:22:36 GMT
• Title: Spectral Decomposition of Inverse Dynamics for Fast Exploration in Model-Based Manipulation
• Abstract summary: Planning long duration robotic manipulation sequences is challenging because of the complexity of exploring feasible trajectories.<n>We propose a search tree method that generates trajectories using the spectral decomposition of the inverse dynamics equation.<n>Our method performs similarly to recent work in model-based planning for short-horizon tasks, and differentiates itself with its ability to solve long-horizon tasks.
• Score: 0.08602553195689511
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Planning long duration robotic manipulation sequences is challenging because of the complexity of exploring feasible trajectories through nonlinear contact dynamics and many contact modes. Moreover, this complexity grows with the problem's horizon length. We propose a search tree method that generates trajectories using the spectral decomposition of the inverse dynamics equation. This equation maps actuator displacement to object displacement, and its spectrum is efficient for exploration because its components are orthogonal and they approximate the reachable set of the object while remaining dynamically feasible. These trajectories can be combined with any search based method, such as Rapidly-Exploring Random Trees (RRT), for long-horizon planning. Our method performs similarly to recent work in model-based planning for short-horizon tasks, and differentiates itself with its ability to solve long-horizon tasks: whereas existing methods fail, ours can generate 45 second duration, 10+ contact mode plans using 15 seconds of computation, demonstrating real-time capability in highly complex domains.

Related papers

• LAMP: Long-Horizon Adaptive Manipulation Planning for Multi-Robot Collaboration in Cluttered Space [6.871611081512488]
  Multi-robot manipulation requires jointly reasoning about contact formations, robot motions under coupled dynamics, and collision avoidance.<n>Existing approaches either learn to solve the problem end-to-end via reinforcement learning or restrict planning to a simpler surrogate problem.<n>We propose a Long-horizon Adaptive Manipulation Planning framework with two planners that enable tractable search over the full coupled space.
  arXiv  Detail & Related papers  (2026-06-28T12:12:48Z)
• Novel Algorithms for Smoothly Differentiable and Efficiently Vectorizable Contact Manifold Construction [26.543084981943778]
  Developing methods that make use of first/second order information about the dynamics holds great promise.<n>Main bottleneck in this research direction is the difficulty in obtaining useful gradients and Hessians.<n>This abstract proposes a method that can address the collision detection part of the puzzle in a manner that is smoothly differentiable and massively vectorizable.
  arXiv  Detail & Related papers  (2026-04-19T16:58:09Z)
• Ultrafast Sampling-based Kinodynamic Planning via Differential Flatness [15.37007491684187]
  AkinoPDF is a fast parallelized sampling-based kinodynamic motion planning technique for a broad class of differentially flat robot systems.<n>Our method is fast, exact, and compatible with any sampling-based motion planner.
  arXiv  Detail & Related papers  (2026-03-17T01:53:10Z)
• LongFly: Long-Horizon UAV Vision-and-Language Navigation with Spatiotemporal Context Integration [49.676794850174325]
  LongFly is a history-awaretemporal modeling framework for long-horizon UAV VLN.<n>It transforms fragmented and redundant historical data into structured, compact, and expressive representations.<n>It outperforms state-of-the-art UAV VLN baselines by 7.89% in success rate and 6.33% in success weighted by path length.
  arXiv  Detail & Related papers  (2025-12-26T12:09:40Z)
• Lightning Grasp: High Performance Procedural Grasp Synthesis with Contact Fields [55.014365168982884]
  We present Lightning Grasp, a novel high-performance procedural grasp synthesis algorithm.<n>It achieves orders-of-magnitude speedups over state-of-the-art approaches.<n>We open-source our system to propel further innovation in robotic manipulation.
  arXiv  Detail & Related papers  (2025-11-10T18:59:44Z)
• PatchTraj: Unified Time-Frequency Representation Learning via Dynamic Patches for Trajectory Prediction [14.48846131633279]
  We propose a dynamic patch-based framework that integrates time-frequency joint modeling for trajectory prediction.<n> Specifically, we decompose the trajectory into raw time sequences and frequency components, and employ dynamic patch partitioning to perform multi-scale segmentation.<n>The resulting enhanced embeddings exhibit strong expressive power, enabling accurate predictions even when using a vanilla architecture.
  arXiv  Detail & Related papers  (2025-07-25T09:55:33Z)
• Extendable Long-Horizon Planning via Hierarchical Multiscale Diffusion [62.91968752955649]
  This paper tackles a novel problem, extendable long-horizon planning-enabling agents to plan trajectories longer than those in training data without compounding errors.<n>We propose an augmentation method that iteratively generates longer trajectories by stitching shorter ones.<n>HM-Diffuser trains on these extended trajectories using a hierarchical structure, efficiently handling tasks across multiple temporal scales.
  arXiv  Detail & Related papers  (2025-03-25T22:52:46Z)
• Learning segmentation from point trajectories [79.02153797465326]
  We present a way to train a segmentation network using long-term point trajectories as a supervisory signal to complement optical flow.<n>Our method outperforms the prior art on motion-based segmentation.
  arXiv  Detail & Related papers  (2025-01-21T18:59:53Z)
• SCoTT: Strategic Chain-of-Thought Tasking for Wireless-Aware Robot Navigation in Digital Twins [78.53885607559958]
  We propose SCoTT, a wireless-aware path planning framework.<n>We show that SCoTT achieves path gains within 2% of DP-WA* while consistently generating shorter trajectories.<n>We also show the practical viability of our approach by deploying SCoTT as a ROS node within Gazebo simulations.
  arXiv  Detail & Related papers  (2024-11-27T10:45:49Z)
• Autonomous UAV Exploration of Dynamic Environments via Incremental Sampling and Probabilistic Roadmap [0.3867363075280543]
  We propose a novel dynamic exploration planner (DEP) for exploring unknown environments using incremental sampling and Probabilistic Roadmap (PRM) Our method safely explores dynamic environments and outperforms the benchmark planners in terms of exploration time, path length, and computational time.
  arXiv  Detail & Related papers  (2020-10-14T22:52:37Z)
• Broadly-Exploring, Local-Policy Trees for Long-Horizon Task Planning [12.024736761925864]
  Long-horizon planning in realistic environments requires the ability to reason over sequential tasks in high-dimensional state spaces. We present Broadly-Exploring-Local-policy Trees (BELT), a task-conditioned, model-based tree search. BELT is demonstrated experimentally to be able to plan long-horizon, sequential with a goal conditioned policy and generate plans that are robust.
  arXiv  Detail & Related papers  (2020-10-13T15:51:24Z)
• Disentangling and Unifying Graph Convolutions for Skeleton-Based Action Recognition [79.33539539956186]
  We propose a simple method to disentangle multi-scale graph convolutions and a unified spatial-temporal graph convolutional operator named G3D. By coupling these proposals, we develop a powerful feature extractor named MS-G3D based on which our model outperforms previous state-of-the-art methods on three large-scale datasets.
  arXiv  Detail & Related papers  (2020-03-31T11:28:25Z)
• Convolutional Tensor-Train LSTM for Spatio-temporal Learning [116.24172387469994]
  We propose a higher-order LSTM model that can efficiently learn long-term correlations in the video sequence. This is accomplished through a novel tensor train module that performs prediction by combining convolutional features across time. Our results achieve state-of-the-art performance-art in a wide range of applications and datasets.
  arXiv  Detail & Related papers  (2020-02-21T05:00:01Z)

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.