Differentiable Object Pose Connectivity Metrics for Regrasp Sequence Optimization

• URL: http://arxiv.org/abs/2604.14733v1
• Date: Thu, 16 Apr 2026 07:47:57 GMT
• Title: Differentiable Object Pose Connectivity Metrics for Regrasp Sequence Optimization
• Abstract summary: 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.
• Score: 13.078429762098631
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Regrasp planning is often required when one pick-and-place cannot transfer an object from an initial pose to a goal pose while maintaining grasp feasibility. The main challenge is to reason about shared-grasp connectivity across intermediate poses, where discrete search becomes brittle. We propose an implicit multi-step regrasp planning framework based on differentiable pose sequence connectivity metrics. We model grasp feasibility under an object pose using an Energy-Based Model (EBM) and leverage energy additivity to construct a continuous energy landscape that measures pose-pair connectivity, enabling gradient-based optimization of intermediate object poses. An adaptive iterative deepening strategy is introduced to determine the minimum number of intermediate steps automatically. Experiments show that the proposed cost formulation provides smooth and informative gradients, improving planning robustness over other alternatives. They also demonstrate generalization to unseen grasp poses and cross-end-effector transfer, where a model trained with suction constraints can guide parallel gripper grasp manipulation. The multi-step planning results further highlight the effectiveness of adaptive deepening and minimum-step search.

Related papers

• MoMo: Conditioned Contrastive Representation Learning for Preference-Modulated Planning [1.7281573530896264]
  We introduce MoMo, a preference-conditioned contrastive planner.<n>MoMo learns a joint conditioning of the representation geometry and latent prediction operator.<n>Across six environments, MoMo smoothly adapts plan safety according to user preferences, yielding improved temporal and preferential consistency over state augmentation baselines.
  arXiv  Detail & Related papers  (2026-05-08T21:44:26Z)
• Revitalizing the Beginning: Avoiding Storage Dependency for Model Merging in Continual Learning [57.10440766103372]
  Trajectory Regularized Merging (TRM) is a framework that reformulates the merging phase as an optimization process within an augmented trajectory subspace.<n>Our framework integrates three synergistic objectives including task alignment, prediction consistency, and gradient responsiveness to concurrently preserve merged model's historical stability and re-activate optimization dynamics.
  arXiv  Detail & Related papers  (2026-05-08T14:07:32Z)
• Connectivity-Aware Representations for Constrained Motion Planning via Multi-Scale Contrastive Learning [6.0393663164774125]
  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.
  arXiv  Detail & Related papers  (2026-03-26T10:44:21Z)
• Adaptive Linear Path Model-Based Diffusion [52.84663832658799]
  We introduce Linear Path Model-Based Diffusion (LP-MBD), which replaces the variance-preserving schedule with a flow-matching linear probability path.<n>We also propose Adaptive LP-MBD (ALP-MBD), which leverages reinforcement learning to adjust diffusion steps and noise levels according to task complexity and environmental conditions.
  arXiv  Detail & Related papers  (2026-02-02T21:33:03Z)
• MAESTRO: Meta-learning Adaptive Estimation of Scalarization Trade-offs for Reward Optimization [56.074760766965085]
  Group-Relative Policy Optimization has emerged as an efficient paradigm for aligning Large Language Models (LLMs)<n>We propose MAESTRO, which treats reward scalarization as a dynamic latent policy, leveraging the model's terminal hidden states as a semantic bottleneck.<n>We formulate this as a contextual bandit problem within a bi-level optimization framework, where a lightweight Conductor network co-evolves with the policy by utilizing group-relative advantages as a meta-reward signal.
  arXiv  Detail & Related papers  (2026-01-12T05:02:48Z)
• MO-SeGMan: Rearrangement Planning Framework for Multi Objective Sequential and Guided Manipulation in Constrained Environments [14.799742504098603]
  We introduce MO-SeGMan, a Sequential and Guided Manipulation planner for highly constrained rearrangement problems.<n>Mo-SeGMan generates object placement sequences that minimize both replanning per object and robot travel distance.<n>We show that MO-SeGMan consistently achieves faster solution times and superior solution quality compared to the baselines.
  arXiv  Detail & Related papers  (2025-11-03T11:38:57Z)
• Aligning Latent Spaces with Flow Priors [72.24305287508474]
  This paper presents a novel framework for aligning learnable latent spaces to arbitrary target distributions by leveraging flow-based generative models as priors.<n> Notably, the proposed method eliminates computationally expensive likelihood evaluations and avoids ODE solving during optimization.
  arXiv  Detail & Related papers  (2025-06-05T16:59:53Z)
• Train with Perturbation, Infer after Merging: A Two-Stage Framework for Continual Learning [57.514786046966265]
  We propose textbfPerturb-and-Merge (P&M), a novel continual learning framework that integrates model merging into the CL paradigm to mitigate forgetting.<n>Our proposed approach achieves state-of-the-art performance on several continual learning benchmark datasets.
  arXiv  Detail & Related papers  (2025-05-28T14:14:19Z)
• Adaptive Planning with Generative Models under Uncertainty [20.922248169620783]
  Planning with generative models has emerged as an effective decision-making paradigm across a wide range of domains. While continuous replanning at each timestep might seem intuitive because it allows decisions to be made based on the most recent environmental observations, it results in substantial computational challenges. Our work addresses this challenge by introducing a simple adaptive planning policy that leverages the generative model's ability to predict long-horizon state trajectories.
  arXiv  Detail & Related papers  (2024-08-02T18:07:53Z)
• Deep hybrid models: infer and plan in a dynamic world [0.0]
  We present an active inference approach that exploits discrete and continuous processing, based on three features.<n>We show that the model can tackle the presented task under different conditions.
  arXiv  Detail & Related papers  (2024-02-01T15:15:25Z)
• Unified Task and Motion Planning using Object-centric Abstractions of Motion Constraints [56.283944756315066]
  We propose an alternative TAMP approach that unifies task and motion planning into a single search. Our approach is based on an object-centric abstraction of motion constraints that permits leveraging the computational efficiency of off-the-shelf AI search to yield physically feasible plans.
  arXiv  Detail & Related papers  (2023-12-29T14:00: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.