Overview
| Comment: | Modified for new qp_mu algorithms |
|---|---|
| Downloads: | Tarball | ZIP archive |
| Timelines: | family | ancestors | descendants | both | origin/master | trunk |
| Files: | files | file ages | folders |
| SHA3-256: |
a6445e64990ab189b620d263dc78e405 |
| User & Date: | gawthrop@users.sourceforge.net on 2002-09-11 14:17:36.000 |
| Other Links: | branch diff | manifest | tags |
Context
|
2002-09-11
| ||
| 14:19:28 | Time-varying set point W check-in: 9d59aab3cb user: gawthrop@users.sourceforge.net tags: origin/master, trunk | |
| 14:17:36 | Modified for new qp_mu algorithms check-in: a6445e6499 user: gawthrop@users.sourceforge.net tags: origin/master, trunk | |
|
2002-09-03
| ||
| 19:34:15 | Write EdX regardless - csex is needed to create ode when not optimised. check-in: 30895e1289 user: geraint@users.sourceforge.net tags: origin/master, trunk | |
Changes
Modified mttroot/mtt/lib/control/PPP/ppp_qp.m
from [3e26f7769e]
to [7d027370b3].
| ︙ | ︙ | |||
36 37 38 39 40 41 42 |
[n,m] = size(J_ux);
if (n != n_U)||(m != n_x)
error("J_ux should be %ix%i not %ix%i",n_U,n_x,n,m);
endif
if length(gamma)>0 # Constraints exist: do the QP algorithm
| > | | 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 |
[n,m] = size(J_ux);
if (n != n_U)||(m != n_x)
error("J_ux should be %ix%i not %ix%i",n_U,n_x,n,m);
endif
if length(gamma)>0 # Constraints exist: do the QP algorithm
## QP solution for weights U
[U,iterations] = qp_mu(J_uu,(J_ux*x - J_uw*W),Gamma,gamma,mu);
##U = qp(J_uu,(J_ux*x - J_uw*W),Gamma,gamma); # QP solution for weights U
##U = pd_lcp04(J_uu,(J_ux*x - J_uw*W),Gamma,gamma); # QP solution for weights U
u = Us0*U; # Control signal
else # Do the unconstrained solution
## Compute the open-loop gains
iterations = 0;
|
| ︙ | ︙ |