CRISP is a primal-only sequential convex programming solver with a weighted l1 penalty merit function that solves contact-implicit motion planning problems from all-zero initialization.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning
CRISP is a primal-only sequential convex programming solver with a weighted l1 penalty merit function that solves contact-implicit motion planning problems from all-zero initialization.