A sparse MPC solver for walking motion generation (old version).
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
boundDefines simple bounds associated with variables
chol_solve_asSolves KKT system using Cholesky decomposition
chol_solve_ipSolves KKT system using Cholesky decomposition
smpc::controlA container for a control vector
footstepDefines a footstep
IPMInverted pendulum model
matrix_EImplements multiplication of matrix E and E' by a vector
matrix_ecL_asInitializes lower diagonal matrix L and performs backward and forward substitutions using this matrix
matrix_ecL_ipInitializes lower diagonal matrix L and performs backward and forward substitutions using this matrix
problem_parametersA set of problem parameters
qp_asSolve a quadratic program with a specific structure. qp_as = Quadratic Programming / Active Set
qp_ipSolve a quadratic program with a specific structure. qp_ip = Quadratic Programming / Interior-point method
qp_solverSolve a quadratic program with a specific structure
RectangularConstraint_ZMPDefines rectangular constraints (of the form D*z <= d) for the ZMP
smpc_parametersA container for parameters of the SMPC solver
smpc::solverAPI of the sparse MPC solver
smpc::stateAn abstract class representing state
smpc::state_origA container for a state in the original form:
state_parameters
smpc::state_tildeA container for a state in tilde form (after variable substitution):
WMGDefines the parameters of the Walking Pattern Generator