Projection-Retraction MPPI: Exact Constraint-Manifold Control for Manipulators

• URL: http://arxiv.org/abs/2608.07573v1
• Date: Tue, 04 Aug 2026 11:40:10 GMT
• Title: Projection-Retraction MPPI: Exact Constraint-Manifold Control for Manipulators
• Abstract summary: Projection-Retraction MPPI enforces the constraints inside dynamics.<n>We validate PR-MPPI on 14-DoF dual-arm systems.
• Score: 7.124493742815592
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Model Predictive Path Integral (MPPI) control is widely used in manipulation for its gradient-free, parallel handling of non-convex costs. Manipulation tasks, however, often impose constraints that hold throughout the motion: a closed kinematic chain that two grasping arms keep exactly, or joint limits and obstacle clearances that are never crossed. MPPI handles such constraints only through the cost, as soft penalties that hold approximately and fail under a strong task cost. To address this, we propose Projection-Retraction MPPI (PR-MPPI), which enforces the constraints inside the sampled dynamics. At every rollout step, the sampled velocity is projected to satisfy both constraint types: the equality restricts it to a subspace, and each inequality to a half-space within that subspace, so inequality handling never breaks the equality. This projection, however, satisfies the constraints only to first order, and a finite step leaves a small drift off the equality. Therefore, we retract the returned command back onto the constraint to numerical tolerance and independent of task weighting. We validate PR-MPPI on 14-DoF dual-arm systems. In simulation, the returned commands satisfy the closed-chain equality to numerical tolerance through a joint-limit stress test and randomized obstacle avoidance. On real hardware, the arms of a Unitree H1-2 humanoid reactively avoid a moving obstacle. Code and experiment videos are available at https://rcilab.github.io/prmppi.

Related papers

• Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles [49.315843050082925]
  We present a bi approach for minimum-time motion planning convex obstacles that is guaranteed to converge.<n>We find that the proposed method produces high-quality trajectories with times to produce state-of-the-art decomposition of variables.
  arXiv  Detail & Related papers  (2026-08-03T19:48:24Z)
• Grasp Execution Without a Planner: Configuration-Space Grasp Distance Fields with Certified Safety & Guaranteed Quality [5.99447754429793]
  We present Grasp Distance Fields (GDFs), smooth softmin distances to finite sets of arm-hand grasp configurations.<n>We jointly select and execute grasps without planning a trajectory.<n>A CBF-CLF quadratic program enforces self-collision, workspace, object, and obstacle-clearance constraints.
  arXiv  Detail & Related papers  (2026-08-01T11:35:08Z)
• Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform [1.3423094548772225]
  We present a novel framework for reformulating constrained binary optimization as Quadratic Unconstrained Binary Optimization (QUBO)<n>We show that this hardware-native surrogate can outperform denser full-pairwise projections, despite being drawn from a strictly smaller approximation space.<n>This advantage widens once the QUBO is embedded and sampled on quantum annealers, yielding samples with the lowest worst-case and mean objective gaps compared to unbalanced penalization and a hardware-blind projection onto all quadratic terms.
  arXiv  Detail & Related papers  (2026-07-28T23:45:18Z)
• Actuator-Aware Inverse Kinematics with Joint-Limit Admissibility for Torque-Controlled Redundant Robots [3.568466510804539]
  This paper proposes actuator-aware inverse kinematics for torque-controlled redundant robots.<n>A small commanded task residual may not necessarily improve realized motion.<n>Experiments on a virtual-decomposition-controlled seven-degree-of-freedom upper-limb exoskeleton compare the method with standard inverse-kinematic baselines.
  arXiv  Detail & Related papers  (2026-05-29T15:33:10Z)
• Manifold-Constrained MPPI: Real-Time Sampling-Based Control Under Hard Constraints [8.747309323431802]
  Manifold-Constrained MPPI (MC-MPPI) is a real-time sampling-based control framework.<n>It enforces manifold-based equality constraints while preserving the computational advantages of MPPI.<n>Experiments on a 14-DoF closed-chain dual-arm system in both simulation and real-world settings demonstrate that MC-MPPI operates stably at 100 Hz.
  arXiv  Detail & Related papers  (2026-05-24T01:57:18Z)
• Bridging Semantic and Kinematic Conditions with Diffusion-based Discrete Motion Tokenizer [55.9892973179428]
  MoTok is a discrete motion tokenizer that decouples semantic abstraction from fine-grained reconstruction.<n>On HumanML3D, our method significantly improves controllability and fidelity over MaskControl while using only one-sixth of the tokens.
  arXiv  Detail & Related papers  (2026-03-19T17:59:51Z)
• ULTRA: Unified Multimodal Control for Autonomous Humanoid Whole-Body Loco-Manipulation [55.467742403416175]
  We introduce a physics-driven neural algorithm that translates large-scale motion capture to humanoid embodiments.<n>We learn a unified multimodal controller that supports both dense references and sparse task specifications.<n>Results show that ULTRA generalizes to autonomous, goal-conditioned whole-body loco-manipulation from egocentric perception.
  arXiv  Detail & Related papers  (2026-03-03T18:59:29Z)
• Primary-Fine Decoupling for Action Generation in Robotic Imitation [91.2899765310853]
  Multi-modal distribution in robotic manipulation action sequences poses critical challenges for imitation learning.<n>We propose Primary-Fine Decoupling for Action Generation (PF-DAG), a two-stage framework that decouples coarse action consistency from fine-grained variations.<n>PF-DAG outperforms state-of-the-art baselines across 56 tasks from Adroit, DexArt, and MetaWorld benchmarks.
  arXiv  Detail & Related papers  (2026-02-25T08:36:45Z)
• Intelligent Control of Collisional Architectures for Deterministic Multipartite State Engineering [0.0]
  We introduce an intelligent, constraint-aware control framework for deterministic generation of symmetric Dicke states $|D_n(m)rangle$ in repeated excitation-within-interaction architectures.<n>The protocol employs partialSWAP collisions between two disjoint qubit registers, mediated by $m$ ancillary shuttle'' qubits, and poses Dickestate preparation as a emph-loop design problem.
  arXiv  Detail & Related papers  (2026-02-09T11:15:32Z)
• Programmable Motion Generation for Open-Set Motion Control Tasks [51.73738359209987]
  We introduce a new paradigm, programmable motion generation. In this paradigm, any given motion control task is broken down into a combination of atomic constraints. These constraints are then programmed into an error function that quantifies the degree to which a motion sequence adheres to them.
  arXiv  Detail & Related papers  (2024-05-29T17:14:55Z)
• Shortest-Path Constrained Reinforcement Learning for Sparse Reward Tasks [59.419152768018506]
  We show that any optimal policy necessarily satisfies the k-SP constraint. We propose a novel cost function that penalizes the policy violating SP constraint, instead of completely excluding it. Our experiments on MiniGrid, DeepMind Lab, Atari, and Fetch show that the proposed method significantly improves proximal policy optimization (PPO)
  arXiv  Detail & Related papers  (2021-07-13T21:39:21Z)

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.