13.07.2015 Views

Assessment and Future Directions of Nonlinear Model Predictive ...

Assessment and Future Directions of Nonlinear Model Predictive ...

Assessment and Future Directions of Nonlinear Model Predictive ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

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

262 M. Cannon, P. Couchmann, <strong>and</strong> B. KouvaritakisRemark 2. For any j ≥ 1, Z 1 <strong>and</strong> Z 2 can be computed using∑j−1Z 2 (k + j|k) = Ψ i Ψi T , Ψ i = A j−1−i[ B 1 u(k + i|k) ··· B L u(k + i|k) ] (21a)i=0Z 1 (k + j|k) =¯x(k + j|k)¯x T (k + j|k)+Z 2 (k + j|k)(21b)Therefore L(k + N|k) is a quadratic function <strong>of</strong> the predicted input sequence:L(k + N|k) =u T (k)Hu(k)+2g T u(k)+γwhere u(k) =[u T (k|k) ··· u T (k + N − 1|k)] T <strong>and</strong> H, g are constants.Theorem 1. If L(k+N|k) is given by (17) <strong>and</strong> L(k+N+1|k+1),l(k+N+1|k+1)correspond to the predictions generated by the input sequence (16), then (15) issatisfied if κ 1 ≥ 1.Pro<strong>of</strong>. From (19), (18), <strong>and</strong> u(k + N|k +1)=Kx(k + N|k + 1) it follows thatL(k + N +1|k +1)+l(k + N|k +1)= L(k + N|k + 1). Furthermore, from (21a,b)we haveE k Z 2 (k + N|k +1)=Z 2 (k + N|k +1),E k Z 1 (k + N|k +1)=Z 1 (k + N|k).Combining these results, the LHS <strong>of</strong> (15) can be writtenE k L(k+N+1|k+1)+l(k+N|k+1) =Tr Z 1(k+N|k)S 1 +(κ 2 1−1)Tr Z 2(k+N|k+1)S 2<strong>and</strong> therefore (15) holds if κ 1 ≥ 1 since (21a) implies Z 2 (k + N|k +1)≼ Z 2 (k +N|k).6 MPC Strategy <strong>and</strong> Closed-Loop PropertiesThe stage cost, terminal cost <strong>and</strong> terminal constraints are combined in thissection to construct a receding horizon strategy based on the online optimization:minimizeu(k)J k =N−1∑j=0l(k + j|k)+L(k + N|k)subject to the following constraints, invoked for j =1,...,N − 1:|u(k + j|k)| ≤UPr ( )y 2 (k + j|k) ≤ Y 2 ≥ p2Pr ( x(k + N|k) ∈ Ω ) ≥ p 2(22a)(22b)(22c)(22d)The MPC law is defined as u(k) =u ∗ (k|k), where u ∗ (k) ={u ∗ (k|k),...,u ∗ (k +N − 1|k)} is optimal at time k, computed on the basis <strong>of</strong> the measured x(k).From the plant model <strong>and</strong> parameter distributions, the constraints (22c) on y 2can be written

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

Saved successfully!

Ooh no, something went wrong!