aligator  0.6.1
A primal-dual augmented Lagrangian-type solver for nonlinear trajectory optimization.
Loading...
Searching...
No Matches
Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 123456]
 C_Base
 C_FunType
 Caligator::BlkMatrix< _MatrixType, _N, _M >Block matrix class, with a fixed-size number of row and column blocks
 Caligator::BlkMatrix< MatrixXs, 2, 1 >
 Caligator::BlkMatrix< MatrixXs, 2, 2 >
 Caligator::BlkMatrix< MatrixXs, 4, 4 >
 Caligator::BlkMatrix< RowMatrixXs, 2, 1 >
 Caligator::BlkMatrix< RowMatrixXs, 4, 1 >
 Caligator::BlkMatrix< VectorXs, -1, 1 >
 Caligator::BlkMatrix< VectorXs, 2, 1 >
 Caligator::BlkMatrix< VectorXs, 4, 1 >
 CCallbackBase
 Caligator::CallbackBaseTpl< Scalar >Base callback class
 Caligator::Cloneable< T >Mixin which makes a class/class hierarchy cloneable
 Caligator::Cloneable< StageDataTpl< _Scalar > >
 Caligator::Cloneable< StageDataTpl< Scalar > >
 Caligator::Cloneable< StageFunctionDataTpl< _Scalar > >
 Caligator::Cloneable< StageFunctionDataTpl< Scalar > >
 Caligator::Cloneable< StageModelTpl< _Scalar > >
 Caligator::Cloneable< StageModelTpl< Scalar > >
 Caligator::ConstraintProximalScalerTpl< Scalar >Weighting strategy for the constraints in a stack
 Caligator::ConstraintStackTpl< Scalar >Convenience class to manage a stack of constraints
 Caligator::ContactMapTpl< _Scalar >Contact map for centroidal costs and dynamics
 Caligator::ContactMapTpl< Scalar >
 Caligator::dynamics::ContinuousDynamicsAbstractTpl< _Scalar >Continuous dynamics described by differential-algebraic equations (DAEs) \(F(\dot{x}, x, u) = 0\)
 Caligator::dynamics::ContinuousDynamicsAbstractTpl< context::Scalar >
 CContinuousDynamicsData
 Caligator::dynamics::ContinuousDynamicsDataTpl< _Scalar >Data struct for ContinuousDynamicsAbstractTpl
 Caligator::dynamics::ContinuousDynamicsDataTpl< Scalar >
 Caligator::CostAbstractTpl< _Scalar >Stage costs \( \ell(x, u) \) for control problems
 Caligator::CostAbstractTpl< Scalar >
 CCostData
 Caligator::CostDataAbstractTpl< _Scalar >Data struct for CostAbstractTpl
 Caligator::CostDataAbstractTpl< Scalar >
 Cboost::python::def_visitor
 Caligator::DefaultScaling< Scalar >TODO: NEW G.A.R. BACKEND CAN'T HANDLE DIFFERENT WEIGHTS, PLS FIX
 CDynamicsModelTpl
 Cstd::enable_shared_from_this
 Cstd::exceptionSTL class
 CExplicitDynamicsData
 Caligator::gar::RiccatiSolverDense< _Scalar >::FactorData
 Caligator::FilterTpl< Scalar >A basic filter line-search strategy
 Caligator::forwardDynamics< T >Evaluates the forward map for a discrete dynamics model, implicit or explicit
 Caligator::frame_api
 Caligator::gar::ProximalRiccatiKernel< Scalar >::kkt0_t
 Caligator::LagrangianDerivatives< Scalar >Compute the derivatives of the problem Lagrangian
 Caligator::LogColumn
 Caligator::LoggerA table logging utility to log the trace of the numerical solvers
 Caligator::gar::LQRKnotTpl< Scalar >Struct describing a stage of a constrained LQ problem
 Caligator::gar::LQRProblemTpl< Scalar >
 Caligator::NewtonRaphson< Scalar >Newton-Raphson procedure, e.g. to compute forward dynamics from implicit functions
 Caligator::NewtonRaphson< Scalar >::Options
 Cfmt::ostream_formatter
 Caligator::PDALFunction< _Scalar >Primal-dual augmented Lagrangian merit function
 Caligator::gar::ProximalRiccatiKernel< Scalar >Kernel for use in Riccati-like algorithms for the proximal LQ subproblem
 Caligator::QFunctionTpl< _Scalar >Q-function model parameters
 Caligator::ResultsBaseTpl< _Scalar >
 Caligator::ResultsBaseTpl< Scalar >
 Caligator::gar::RiccatiSolverBase< _Scalar >
 Caligator::gar::RiccatiSolverBase< Scalar >
 Caligator::detail::slice_impl_tpl< Base >Slicing and indexing of a function's output
 Caligator::detail::slice_impl_tpl< StageFunctionTpl< Scalar > >
 Caligator::detail::slice_impl_tpl< UnaryFunctionTpl< Scalar > >
 Caligator::SolverFDDPTpl< Scalar >The feasible DDP (FDDP) algorithm, from Mastalli et al. (2020)
 Caligator::SolverProxDDPTpl< _Scalar >A proximal, augmented Lagrangian-type solver for trajectory optimization
 Cboost::span< T, E >
 Cboost::detail::span_bytes< T, E >
 Cboost::detail::span_bytes< T, boost::dynamic_extent >
 Cboost::detail::span_capacity< E, N >
 Cboost::detail::span_compatible< T, E, U, N >
 Cboost::detail::span_convertible< U, T >
 Cboost::detail::span_copyable< T, E, U, N >
 Cboost::detail::span_data< class, class >
 Cboost::detail::span_data< T, typename std::enable_if< std::is_pointer< span_ptr< T > >::value >::type >
 Cboost::detail::span_has_data< class, class, class >
 Cboost::detail::span_has_data< R, T, typename std::enable_if< span_convertible< typename span_data< R >::type, T >::value >::type >
 Cboost::detail::span_has_size< class, class >
 Cboost::detail::span_has_size< R, typename std::enable_if< std::is_convertible< decltype(std::declval< R & >().size()), std::size_t >::value >::type >
 Cboost::detail::span_implicit< E, N >
 Cboost::detail::span_is_array< T >
 Cboost::detail::span_is_array< std::array< T, N > >
 Cboost::detail::span_is_range< R, T >
 Cboost::detail::span_is_span< class >
 Cboost::detail::span_is_span< boost::span< T, E > >
 Cboost::detail::span_store< T, E >
 Cboost::detail::span_store< T, boost::dynamic_extent >
 Cboost::detail::span_sub< E, O >
 Caligator::StageConstraintTpl< Scalar >Simple struct holding together a function and set, to describe a constraint
 Caligator::gar::StageFactor< _Scalar >Per-node struct for all computations in the factorization
 Caligator::gar::StageFactor< Scalar >
 CStageFunctionData
 CStageFunctionTpl
 Caligator::TrajectoryTpl< Scalar >
 Caligator::TrajOptDataTpl< _Scalar >Problem data struct
 Caligator::TrajOptDataTpl< Scalar >
 Caligator::TrajOptProblemTpl< _Scalar >Trajectory optimization problem
 Caligator::gar::StageFactor< _Scalar >::value_t
 Caligator::ValueFunctionTpl< _Scalar >Storage for the value function model parameters
 Caligator::gar::workrange_t
 Caligator::WorkspaceBaseTpl< Scalar >Base workspace struct for the algorithms
 Cboost::python::wrapper
 CManifoldAbstractTpl
 CODEDataTpl