diff options
author | YanzhenXiang <54230111+YanzhenXiangRobotics@users.noreply.github.com> | 2023-11-06 16:49:26 +0100 |
---|---|---|
committer | GitHub <noreply@github.com> | 2023-11-06 16:49:26 +0100 |
commit | d6b96c55ebb89ebd6e2d990ec89122799c68a230 (patch) | |
tree | 7a837438da9e07a5e77658c6d882577fff8bcae1 /templates/MPC.m | |
parent | Update 23 (diff) | |
parent | update the new submission zip generated from npross branch (diff) | |
download | mpc_pe-master.tar.gz mpc_pe-master.zip |
Submission
Diffstat (limited to '')
-rw-r--r-- | templates/MPC.m | 44 |
1 files changed, 35 insertions, 9 deletions
diff --git a/templates/MPC.m b/templates/MPC.m index 3e9d2f1..355eb81 100644 --- a/templates/MPC.m +++ b/templates/MPC.m @@ -15,31 +15,57 @@ classdef MPC function obj = MPC(Q,R,N,params) nu = params.model.nu; nx = params.model.nx; - - % define optimization variables + % YOUR CODE HERE + A=params.model.A; + B=params.model.B; U = sdpvar(repmat(nu,1,N),ones(1,N),'full'); + X = sdpvar(repmat(nx,1,N+1),ones(1,N+1),'full'); + + [K,P,~] = dlqr(A,B,Q,R); + +% s_max=params.constraints.MaxAbsPositionXZ; +% y_max=params.constraints.MaxAbsPositionY; +% u_max = params.constraints.MaxAbsThrust; + H_x = params.constraints.StateMatrix; + h_x = params.constraints.StateRHS; + H_u = params.constraints.InputMatrix; + h_u = params.constraints.InputRHS; X0 = sdpvar(nx,1,'full'); + objective = 0; + constraints = X{1} == X0; + for k = 1:N + constraints = [ ... + constraints, ... + X{k+1} == A*X{k} + B*U{k} , ... + H_x * X{k} <= h_x, ... + H_u * U{k} <= h_u ... + ]; - % YOUR CODE HERE - + objective = objective + X{k}'*Q*X{k} + U{k}'*R*U{k}; + end + objective=objective+X{N+1}'*P*X{N+1}; + % terminal constraint +% constraints = [ ... +% constraints, ... +% X{N+1} == zeros(nx,1) +% ]; opts = sdpsettings('verbose',1,'solver','quadprog'); obj.yalmip_optimizer = optimizer(constraints,objective,opts,X0,{U{1} objective}); end function [u, ctrl_info] = eval(obj,x) - %% evaluate control action by solving MPC problem, e.g. + % evaluate control action by solving MPC problem tic; - [optimizer_out,errorcode] = obj.yalmip_optimizer(x); + [optimizer_out,errorcode,~] = obj.yalmip_optimizer{x}; solvetime = toc; - + [u, objective] = optimizer_out{:}; feasible = true; if (errorcode ~= 0) feasible = false; end - ctrl_info = struct('ctrl_feas',feasible,'objective',objective,'solvetime',solvetime); end end -end
\ No newline at end of file +end |