Pith. sign in

REVIEW 1 cited by

Chance-Constrained Optimization in Contact-Rich Systems for Robust Manipulation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2203.02616 v1 pith:F7QVESIN submitted 2022-03-05 cs.RO cs.AI

Chance-Constrained Optimization in Contact-Rich Systems for Robust Manipulation

classification cs.RO cs.AI
keywords optimizationchance-constrainedrobustsystemschancecomplementarityconstraintsformulation
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

This paper presents a chance-constrained formulation for robust trajectory optimization during manipulation. In particular, we present a chance-constrained optimization for Stochastic Discrete-time Linear Complementarity Systems (SDLCS). To solve the optimization problem, we formulate Mixed-Integer Quadratic Programming with Chance Constraints (MIQPCC). In our formulation, we explicitly consider joint chance constraints for complementarity as well as states to capture the stochastic evolution of dynamics. We evaluate robustness of our optimized trajectories in simulation on several systems. The proposed approach outperforms some recent approaches for robust trajectory optimization for SDLCS.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Robustness of Robotic Manipulation: Foundations and Frontiers

    cs.RO 2026-06 unverdicted novelty 2.0

    A survey that formalizes manipulation robustness from probabilistic and control perspectives and reviews mechanisms, metrics, and open problems across robotics subfields.