45 #ifndef ILQGAMES_SOLVER_AUGMENTED_LAGRANGIAN_SOLVER_H 46 #define ILQGAMES_SOLVER_AUGMENTED_LAGRANGIAN_SOLVER_H 48 #include <ilqgames/dynamics/multi_player_dynamical_system.h> 49 #include <ilqgames/dynamics/multi_player_integrable_system.h> 50 #include <ilqgames/solver/game_solver.h> 51 #include <ilqgames/solver/ilq_solver.h> 52 #include <ilqgames/solver/lq_feedback_solver.h> 53 #include <ilqgames/solver/lq_open_loop_solver.h> 54 #include <ilqgames/solver/lq_solver.h> 55 #include <ilqgames/solver/problem.h> 56 #include <ilqgames/solver/solver_params.h> 57 #include <ilqgames/utils/linear_dynamics_approximation.h> 58 #include <ilqgames/utils/loop_timer.h> 59 #include <ilqgames/utils/operating_point.h> 60 #include <ilqgames/utils/quadratic_cost_approximation.h> 61 #include <ilqgames/utils/solver_log.h> 62 #include <ilqgames/utils/strategy.h> 63 #include <ilqgames/utils/types.h> 65 #include <glog/logging.h> 82 unconstrained_solver_params.max_solver_iters =
83 params.unconstrained_solver_max_iters;
84 unconstrained_solver_.reset(
85 new ILQSolver(problem, unconstrained_solver_params));
89 std::shared_ptr<SolverLog> Solve(
bool* success =
nullptr,
90 Time max_runtime = 5.0);
94 std::unique_ptr<ILQSolver> unconstrained_solver_;