Constrained Stein Variational Gradient Descent for Robot Perception, Planning, and Identification

• URL: http://arxiv.org/abs/2506.00589v1
• Date: Sat, 31 May 2025 14:52:34 GMT
• Title: Constrained Stein Variational Gradient Descent for Robot Perception, Planning, and Identification
• Abstract summary: 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.
• Score: 11.126853736828984
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many core problems in robotics can be framed as constrained optimization problems. Often on these problems, the robotic system has uncertainty, or it would be advantageous to identify multiple high quality feasible solutions. To enable this, we present two novel frameworks for applying principles of constrained optimization to the new variational inference algorithm Stein variational gradient descent. Our general framework supports multiple types of constrained optimizers and can handle arbitrary constraints. We demonstrate on a variety of problems that we are able to learn to approximate distributions without violating constraints. Specifically, 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.

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)
• Globalized Constrained Stein Variational Inference for Diverse Feasible Robot Motion Planning [11.448622437140022]
  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.
  arXiv  Detail & Related papers  (2026-07-14T13:02:45Z)
• Complementarity by Construction: A Lie-Group Approach to Solving Quadratic Programs with Linear Complementarity Constraints [9.967127506836453]
  Many problems in robotics require reasoning over a mix of continuous dynamics and discrete events.<n>We provide an opensource solver, Marble, that is implemented in C++ with Julia.
  arXiv  Detail & Related papers  (2026-04-13T19:31:41Z)
• Scalable Multi-Robot Path Planning via Quadratic Unconstrained Binary Optimization [0.0]
  Multi-Agent Path Finding (MAPF) remains a fundamental challenge in robotics.<n>This paper investigates Quadratic Unconstrained Binary Optimization (QUBO) as a structurally scalable alternative for simultaneous multi-robot path planning.
  arXiv  Detail & Related papers  (2026-02-16T14:50:04Z)
• Discrete-Guided Diffusion for Scalable and Safe Multi-Robot Motion Planning [56.240199425429445]
  Multi-Robot Motion Planning (MPMP) involves generating trajectories for multiple robots operating in a shared continuous workspace.<n>While discrete multi-agent finding (MAPF) methods are broadly adopted due to their scalability, their coarse discretization trajectory quality.<n>This paper tackles limitations of two approaches by introducing discrete MAPF solvers with constrained generative diffusion models.
  arXiv  Detail & Related papers  (2025-08-27T17:59:36Z)
• Hierarchical Contact-Rich Trajectory Optimization for Multi-Modal Manipulation using Tight Convex Relaxations [12.578064173652148]
  We present a novel framework for designing trajectories of robots, objects, and contacts efficiently for contact-rich manipulation.<n>We propose a hierarchical optimization framework where Mixed-Integer Linear Program (MILP) selects optimal contacts between robot & object.<n>We present a convex relaxation of bilinear constraints using binary encoding technique such that MILP can provide tighter solutions.
  arXiv  Detail & Related papers  (2025-03-11T01:40:23Z)
• 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)
• A distributed, plug-n-play algorithm for multi-robot applications with a priori non-computable objective functions [2.2452191187045383]
  In multi-robot applications, the user-defined objectives of the mission can be cast as a general optimization problem. Standard gradient-descent-like algorithms are not applicable to these problems. We introduce a new algorithm that carefully designs each robot's subcost function, the optimization of which can accomplish the overall team objective.
  arXiv  Detail & Related papers  (2021-11-14T20:40:00Z)
• Modeling the Second Player in Distributionally Robust Optimization [90.25995710696425]
  We argue for the use of neural generative models to characterize the worst-case distribution. This approach poses a number of implementation and optimization challenges. We find that the proposed approach yields models that are more robust than comparable baselines.
  arXiv  Detail & Related papers  (2021-03-18T14:26:26Z)
• Large Scale Distributed Collaborative Unlabeled Motion Planning with Graph Policy Gradients [122.85280150421175]
  We present a learning method to solve the unlabelled motion problem with motion constraints and space constraints in 2D space for a large number of robots. We employ a graph neural network (GNN) to parameterize policies for the robots.
  arXiv  Detail & Related papers  (2021-02-11T21:57:43Z)
• Nothing But Geometric Constraints: A Model-Free Method for Articulated Object Pose Estimation [89.82169646672872]
  We propose an unsupervised vision-based system to estimate the joint configurations of the robot arm from a sequence of RGB or RGB-D images without knowing the model a priori. We combine a classical geometric formulation with deep learning and extend the use of epipolar multi-rigid-body constraints to solve this task.
  arXiv  Detail & Related papers  (2020-11-30T20:46:48Z)
• Learning Constrained Distributions of Robot Configurations with Generative Adversarial Network [15.962033896896385]
  In high dimensional robotic system, the manifold of the valid configuration space often has a complex shape. We propose a generative adversarial network approach to learn the distribution of valid robot configurations under such constraints.
  arXiv  Detail & Related papers  (2020-11-11T11:43:54Z)
• Scalable Differentiable Physics for Learning and Control [99.4302215142673]
  Differentiable physics is a powerful approach to learning and control problems that involve physical objects and environments. We develop a scalable framework for differentiable physics that can support a large number of objects and their interactions.
  arXiv  Detail & Related papers  (2020-07-04T19:07:51Z)
• An Integer Linear Programming Framework for Mining Constraints from Data [81.60135973848125]
  We present a general framework for mining constraints from data. In particular, we consider the inference in structured output prediction as an integer linear programming (ILP) problem. We show that our approach can learn to solve 9x9 Sudoku puzzles and minimal spanning tree problems from examples without providing the underlying rules.
  arXiv  Detail & Related papers  (2020-06-18T20:09:53Z)
• Scalable and Probabilistically Complete Planning for Robotic Spatial Extrusion [0.755972004983746]
  We present a rigorous formalization of robotic spatial extrusion planning. We show that, although these constraints often conflict with each other, a greedy backward state-space search guided by a stiffness-aware is able to successfully balance both constraints.
  arXiv  Detail & Related papers  (2020-02-06T17:05:55Z)

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.