1 | function mpt_pwa_3 |
---|
2 | |
---|
3 | % Prediction horizon |
---|
4 | N = 4; |
---|
5 | |
---|
6 | pwa3d |
---|
7 | sysStruct.xmin = sysStruct.ymin; |
---|
8 | sysStruct.xmax = sysStruct.ymax; |
---|
9 | probStruct.R = 1; |
---|
10 | probStruct.N=N-1; |
---|
11 | probStruct.norm = 1; |
---|
12 | probStruct.subopt_lev=0; |
---|
13 | probStruct.P_N = zeros(3); |
---|
14 | |
---|
15 | nx = 3; |
---|
16 | nu = 1; |
---|
17 | |
---|
18 | % States x(k), ..., x(k+N) |
---|
19 | x = sdpvar(repmat(nx,1,N),repmat(1,1,N)); |
---|
20 | |
---|
21 | % Inputs u(k), ..., u(k+N) (last one not used) |
---|
22 | u = sdpvar(repmat(nu,1,N),repmat(1,1,N)); |
---|
23 | |
---|
24 | % Binary for PWA selection |
---|
25 | d = binvar(2,1); |
---|
26 | |
---|
27 | % Value functions |
---|
28 | J = cell(1,N); |
---|
29 | |
---|
30 | % Initialize value function at stage N |
---|
31 | J{N} = 0; |
---|
32 | sysStruct.xmin = sysStruct.ymin; |
---|
33 | sysStruct.xmax = sysStruct.ymax; |
---|
34 | for k = N-1:-1:1 |
---|
35 | % Feasible region |
---|
36 | t = sdpvar(nx+nu,1); |
---|
37 | bounds(x{k},sysStruct.xmin,sysStruct.xmax); |
---|
38 | bounds(u{k},sysStruct.umin,sysStruct.umax); |
---|
39 | bounds(x{k+1},sysStruct.xmin,sysStruct.ymax); |
---|
40 | bounds(t,0,600); |
---|
41 | |
---|
42 | F = set(sysStruct.umin < u{k} < sysStruct.umax); |
---|
43 | F = F + set(sysStruct.xmin < x{k} < sysStruct.xmax); |
---|
44 | F = F + set(sysStruct.xmin < x{k+1} < sysStruct.xmax); |
---|
45 | F = F + set(sysStruct.ymin < sysStruct.C{1}*x{k} < sysStruct.ymax); |
---|
46 | F = F + set(sysStruct.ymin < sysStruct.C{1}*x{k+1} < sysStruct.ymax); |
---|
47 | |
---|
48 | F = F + set(-t < [x{k};u{k}] < t) ; |
---|
49 | |
---|
50 | % PWA Dynamics |
---|
51 | for i = 1:length(sysStruct.A) |
---|
52 | F = F + set(implies(d(i),x{k+1} == sysStruct.A{i}*x{k}+sysStruct.B{i}*u{k}+sysStruct.f{i})); |
---|
53 | F = F + set(implies(d(i),sysStruct.guardX{i}*x{k} <= sysStruct.guardC{i})); |
---|
54 | end |
---|
55 | F = F + set(sum(d) == 1); |
---|
56 | |
---|
57 | % Compute value function for one step backwards |
---|
58 | [mpsol{k},sol{k},Uz{k},J{k}] = solvemp(F,sum(t) + J{k+1},[],x{k},u{k}); |
---|
59 | end |
---|
60 | mpsol{1} = mpt_removeOverlaps(mpsol{1}) |
---|
61 | |
---|
62 | |
---|
63 | mbg_asserttolequal(length(mpsol{1}.Pn),182); |
---|