CALIPSO: A Differentiable Solver for Trajectory Optimization with Conic and Complementarity Constraints

نویسندگان

چکیده

We present a new solver for non-convex trajectory optimization problems that is specialized robotics applications. CALIPSO, or the Conic Augmented Lagrangian Interior-Point SOlver, combines several strategies constrained numerical to natively handle second-order cones and complementarity constraints. It reliably solves challenging motion planning include contact-implicit formulations of impacts Coulomb friction, thrust limits subject conic constraints, state-triggered constraints where general-purpose nonlinear programming solvers like SNOPT Ipopt fail converge. Additionally, CALIPSO supports efficient differentiation solutions with respect problem data, enabling bi-level applications auto-tuning feedback policies. Reliable convergence demonstrated on range from manipulation, locomotion, aerospace domains. An open-source implementation this available.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization with Linear Complementarity Constraints

A Mathematical Program with Linear Complementarity Constraints (MPLCC) is an optimization problem where a continuously differentiable function is minimized on a set defined by linear constraints and complementarity conditions on pairs of complementary variables. This problem finds many applications in several areas of science, engineering and economics and is also an important tool for the solu...

متن کامل

Optimality Conditions for Optimization Problems with Complementarity Constraints

Optimization problems with complementarity constraints are closely related to optimization problems with variational inequality constraints and bilevel programming problems. In this paper, under mild constraint qualifications, we derive some necessary and sufficient optimality conditions involving the proximal coderivatives. As an illustration of applications, the result is applied to the bilev...

متن کامل

A recurrent neural network for nonlinear optimization with a continuously differentiable objective function and bound constraints

This paper presents a continuous-time recurrent neural-network model for nonlinear optimization with any continuously differentiable objective function and bound constraints. Quadratic optimization with bound constraints is a special problem which can be solved by the recurrent neural network. The proposed recurrent neural network has the following characteristics. 1) It is regular in the sense...

متن کامل

WEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS

The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Springer proceedings in advanced robotics

سال: 2023

ISSN: ['2511-1256', '2511-1264']

DOI: https://doi.org/10.1007/978-3-031-25555-7_34