Globalized Constrained Stein Variational Inference for Diverse Feasible Robot Motion Planning

• URL: http://arxiv.org/abs/2607.12732v1
• Date: Tue, 14 Jul 2026 13:02:45 GMT
• Title: Globalized Constrained Stein Variational Inference for Diverse Feasible Robot Motion Planning
• Abstract summary: In robotics, motion samples must satisfy strict constraints, including collision avoidance, joint limits, contact conditions, and dynamics consistency.<n>We propose SteinSQP, a constrained Stein variational inference method for diverse feasible robot motion sampling.<n>We show that SteinSQP shows faster and more robust ensemble convergence in terms of iterations, improves particle-wise feasibility, and achieves faster batched time-to-solution on challenging robot-scale tasks.
• Score: 11.448622437140022
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Robot motion planning is inherently multimodal, yet classical planners typically return only a single solution. Probabilistic formulations address this limitation by maintaining a distribution over motions, allowing the planner to reason over multiple low-cost alternatives. In robotics, however, motion samples must also satisfy strict constraints, including collision avoidance, joint limits, contact conditions, and dynamics consistency. These hard requirements make motion sampling substantially more challenging: within a limited planning budget, the ensemble must cover diverse low-cost motions while ensuring that every sample remains feasible under the relevant constraints. We propose SteinSQP (Stein Variational Sequential Quadratic Programming), a constrained Stein variational inference method for diverse feasible robot motion sampling. SteinSQP evolves an interacting particle ensemble, as in Stein variational methods, while embedding constraints directly into a kernel-space SQP subproblem. We solve the resulting constrained Stein-Newton subproblem with a GPU-friendly matrix-free primal-dual algorithm, enabling efficient batched ensemble updates. To globalize the method, we introduce an ensemble-level merit function that jointly balances objective value, constraint violation, and particle diversity. Across five constrained motion-planning tasks, SteinSQP returns fully feasible ensembles while preserving diverse motion alternatives. Compared with first-order constrained Stein baselines and serial multistart nonlinear programming, SteinSQP shows faster and more robust ensemble convergence in terms of iterations, improves particle-wise feasibility, and achieves faster batched time-to-solution on challenging robot-scale tasks.

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)
• 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)
• 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)
• Constrained Stein Variational Gradient Descent for Robot Perception, Planning, and Identification [11.126853736828984]
  We present two novel frameworks for applying principles of constrained optimization to the new variational inference Stein variational descent.<n>We show that we can build distributions of: robot motion plans that exactly avoid collisions, robot arm joint angles on the SE(3) manifold with exact table placement constraints, and object poses from point clouds with table placement constraints.
  arXiv  Detail & Related papers  (2025-05-31T14:52:34Z)
• Constrained Gaussian Process Motion Planning via Stein Variational Newton Inference [16.97959227638119]
  We propose a novel constrained Stein Variational Gaussian Process Motion Planning (cSGPMP) framework.<n>Our approach improves the efficiency of particle-based inference while explicitly handling nonlinear constraints.<n>We validate our method on standard benchmarks, achieving an average success rate of 98.57% across 350 planning tasks.
  arXiv  Detail & Related papers  (2025-04-07T11:20:11Z)
• Simultaneous Multi-Robot Motion Planning with Projected Diffusion Models [57.45019514036948]
  Simultaneous MRMP Diffusion (SMD) is a novel approach integrating constrained optimization into the diffusion sampling process to produce collision-free, kinematically feasible trajectories.<n>The paper introduces a comprehensive MRMP benchmark to evaluate trajectory planning algorithms across scenarios with varying robot densities, obstacle complexities, and motion constraints.
  arXiv  Detail & Related papers  (2025-02-05T20:51:28Z)
• STAMP: Differentiable Task and Motion Planning via Stein Variational Gradient Descent [35.96763689715956]
  Planning for sequential robotics tasks often requires integrated symbolic and geometric reasoning. TAMP algorithms typically solve these problems by performing a tree search over high-level task sequences while checking for kinematic and dynamic feasibility. We propose a novel approach to TAMP called Stein Task and Motion Planning (STAMP) that relaxes the hybrid optimization problem into a continuous domain.
  arXiv  Detail & Related papers  (2023-10-03T03:53:51Z)
• Shuffled Autoregression For Motion Interpolation [53.61556200049156]
  This work aims to provide a deep-learning solution for the motion task. We propose a novel framework, referred to as emphShuffled AutoRegression, which expands the autoregression to generate in arbitrary (shuffled) order. We also propose an approach to constructing a particular kind of dependency graph, with three stages assembled into an end-to-end spatial-temporal motion Transformer.
  arXiv  Detail & Related papers  (2023-06-10T07:14:59Z)
• Stochastic Inexact Augmented Lagrangian Method for Nonconvex Expectation Constrained Optimization [88.0031283949404]
  Many real-world problems have complicated non functional constraints and use a large number of data points. Our proposed method outperforms an existing method with the previously best-known result.
  arXiv  Detail & Related papers  (2022-12-19T14:48:54Z)
• Simultaneous Contact-Rich Grasping and Locomotion via Distributed Optimization Enabling Free-Climbing for Multi-Limbed Robots [60.06216976204385]
  We present an efficient motion planning framework for simultaneously solving locomotion, grasping, and contact problems. We demonstrate our proposed framework in the hardware experiments, showing that the multi-limbed robot is able to realize various motions including free-climbing at a slope angle 45deg with a much shorter planning time.
  arXiv  Detail & Related papers  (2022-07-04T13:52:10Z)
• Efficient and High-quality Prehensile Rearrangement in Cluttered and Confined Spaces [16.745331954312775]
  This work focuses on problems where such interactions are critical for completing tasks and extends state-of-the-art results in rearrangement planning. It proposes a new efficient and complete solver under general constraints for monotone instances, which can be solved by moving each object at most once. The new monotone solver is integrated with a global planner to solve non-monotone instances with high-quality solutions fast.
  arXiv  Detail & Related papers  (2021-10-06T14:42: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.