Crocoddyl is an optimal control library for robot control under contact sequence. Its solver is based on various efficient Differential Dynamic Programming (DDP)-like algorithms
Thanks for developing such a great OP solver. I am writing a constrainted MPC based on the Crocoddyl, and noticed that the v2 version added the ConstraintModelResidual class. So I wonder how the solver handles inequality constraints using this class (or its principal). Its calc() function seems to provide little informtion. Are the constraints formulated as quadratic penalties in the cost as in the example? If so, how how do I adjust the weights for these penalty functions?
Hi,
Thanks for developing such a great OP solver. I am writing a constrainted MPC based on the Crocoddyl, and noticed that the v2 version added the
ConstraintModelResidual
class. So I wonder how the solver handles inequality constraints using this class (or its principal). Itscalc()
function seems to provide little informtion. Are the constraints formulated as quadratic penalties in the cost as in the example? If so, how how do I adjust the weights for these penalty functions?Thanks a lot!