Coupling Tensor Trains with Graph of Convex Sets: Effective Compression, Exploration, and Planning in the C-Space

• URL: http://arxiv.org/abs/2603.11658v1
• Date: Thu, 12 Mar 2026 08:28:06 GMT
• Title: Coupling Tensor Trains with Graph of Convex Sets: Effective Compression, Exploration, and Planning in the C-Space
• Abstract summary: 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.
• Score: 2.449133239966462
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present TANGO (Tensor ANd Graph Optimization), a novel motion planning framework that integrates tensor-based compression with structured graph optimization to enable efficient and scalable trajectory generation. While optimization-based planners such as the Graph of Convex Sets (GCS) offer powerful tools for generating smooth, optimal trajectories, they typically rely on a predefined convex characterization of the high-dimensional configuration space-a requirement that is often intractable for general robotic tasks. TANGO builds further by using Tensor Train decomposition to approximate the feasible configuration space in a compressed form, enabling rapid discovery and estimation of task-relevant regions. These regions are then embedded into a GCS-like structure, allowing for geometry-aware motion planning that respects both system constraints and environmental complexity. 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. Rigorous simulation studies on planar and real robots reinforce our claims of effective compression and higher quality trajectories.

Related papers

• Scalable and Efficient Joint Spiking Embedding Predictive Architecture for Large-Scale Dynamic Graphs [43.39867023055097]
  We propose SG-JEPA, a joint spiking embedding predictive architecture for large-scale dynamic graphs.<n> SG-JEPA partitions nodes into context and target sets along the temporal dimension to learn embeddings that are predictive of each other.<n>Experiments demonstrate that SG-JEPA achieves competitive or even superior performance over discriminative baselines on node classification.
  arXiv  Detail & Related papers  (2026-07-20T18:02:04Z)
• EUPHORIA: Efficient Universal Planning via Hybrid Optimization for Robust Industrial Robotic Assembly [12.727917085274841]
  EUPHORIA is a unified framework that achieves universal few-shot adaptability and dynamic efficiency.<n>For structural reasoning, we introduce a Physics-Informed Graph Transformer trained via Soft Actor-Critic.<n>Experiments show that EUPHORIA significantly reduces energy consumption over decoupled baselines.
  arXiv  Detail & Related papers  (2026-05-15T18:25:49Z)
• LG-HCC: Local Geometry-Aware Hierarchical Context Compression for 3D Gaussian Splatting [77.81227097905865]
  Anchor-based 3DGS compression schemes reduce gaussian redundancy through some advanced context models.<n>We propose a Local Geometry-aware Hierarchical Context Compression framework for 3DGS that incorporates inter-anchor geometric correlations into anchor pruning and entropy coding for compact representation.<n>Experiments show that LG-HCC effectively alleviates structural preservation issues,achieving superior geometric integrity and rendering fidelity while reducing storage by up to 30.85x compared to the Scaffold-GS baseline on the Mip-NeRF360 dataset.
  arXiv  Detail & Related papers  (2026-03-30T13:39:35Z)
• GSPlane: Concise and Accurate Planar Reconstruction via Structured Representation [30.083162532688096]
  We propose GSPlane, which recovers accurate geometry and produces clean and well-structured mesh connectivity for plane regions.<n>We also explore applications of the structured planar representation, which enable decoupling and flexible manipulation of objects on supportive planes.
  arXiv  Detail & Related papers  (2025-10-20T01:59:21Z)
• Towards Pre-trained Graph Condensation via Optimal Transport [52.6504753271008]
  Graph condensation aims to distill the original graph into a small-scale graph, mitigating redundancy and accelerating GNN training.<n> conventional GC approaches heavily rely on rigid GNNs and task-specific supervision.<n>Pre-trained Graph Condensation (PreGC) via optimal transport is proposed to transcend the limitations of task- and architecture-dependent GC methods.
  arXiv  Detail & Related papers  (2025-09-18T08:13:24Z)
• Space-Time Graphs of Convex Sets for Multi-Robot Motion Planning [2.3416394753138037]
  Multi-Robot Motion Planning (MRMP) is a problem of computing problem of collision-free trajectories for multiple robots in continuous environments.<n>We propose Space-Time Graphs of Convex Sets (ST-GCS), a novel planner that systematically covers the collision-free space-time domain with convex sets instead of relying on random sampling.<n>We also propose Convex Decomposition (ECD) to "reserve" trajectories astemporal obstacles, addressing maintaining a collision-free space-time graph sets for subsequent planning.
  arXiv  Detail & Related papers  (2025-03-01T18:28:57Z)
• 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)
• Sequential Manipulation Planning on Scene Graph [90.28117916077073]
  We devise a 3D scene graph representation, contact graph+ (cg+), for efficient sequential task planning. Goal configurations, naturally specified on contact graphs, can be produced by a genetic algorithm with an optimization method. A task plan is then succinct by computing the Graph Editing Distance (GED) between the initial contact graphs and the goal configurations, which generates graph edit operations corresponding to possible robot actions.
  arXiv  Detail & Related papers  (2022-07-10T02:01:33Z)
• On the spatial attention in Spatio-Temporal Graph Convolutional Networks for skeleton-based human action recognition [97.14064057840089]
  Graphal networks (GCNs) promising performance in skeleton-based human action recognition by modeling a sequence of skeletons as a graph. Most of the recently proposed G-temporal-based methods improve the performance by learning the graph structure at each layer of the network.
  arXiv  Detail & Related papers  (2020-11-07T19:03:04Z)
• Mix Dimension in Poincar\'{e} Geometry for 3D Skeleton-based Action Recognition [57.98278794950759]
  Graph Convolutional Networks (GCNs) have already demonstrated their powerful ability to model the irregular data. We present a novel spatial-temporal GCN architecture which is defined via the Poincar'e geometry. We evaluate our method on two current largest scale 3D datasets.
  arXiv  Detail & Related papers  (2020-07-30T18:23:18Z)
• 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.