02.08.2013 Views

Model Predictive Control

Model Predictive Control

Model Predictive Control

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

216 11 Receding Horizon <strong>Control</strong><br />

A different tuning of the controller is required when such polyhedral regions appear<br />

and the overall performance is not satisfactory. The second issue is the presence of<br />

multiple solutions, that might arise from the degeneracy of the dual problem (6.14).<br />

Multiple optimizers are undesirable, as they might lead to a fast switching between<br />

the different optimal control moves when the optimization program (10.75) is solved<br />

on-line, unless interior-point methods are used. The mp-LP solvers [101, 55] can<br />

detect critical regions of degeneracy and partition them into sub-regions where a<br />

unique optimizer is defined. Example 11.5 illustrates a RHC law where multiple<br />

optimizers and idle control occur.<br />

Example 11.5 Consider the double integrator of Example 11.4, with N = 1, Q =<br />

1 0<br />

0 1<br />

<br />

, R = 1, P = Q subject to the input constraints<br />

and the state constraints<br />

X = {x :<br />

The associated mp-LP problem is<br />

min<br />

ε1,ε2,u0<br />

ε1 + ε2<br />

U = {u : − 1 ≤ u ≤ 1} (11.42)<br />

−10<br />

−10<br />

subj. to<br />

⎡<br />

−1 0<br />

⎤<br />

1<br />

⎡<br />

⎢ −1<br />

⎢ 0<br />

⎢ 0<br />

⎢ 0<br />

⎢ 0<br />

⎢ 0<br />

⎢ 0<br />

⎢ 0<br />

⎢ 0<br />

⎣<br />

0<br />

0<br />

−1<br />

−1<br />

−1<br />

−1<br />

0<br />

0<br />

0<br />

0<br />

0<br />

−1 ⎥ ⎢<br />

⎥ ⎢<br />

0 ⎥ ⎢<br />

⎥ ⎢<br />

−1 ⎥ ⎢<br />

⎥<br />

0 ⎥ ⎡ ⎤ ⎢<br />

⎥ ε1 ⎢<br />

1 ⎥ ⎣ ε2 ⎦ ⎢<br />

≤ ⎢<br />

1 ⎥ ⎢<br />

⎥ u0 ⎢<br />

0 ⎥ ⎢<br />

⎥ ⎢<br />

−1 ⎥ ⎢<br />

0<br />

⎥ ⎢<br />

⎥ ⎢<br />

1<br />

⎦ ⎣<br />

0 0 −1<br />

<br />

≤ x ≤<br />

0<br />

0<br />

0<br />

0<br />

0<br />

0<br />

10<br />

10<br />

10<br />

10<br />

1<br />

1<br />

10<br />

10<br />

⎤<br />

⎡<br />

⎥ ⎢<br />

⎥ ⎢<br />

⎥ ⎢<br />

⎥ ⎢<br />

⎥ ⎢<br />

⎥ ⎢<br />

⎥ ⎢<br />

⎥ ⎢<br />

⎥ ⎢<br />

⎥ + ⎢<br />

⎥ ⎢<br />

⎥ ⎢<br />

⎥ ⎢<br />

⎥ ⎢<br />

⎥ ⎢<br />

⎥ ⎢<br />

⎥ ⎢<br />

⎦ ⎣<br />

<br />

} (11.43)<br />

0 0<br />

0 0<br />

1 1<br />

0 1<br />

−1 −1<br />

0 −1<br />

0 −1<br />

−1 −1<br />

0 1<br />

1 1<br />

0 0<br />

0 0<br />

⎤<br />

⎥ x(t)<br />

⎥<br />

⎦<br />

The solution of (11.44) gives rise to idle control and multiple optimizers.<br />

(11.44)<br />

In fact, the corresponding polyhedral partition of the state-space is depicted in<br />

Fig. 11.8. The RHC law is<br />

⎧<br />

degenerate if<br />

(Region #1)<br />

0<br />

⎪⎨<br />

if<br />

u =<br />

degenerate if<br />

⎪⎩<br />

0 if<br />

<br />

−1.00 −2.00<br />

1.00 0.00<br />

1.00 1.00<br />

−1.00 −1.00<br />

x ≤<br />

0.00 1.00<br />

1.00 0.00<br />

1.00 2.00<br />

−1.00 −1.00<br />

<br />

x ≤<br />

−1.00 0.00 <br />

1.00 2.00<br />

1.00 1.00 x ≤<br />

−1.00 −1.00<br />

0.00 −1.00<br />

<br />

−1.00 −2.00<br />

−1.00 0.00 x ≤<br />

1.00 1.00<br />

<br />

0.00<br />

0.00<br />

10.00<br />

10.00<br />

11.00<br />

<br />

0.00<br />

0.00<br />

10.00<br />

<br />

0.00<br />

0.00<br />

10.00<br />

10.00<br />

11.00<br />

<br />

0.00<br />

0.00<br />

10.00<br />

(Region #2)<br />

(Region #3)<br />

(Region #4)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!