Connectivity-Aware Representations for Constrained Motion Planning via Multi-Scale Contrastive Learning

• URL: http://arxiv.org/abs/2603.25298v1
• Date: Thu, 26 Mar 2026 10:44:21 GMT
• Title: Connectivity-Aware Representations for Constrained Motion Planning via Multi-Scale Contrastive Learning
• Abstract summary: The objective of constrained motion planning is to connect start and goal configurations while satisfying task-specific constraints.<n>This paper addresses these challenges by learning a connectivity-aware representation for selecting start and goal configurations prior to planning.
• Score: 6.0393663164774125
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: The objective of constrained motion planning is to connect start and goal configurations while satisfying task-specific constraints. Motion planning becomes inefficient or infeasible when the configurations lie in disconnected regions, known as essentially mutually disconnected (EMD) components. Constraints further restrict feasible space to a lower-dimensional submanifold, while redundancy introduces additional complexity because a single end-effector pose admits infinitely many inverse kinematic solutions that may form discrete self-motion manifolds. This paper addresses these challenges by learning a connectivity-aware representation for selecting start and goal configurations prior to planning. Joint configurations are embedded into a latent space through multi-scale manifold learning across neighborhood ranges from local to global, and clustering generates pseudo-labels that supervise a contrastive learning framework. The proposed framework provides a connectivity-aware measure that biases the selection of start and goal configurations in connected regions, avoiding EMDs and yielding higher success rates with reduced planning time. Experiments on various manipulation tasks showed that our method achieves 1.9 times higher success rates and reduces the planning time by a factor of 0.43 compared to baselines.

Related papers

• Coordinated Motion Planning for Multi-Arm Systems via Iterative LQ Games [21.845592692945047]
  This paper presents an iterative Linear Quadratic (LQ) game framework for multi-manipulator motion planning.<n>Our framework produces smooth, safe, and efficient trajectories in high-dimensional settings, outperforming traditional methods.
  arXiv  Detail & Related papers  (2026-08-27T21:33:38Z)
• Occluding the Solution Space: Planner-Agnostic Adversarial Attacks on Tolerance-Aware Manipulation [57.9825059129472]
  We propose a planner-agnostic attack framework for tolerance-aware manipulation.<n>Our approach shifts the evaluation paradigm to task-level feasibility over goal regions.<n>Online, we formulate the attack as a budgeted maximum-coverage optimization.
  arXiv  Detail & Related papers  (2026-07-04T08:14:44Z)
• Generative Floor Plan Design with LLMs via Reinforcement Learning with Verifiable Rewards [16.41930427892441]
  An AI system for professional floor plan design must precisely control room dimensions and areas while respecting the desired connectivity between rooms.<n>Existing generative approaches focus primarily on respecting the requested connectivity between rooms, but do not support generating floor plans that respect numerical constraints.<n>We introduce a text-based floor plan generation approach that fine-tunes a large language model (LLM) on real plans and then applies reinforcement learning with verifiable rewards.<n>Our results demonstrate that LLMs can effectively handle constraints in this setting, suggesting broader applications for text-based generative modeling.
  arXiv  Detail & Related papers  (2026-05-13T21:06:12Z)
• 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)
• Differentiable Object Pose Connectivity Metrics for Regrasp Sequence Optimization [13.078429762098631]
  Regrasp planning is often required when one pick-and-place cannot transfer an object from an initial pose to a goal pose.<n>We propose an implicit multi-step regrasp planning framework based on differentiable pose sequence connectivity metrics.
  arXiv  Detail & Related papers  (2026-04-16T07:47:57Z)
• UMBRELLA: Uncertainty-aware Multi-robot Reactive Coordination under Dynamic Temporal Logic Tasks [5.794342083222513]
  This paper addresses the problem of coordinating multi-robot systems for collaborative tasks involving dynamic and moving targets.<n>We explicitly model the uncertainty in target motion prediction via Conformal Prediction (CP)<n>The proposed framework (UMBRELLA) combines the Monte Carlo Tree Search (MCTS) over partial plans with uncertainty-aware rollouts.
  arXiv  Detail & Related papers  (2026-03-26T12:40:04Z)
• Integrated Multi-Drone Task Allocation, Sequencing, and Optimal Trajectory Generation in Obstacle-Rich 3D Environments [0.0]
  This paper introduces IMD-TAPP (Integrated Multi-Drone Task Allocation and Path Planning), an end-to-end framework that jointly addresses multi-goal allocation, tour sequencing, and safe trajectory generation for quadrotor teams operating in obstacle-rich spaces.<n>In a representative case study with two drones serving multiple goals, the proposed approach attains a minimum mission time of 136s while maintaining the required safety constraints throughout execution.
  arXiv  Detail & Related papers  (2026-03-26T00:46:26Z)
• LLM-Grounded Dynamic Task Planning with Hierarchical Temporal Logic for Human-Aware Multi-Robot Collaboration [17.886091169216538]
  Large Language Models (LLM) enable non-experts to specify openworld multi-robot tasks.<n>LLM plans often lack feasibility and are not efficient, especially in long-horizon scenarios.<n>We propose a neuro-symbolic framework that grounds reasoning into hierarchical specifications.
  arXiv  Detail & Related papers  (2026-02-10T07:11:36Z)
• Reinforcement learning with combinatorial actions for coupled restless bandits [62.89013331120493]
  We propose SEQUOIA, an RL algorithm that directly optimize for long-term reward over the feasible action space.<n>We empirically validate SEQUOIA on four novel restless bandit problems with constraints: multiple interventions, path constraints, bipartite matching, and capacity constraints.
  arXiv  Detail & Related papers  (2025-03-01T21:25:21Z)
• Platform-Aware Mission Planning [50.56223680851687]
  We introduce the problem of Platform-Aware Mission Planning (PAMP), addressing it in the setting of temporal durative actions.<n>The first baseline approach amalgamates the mission and platform levels, while the second is based on an abstraction-refinement loop.<n>We prove the soundness and completeness of the proposed approaches and validate them experimentally.
  arXiv  Detail & Related papers  (2025-01-16T16:20:37Z)
• DiFSD: Ego-Centric Fully Sparse Paradigm with Uncertainty Denoising and Iterative Refinement for Efficient End-to-End Self-Driving [55.53171248839489]
  We propose an ego-centric fully sparse paradigm, named DiFSD, for end-to-end self-driving.<n>Specifically, DiFSD mainly consists of sparse perception, hierarchical interaction and iterative motion planner.<n>Experiments conducted on nuScenes and Bench2Drive datasets demonstrate the superior planning performance and great efficiency of DiFSD.
  arXiv  Detail & Related papers  (2024-09-15T15:55:24Z)
• OED: Towards One-stage End-to-End Dynamic Scene Graph Generation [18.374354844446962]
  Dynamic Scene Graph Generation (DSGG) focuses on identifying visual relationships within the spatial-temporal domain of videos. We propose a one-stage end-to-end framework, termed OED, which streamlines the DSGG pipeline. This framework reformulates the task as a set prediction problem and leverages pair-wise features to represent each subject-object pair within the scene graph.
  arXiv  Detail & Related papers  (2024-05-27T08:18:41Z)
• 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)
• Neural Manipulation Planning on Constraint Manifolds [13.774614900994342]
  We present Constrained Motion Planning Networks (CoMPNet), the first neural planner for multimodal kinematic constraints. We show that CoMPNet solves practical motion planning tasks involving both unconstrained and constrained problems. It generalizes to new unseen locations of the objects, i.e., not seen during training, in the given environments with high success rates.
  arXiv  Detail & Related papers  (2020-08-09T18:58:10Z)
• Goal Kernel Planning: Linearly-Solvable Non-Markovian Policies for Logical Tasks with Goal-Conditioned Options [54.40780660868349]
  We introduce a compositional framework called Linearly-Solvable Goal Kernel Dynamic Programming (LS-GKDP)<n>LS-GKDP combines the Linearly-Solvable Markov Decision Process (LMDP) formalism with the Options Framework of Reinforcement Learning.<n>We show how an LMDP with a goal kernel enables the efficient optimization of meta-policies in a lower-dimensional subspace defined by the task grounding.
  arXiv  Detail & Related papers  (2020-07-06T05:13:20Z)

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.