Robust Model Predictive Control
|
|
- Debra Lynch
- 6 years ago
- Views:
Transcription
1 Robust Model Predctve Control Formulatons of robust control [1] he robust control problem concerns to the control of plants that are only approxmately nown. Usually, t s assumed that the plant les n a set of possble plants and ths set can be quanttatvely characterzed. It s sought a control desgn that assures some nd of performance, whch ncludes stablty, for all the members of the famly of canddate plants. Robust control theory usually assumes that the controller s lnear and most of the avalable theory wll reman useful only when the operatng pont of the system s such that the system s unconstraned or has a fxed set of actve constrants. Norm-bounded uncertanty Assume that one has a nomnal model of the plant, for nstance represented by a transfer functon G ( z ), and that the real plant G(z) can descrbed by one of the followng models: Gz ( ) = G( z) + ( z) (1) [ ] Gz ( ) = G( z) 1 + ( z) (2) 1 [ ] [ ] Gz ( ) = D( z) + ( z) N( z) + ( z), where G ( z) = D ( z) N ( z) (3) D N 1 We do not now exactly what ( z) s, but we assume that t s stable and norm bounded. he most commonly used norm s the H nfnty norm the uncertanty model [2]., whch s the largest gan of Consder a lnear feedbac controller K(z) that stablzes the nomnal plant G( z ). hs controller wll not necessarly stablze the real plant G(z), and t s mportant to have some way of testng whether ths controller can stablze all plants allowed by the uncertanty descrpton. Consder ntally the case n whch uncertanty s represented by the addtve model defned n (1). he closed loop system s shown n Fg. 1 and the transfer functon of the bloc consttuted by the controller and the nomnal system s 1
2 ( ) 1 M ( z) = K( z) I + G ( z) K( z) hs transfer functon M(z) s stable by desgn. Consequently, the loop transfer functon s M ( z) ( z). he small gan theorem (Chap. 1 of [2]) assures that the uncertan plant wth the proposed controller wll be stable f σ jω ( M e ) jω ( ) ( e ) < 1 (4) where σ (.) denotes the largest sngular value. he condton defned n (4) s only suffcent for robust stablty. If condton (4) s not satsfed, t does not mean that stablty wll not be attaned. Inequalty (4) may be tested for a gven controller, to verfy f stablty s guaranteed for any plant lyng n the set that defnes the uncertan plant. When tunng the controller, we may attempt to shape the frequency response of the nomnal closed loop system, such that (4) wll hold for the true system. Fgure 1 Closed loop wth addtve model uncertanty When, uncertanty s descrbed as n (2), the closed loop can be represented as n Fg. 2 below Fgure 2 Closed loop wth nput multplcatve uncertanty In ths case, the transfer functon of the bloc consttuted by the controller and plant s represented by 2
3 ( ) 1 M( z) = K( z) G ( z) I + KG ( Z) and the followng suffcent condton for robust stablty s obtaned: ( ) 1 jω jω jω jω jω σ Ke ( ) G( e ) I+ Ke ( ) G( e ) ( e ) < 1 Analogously, the model uncertanty defned n (3) produces the followng condton for robustness: jω Ke ( ) jω jω 1 jω 1 jω jω σ I + G( e ) K( e ) N( e ) N( e ), D( e ) < 1 I (6) he uncertanty descrptons depcted n (4) to (6), n whch the only specfcaton on uncertanty s a norm-bound, are nown as unstructured uncertanty descrptons. (5) Robust Stablty of the Unconstraned DMC In the conventonal form of DMC, whch s based on the step response model, the state vector of the predctng model s updated as follows [3]: where { } [ y] A[ y] B u K y C[ y] = + ( 1) + F (7) / 1/ 1 / 1 [ ] [ ] y = A y + B u( 1) (8) / 1 1/ 1 s the present samplng tme y = y( ) y( + 1)! y( + n h ) n h s selected such that t s larger than the stablzng tme of the system Iny! I ny! A= " " " # ", A $! Iny I! ny (( nh+ 1). ny) (( nh+ 1). ny) S1 S 2 B= " B $ Sn h S nh + 1 (( nh + 1). ny) ny, 3
4 K F Iny I ny = " $ Iny I ny (( nh + 1). ny) ny, KF S1,1, S1,2,! S1, nu, S S S S! = " " # " Sny,1, Sny,2,! Sny, nu, 2,1, 2,2, 2, nu, ny nu, S $ S corresponds to the step response matrx related to tme step y ( ) = C[ y], [ ] / / y s the state vector of the true plant and y ( ) s the measurement of the plant output at tme. C = C = I ny! ny s the number of outputs and nu s the number of nputs. Combnng eqs. (7) and (8), we obtan: [ ] [ ] [ ] y = ( I K C) A y + K C y + ( I K C) B u( 1) (9) / F 1/ 1 F / F Let us defne the nput horzon as m, and let the control sequence to be appled at tme nu m nu u = u( ) u( + 1) u( + m 1)! $. hs step be gven [ ] (. ) control sequence, for the case of the unconstraned DMC, s obtaned as the least squares soluton to the problem of mnmzng the predcted error norm: [ ] ( ) 1 m m m sp { n n } ( n ) [ ] { } u = S Q QS + R R S Q QN y y (1) where N = I. ny n ( ny. n) ( ny.( nh 1) ), S m n / S1! S2 S1! = " " # " Sm Sm 1! S1 " " " Sn Sn 1! Sn m+ 1 Q and R are weghtng matrces and n s the output horzon. From Eq. (1), t s clear that the frst control move can be represented as 4
5 sp { [ ] } u ( ) = K y y (11) MPC where K MPC s constant. / We can assume that the true plant model s represented by [ ] [ ] y = A y + B u ( ) (12) / 1/ 1 Now, substtutng Eq. (12) n Eq. (9), we obtan [ ] F [ ] F [ ] ( F ) y = ( I K C) A y + K CA y + B+ K C( B B) u( 1) (13) / 1/ 1 1/ 1 Combnng equatons (12) and (13), the state space model of the system that encloses the predcton model and the true plant model s obtaned as follows y A y B u ( 1) y = K CA ( I K C) A y + B+ K C( B B) / F F 1/ 1 F (14) Wth the extended state defned above, the control move gven n (11) can be wrtten as follows sp sp y y y y u ( ) = K = K [ ] MPC sp sp y y y y / / Suppose now that we have an addtve uncertanty n the step response model of the system: B = B+ where S = S S1 S! 2 S nh + 1 hen, the state space model of the system consderng the model uncertanty as represented n (14) can be wrtten as follows: where [ ] φ[ ] β1 β2 (15) y % = y % + u( ) + u( ) (16) + 1/ + 1 / A φ = KFCA ( I KFC) A, β1 B = B, I ' β2 = S = β2 KFC S 5
6 herefore, the uncertan system n closed loop wth the DMC controller can be schematcally represented as n Fgure 3. Fgure 3 Addtve model uncertantes wth DMC Consequently, for the addtve uncertanty, we obtan ' 1 2 M( z) = K I + ( zi φ) β K ( zi φ) β (17) Suppose now that we have a multplcatve uncertanty n the process gan. In ths case, the true gan nput matrx between nput u j and output y s represented as B ( 1, ) = B + (18) j j j Consequently, the uncertanty n the step response coeffcents can be wrtten as follows S S! S S S! S " " # " S S! S 1,1 1,1 1,2 1,2 1, nu 1, nu 2,1 2,1 2,2 2,2 2, nu 2, nu S = ny,1 ny,1 ny,2 ny,2 ny, nu ny, nu he above expresson can be wrtten n a more convenent form S1,1! S1,2!! S1, nu! S2,1 S2,2 S2, nu!!!! S = " " # " " " # "! " " # "! Sny,1! Sny,2!! Sny, nu 6
7 1! 1,1 " "! 1 #! " ny,1 1! # " "! " 1, nu 1! #! 1 ny, nu " "! "! 1 & '('') nu or = S % N S K u herefore, for ths nd of model uncertanty, Eq. (16) can stll be wrtten wth B% β = N = % β % N 2 K u 2 K u KFCB where S% 1 B% = " S % nh + 1 Wth ths nd of model uncertanty, Eq. (16) corresponds to the followng transfer functon 1 [ φ] ( β % 1 β2 K u) yz %( ) = zi + N uz ( ) (19) From Eq. (15), we can wrte sp uz ( ) = K y ( z) yz ( ) % % (2) Equatons (19) and (2) can be translated nto the dagram represented n Fg. 4. 7
8 Fgure 4. Multplcatve model uncertantes wth DMC hus, for the multplcatve uncertan represented n Eq. (18), we have M( z) = Nu K I + ( zi φ) β K ( zi φ) % β (21) Example 1 Consder the followng 2 2 system s+ 1 5s+ 1 Gs () = s+ 1 19s+ 1 whch s based on the FCC heavy ol fractonator system proposed by Shell as a challenge MPC problem. Our purpose s to evaluate the robustness of a gven DMC controller wth respect to the addtve uncertanty n the process gan. he DMC to be tested s characterzed by the followng parameters: =5, n=12, m=5, Q=dag(1,1), R=dag(.3,.3). We wll ntally evaluate the robustness of ths controller for the general addtve uncertanty, whch maxmum bound s gven by ( ) 1 σ = mn S ω σ M( e ω ) where M(z) s gven by Eq. (17). Fg.5 shows 1 as a functon of the frequency ω. σ M( e ω ) We observe that the mnmum corresponds to σ ( S ) = and t occurs at ω *.214 rad/mn. It s nterestng to evaluate the correspondng sze of ths uncertanty n terms of the step response coeffcents. Snce n ths case, t s assumed that uncertanty s unstructured and can appear n any coeffcent of the step response model, matrx S 8
9 has the same dmensons as the nput matrx B defned n Eq. (7). hs means that for ths partcular DMC, S s a matrx of dmensons Wth the help of Matlab routne rand we observe that we can generate random matrces that have the maxmum sngular value larger than and whose elements are lmted to approxmately.13. hs means that the method wll not guarantee robustness outsde the followng approxmate range S.13 S S +.13 = 1,, ny; j = 1,, nu; l = 1,, nh, j, l, j, l, j, l Fgure 5. Robust stablty of DMC General uncertanty We can also compute the model uncertanty that s tolerated by the DMC controller, usng M(z) gven by Eq. (21) where t s assumed that model uncertanty s lmted to the multplcatve uncertanty n the model gan. Fg. 6 shows the values of 1 σ M( e ω ) as a functon of the frequency for ths case. 9
10 Fgure 6. Robust stablty of DMC Gan uncertanty In ths case, we observe that the mnmum of the curve occurs at ω =.5 rad/mn and corresponds to σ ( K ) =.112, whch s smaller than the uncertanty bound for the case of general uncertanty. However, n ths case, matrx K s a 4 4 dagonal matrx whose sngular values correspond to the absolute values of the dagonal elements. hus, we may conclude that the followng relaton s vald: K (1.112) K K ( ) = 1,, ny; j = 1,, nu, j, j, j Notes -From the above example t s clear that, when followng the small gan approach, the resultng ranges of general model uncertantes n whch DMC s guaranteed to be stable are usually qute conservatve. By smulaton, we can verfy that, for the studed system, DMC remans stable for a much larger range of gan uncertantes. Less conservatve uncertanty bounds can be obtaned by tang nto account the structure of the uncertanty n the search of the worst uncertanty. However, the results appear stll not useful for practcal applcatons. -he procedure presented so far has not taen nto account the exstence of constrants on the nput values or on the nput moves. In the presence of nput constrants, the controller becomes nonlnear and the methods presented here may not be general. In other words, when a constrant becomes actve, the closed loop system may become unstable, even f 1
11 uncertanty s smaller than the maxmum uncertanty tolerated by the unconstraned MPC controller. he Infnte Horzon MPC and the Robust Regulator Another class of robust MPC derves from the nfnte horzon model predctve control (IHMPC) proposed by Rawlngs and Muse [4]. hs controller s based on a state space model of the process n the conventonal form: x( + 1) = Ax( ) + Bu( ) (22) y ( ) = Cx ( ) (23) where nx x $ s the state vector, nu u $ s the nput vector, s the samplng nstant, ny y $ s the output vector, A, B and C are matrces of approprate dmenson. he control law of IHMPC s obtaned from the soluton to the followng optmzaton problem: mn u ( ), u ( + 1),, u ( + m 1) J m 1 (24) = j= J = x ( + ) Qx ( + ) + u ( + j) Ru ( + j) mn max u u( + j) u ; j =,1,!, m 1 (25) where m s the control horzon, x( + ) s the predcted state at samplng tme + ; nx nx Q $ and nu nu R $ are postve defnte matrces. For open loop stable systems, the nfnte horzon optmzaton problem defned above can be transformed nto a fnte horzon problem by defnng a termnal state weght P, whch can be obtaned from the soluton of the followng dscrete Lyapunov equaton: APA P= Q (26) Wth the termnal state weght, the IHMPC objectve functon defned n (24) can be wrtten n the form: 11
12 m m 1 J = x( + j) Q x( + j) + x( + m) Px( + m) + u( + j) Ru( + j) (27) j= j= At ths pont, t s mportant to emphasze that the IHMPC as presented above deals only wth the regulator problem, where the system steady state les at the orgn of the (u,x) plane. hs means that the model defned n (22) and (23) s wrtten n terms of the devaton varables u uss and y yss. In ther semnal paper, Rawlngs and Muse [4] show that ths controller s stable and stablty s ndependent of the tunng parameters of the controller. Badgwell [5] extended the nfnte horzon regulator presented above, to the case n whch we have uncertanty n the process model. o present the method of Badgwell, we assume that the true plant can be represented by the model defned n (22) and wth model parameters desgnated as θ = ( A, B ). We also assume that the plant s stable, or that all the egenvalues of A le nsde the unt crcle. In the presence of model uncertanty, θ s not nown, but t s supposed to be a member of a set Ω of L stable models wth the same dmensons as θ. hs means that {,,, } θ Ω, θ θ θ (28) 1 2 L hs nd of uncertanty s usually desgnated as multple-plant uncertanty where each plant may represent the real process at a partcular operatng condton. Wth ths notaton, for nstance, plant corresponds to θ = ( A, B ). For any of the plants defned n (28), the frst term on the rght hand sde of Eq. (27) can be wrtten as follows where ( ) m c c x( + j) θ Q x( + j) θ = x Q θ d xθ j= c xθ = Eu + Dx ( ) 12
13 c θ x xθ ( + 1) xθ ( + 2) = " xθ ( + m) ; E B! AB B! = ; " " # " m 1 m 2 A B A B! B D A 2 A = ; " m A u u ( ) u ( + 1) = " u ( + m 1) Qd = dag[ Q! Q] &'(') m Analogously, the second term on the rght hand sde of (27) can be wrtten as follows ( ) c c θ θ θ θ θ x( + m+ 1) Px( + m+ 1) = x( + m) A PAx( + m) = x C% A PACx % where C% =! Iny and P s obtaned from the soluton of Eq. (26) for the state matrx A. Consequently, the control objectve defned n (27), can be wrtten as follows [ ] [ ] J, θ = Eu ( ) ( ) + Dx Qd + C% A PAC% Eu + Dx + u Rdu (29) where R = dag [ R! R] d &'(') m Equaton (29) can now be wrtten n the general quadratc form, θ 2 θ f, θ θ J = u H u + c u + c (3) where Hθ = E Q + C% A P A C% E + R d D c, θ = x( ) D Q + C% A P A C% E f d cθ = x( ) D ( ) Qd + C% A P AC% Dx Let J, θ be the value of the objectve functon (3) correspondng to the nomnal plant, N 13
14 whch s represented by ( A, B ) θ =. hs s the most probable model, or the model N N N correspondng to the desgn condton of the process. Let also J, θ be the control objectve correspondng to the true plant. Remember that the true plant s unnown, but t s assumed to be one of the plants lyng n Ω. hus, assumng that the state s perfectly nown, the robust regulator proposed by Badgwell [5] can be formulated as the soluton of the followng problem: Problem P1 subject to mn u J J, θ N ˆ, θ J, θ θ Ω (31) mn max u u( + j) u ; j =,1,!, m 1 (25) Let the optmal soluton to the above problem be represented by the followng sequence of control actons * * * * u = u ( ) u ( + 1) u ( + m 1)! (32) In the nequalty defned n (31), Jˆ, θ ( = 1, 2,, L ) represents the numercal value of the control objectve for each of the plants lyng n Ω and obtaned wth the followng control sequence * * uˆ = u ( ) u ( + m 2)! (33) 1 whch s computed usng the optmal control sequence obtaned at samplng nstant -1 as follows: 14
15 uˆ I! " # # " = " # # " u!! I!! * 1 As the control sequence defned n (33) s nherted from the optmal control sequence at tme step -1, t s clear that t satsfes the nput constrants defned n (25). Also, t s easy to show that for the undsturbed true plant ˆ J = J x( 1) Qx( 1) u( 1) Ru( 1) *, θ 1, θ where J * 1, θ s the value of the objectve functon for the true plant wth the optmal control sequence obtaned at samplng tme -1, and Jˆ, θ s the value of the objectve functon of the true plant at samplng tme computed wth the control sequence defned n Eq. (33). hus, as the optmal soluton to Problem P1 at tme wll result n a objectve functon that s not larger than any feasble soluton, we can wrte J Jˆ J J J * * * *, θ, θ 1, θ, θ 1, θ hs means that the control objectve s a contractng functon, and snce t s postve defnte, t wll converge to zero. Consequently, as long as the model of the true plant les n set Ω, the MPC regulator defned n Problem P1 wll drve the true plant to the orgn. Note: In the development of the controller presented above, t s assumed that the term = x( + ) Q x( + ), n the control objectve functon, s bounded for all the plants lyng n set Ω. However, ths cannot happen when the plants have dfferent gans and a change of set pont s ntroduced nto the system. hs case s usually desgnated as servo or output tracng operaton. In ths case, as the soluton of Problem P1 wll produce a sngle optmal control sequence gven by (32), ths optmal control sequence cannot drve smultaneously the outputs of all the plants n Ω to the same set pont. herefore, the robust MPC presented above does not assure stablty for the case n whch there s a 15
16 change n the set pont of the system output. hs means that ths robust MPC cannot be mplemented n practce where the control system has to face both regulator and output tracng operatons. In the next secton we wll present a robust MPC [6] that extends the approach of Badgwell [5] to the practcal case. Extended IHMPC and Robust MPC o extend the controller presented n the prevous secton, such that the resultng controller can be appled to real systems, t s convenent that the state space model defned n (22) and (23) be wrtten n the followng ncremental form [7] where s ( 1) s s x + Iny x ( ) B = + u ( ) d ( 1) F d d x + x ( ) B s x ( ) y ( ) = Iny Ψ d x ( ) (34) (35) s ny x $, d nd x -, nd nd ny nd F -, Ψ $, u ( ) = u ( ) u ( 1) Suppose now that the objectve functon of the extended IHMPC s defned as follows: m 1 = (( + ) δ ) (( + ) δ ) + ( + ) ( + ) +δ δ j= j= (36) V e j Q e j u j R u j S sp where e ( + j) = y ( + j) y, y ( + j) s the predcted output at samplng step +j, m s the control horzon and ny δ $ s a vector of slac varables. ny ny Q $, R $ nu nu and ny ny S $ are postve defnte weghtng matrces. he vector of slac varables δ allows the nfnte horzon controller to be appled to the cases n whch there are not enough degrees of freedom to force all the system outputs to the desred set pont. It can be shown that the control objectve defned n (36) wll be bounded only f [6] 16
17 s sp x ( + m) δ y = (37) When the constrant defned n (37) s satsfed, the nfnte horzon control objectve can be wrtten as follows m ( ) ( ) d d j= V = e( + j) δ Q e( + j) δ + x ( + m) Qx ( + m) m-1 + u ( + j) R u ( + j) +δ Sδ j= (38) where Q ny ny $ s such that Q F QF = F Ψ QΨ F (39) Usng model equatons (34) and (35) to represent the output predcton as a functon of the future control actons and the current state, and (39) to compute the termnal weght, the control objectve represented n (38) can be wrtten n the quadratc form: where u u V = u δ H + 2cf + c δ δ s s s ( m +Ψ u) ( m +Ψ u) + u u + ( m +Ψ u) s 1( m 1 u) 1 B 1F Q1 B 1F F Q2F R1 B 1F QI 1 H = I Q B +Ψ F S+ I QI + Q c f s s d d ( Bm +Ψ 1Fu) Q1( Ie ( ) +Ψ 1Fxx ( ) ) + Fu Q2( Fxx ( ) ) s d I Q1( Ie ( ) +Ψ1Fx x ( ) ) Qe( ) = ( ) 1 x 1( 1 x ) ( x ) 2( x ) s d s d d d c= e( ) Qe( ) + Ie ( ) +Ψ F x ( ) Q Ie ( ) +Ψ F x ( ) + F x ( ) Q F x ( ) (4) (41) (42) (43) I Iny = ", Iny B s m s B! = " # ", s s B! B u ( ) u = " u ( + m 1) 17
18 F x d F B! 2 d d F m FB B, F # ".'/' = u =, Q 1 = dag[ Q! Q], " " " # " m m 1 d m 2 d d F F B F B! B m.''/'' m m.'/'.'/' Q2 = dag[! Q], R1 = dag[ R! R] and Ψ 1 = dag[ Ψ! Ψ], e ( ) = x ( ) y s s sp Analogously, the constrant defned n (37) can be wrtten as follows: s s e ( ) + B% u δ = (44) s s s where B% = B! B &''('') m Fnally, we can defne the extended nfnte horzon MPC [6] that s based on the soluton to the followng optmzaton problem: Problem P2 mn u, δ V subject to (4), (44) and mn max u u( + j) u max j max! = u u( 1) + u( + ) u ; j =,1,, m 1 It can be proved that f the system remans controllable along the trajectory from the present state to the steady state correspondng to the desred set pont, then the control law, resultng from the soluton to Problem P2 at successve tme steps, wll drve the system output asymptotcally to the desred set pont. If an open loop stable system s not controllable at the desred output, the closed loop wth the controller defned above s stll stable, but t wll not be able to drve the outputs to the desred set ponts. 18
19 We can now apply the approach of Badgwell [5] to nclude model uncertanty n the extended nfnte horzon MPC. A robust MPC, whch can be appled to both regulator and output tracng cases, s obtaned as the soluton to the followng optmzaton problem: Problem P3 mn V, θn, u δ, θ, = 1,..., L subject to V Vˆ = 1,..., L (45), θ, θ s e ( ) + B% u δ = = 1,..., L (46) mn max s, θ u u( + j) u max j max! = u u( 1) + u( + ) u ; j =,1,, m 1 In (45), V ˆ, θ s computed wth u ˆ and ˆ δ, θ. he control sequence uˆ s obtaned from the optmal control sequence computed at the prevous samplng tme as follows * * uˆ = u ( ) u ( m 2)! + 1 and ˆ δ, θ s such that s s e ( ) + B% uˆ δ ˆ = = 1,..., L (47), θ he ntroducton of ˆ δ, s necessary to accommodate the feedbac from the state of the θ true plant to the other models lyng wthn Ω. It s easy to show that, for the undsturbed system, we have δ ˆ =δ. *, θ 1, θ Suppose that at tme -1, Problem P2 was solved and the resultng optmal soluton s * u 1 * 1, θ, 1,..., L represented by (, δ = ). For the true plant, the correspondng cost s 19
20 ( ) ( ) m 1 * * * * * 1, θ θ θ j= j= V = e( 1 + j) δ Q e( 1 + j) δ + u ( 1 + j) R u ( 1 + j) + * * 1, θ S 1, θ +δ δ Assume that the frst control acton u * ( 1) was njected nto the true plant and we move to the present samplng tme. At ths tme step, consder the value of the control objectve for the true plant wth the control sequence uˆ and slac vector equal to δ %, θ : ( ) ( ) Vˆ = V e( 1) δ Q e( 1) δ u ( 1) R u ( 1) * * * * *, θ 1, θ 1, θ 1, θ * * V( u, δ( θ), θ) hus, as Problem P3 s always feasble at tme, the control objectve for the true plant wll satsfy the relaton V * *, θ V 1, θ Consequently, V, θ, whch s postve and bounded below by zero, s also nonncreasng. hus, f the nputs do not become saturated and Inequalty (45) holds true for all the models lyng wthn Ω, the control objectve functon wll converge to zero for the true plant. However, smlarly to the nomnal case, for a square system, f one of the nputs becomes saturated, the resultng cost wll stll be bounded but t wll not converge to zero as there wll not be enough degrees of freedom to zero the error on all the outputs. he system outputs wll converge to an equlbrum pont, whch does not correspond to the set pont. Remar Problem P3 can be smplfed as for each θ, there s a slac vector δ, θ, whch becomes part of the set of decson varables of the control optmzaton problem. However, of the robust IHMPC optmzaton problem can be reduced because δ, θ s not constraned, and for each δ, θ there s an equalty constrant defned n (47). herefore, the slacs can be 2
21 elmnated from the optmzaton problem. After the substtuton of δ, θ, the left-hand sde of (46) can be wrtten as follows V% u H% u c% u c%, θ = 2 θ + f, θ + θ where H θ H11, θ H 12, θ = H21, θ H 22 =, cf, θ c f,1, θ c f,2, θ H% H H B% B% H B% H B% s s s s θ = 11, θ + 12, θ + 21, θ + 22 c% e H H B% c c B% s s s f, θ = ( ) 21, θ f1, θ + f 2, θ c% e H e c e c s s s θ = ( ) 22 ( ) + 2 2, ( ) f θ + θ H θ, c f, θ and c θ can be defned as n (4), (41) and (42) respectvely. Wth ths reduced expresson for the objectve functon, the control law for the robust MPC can be obtaned as the soluton to the followng optmzaton problem Problem P4 mn u % V, θ N subject to V% Vˆ = 1,..., L, θ, θ mn max u u( + j) u max j max! = u u( 1) + u( + ) u ; j =,1,, m 1 We now llustrate the applcaton of the robust MPC wth a classcal system of the process control lterature. 21
22 Example 2 Ralhan and Badgwell (2) studed the control of a hgh purty dstllaton column and compared the performance of several regulators, whch are robust to model uncertanty. Here, we smulate ths system wth the controller defned by Problem P3. he model below relates the outputs: dstllate composton (y 1 ) and bottom stream composton (y 2 ), to the nputs: reflux flow rate (u 1 ) and reboler vapor flow rate (u 2 ). y ( s) (1 +γ ).6147(1 +γ ) u ( s) ( ) = (1 +γ1).982(1 +γ2) 2( ) y s s u s In ths model, γ 1 and γ 2 are parameters that defne the model uncertanty, and t s assumed that.4 γ1, γ2.4. Here, we consder an approxmated soluton n whch set Ω s dscretzed as follows Ω= [(, ) (.4,.4) (.4,.4) (.4,.4) (.4,.4) ] It s assumed that the nomnal model corresponds to (, ) (,) γ γ =. In the smulaton of Case 1, the nomnal model also represents the true plant. In the smulaton cases 2 and 3, the true plant s represented by ( γ, γ ) = (.4,.4) and ( γ, γ ) = (.4,.4) 1 2 respectvely. In these three cases, t s smulated the followng scenaro: at tme, the system starts at the orgn and the output reference s changed to ( y1, y 2 ) =(.1, ); at samplng tme 5, t s ntroduced an unmeasured dsturbance correspondng to ( u, u ) = (.5,.5). he tunng parameters of the controller are shown n able set 1 2 set able 1. unng parameters of the cost constranng robust MPC m Q R S u max u mn u max u mn 2 3 dag(1,1) dag(1-2,1-2 ) dag(1 2,1 2 ) Fgure 7 shows the system responses wth the robust controller for the three cases smulated. As expected, a better performance s obtaned when the plant model s the nomnal model. We may also note that the ntroducton of a dsturbance that moves the steady state of the nput to a dfferent value does not affect the convergence of the controller, nether t maes the control optmzaton problem to become unfeasble. 22
23 Fgure 7. Robust control of the dstllaton system. Case 1 ( ), Case 2 ( ), Case 3 ( ) In the second smulaton scenaro, we verfy the effect of an nput saturaton on the convergence of the robust controller. It was consdered the same plant as n Case 2 but wthout the unmeasured dsturbance. he max bound on nput u 1 was reduced to.5, whch s low enough such that u 1 becomes saturated. Fg. 8 shows the responses of the system for ths case, and we can observe that the system outputs stll converge to a steady state, but, as a consequence of the nput saturaton, the outputs does not converge ther set ponts. Nether y 1 tends to ts reference, whch s.1, nor y 2 tends to zero. For the same case, Fg. 9 shows the cost functon (V ) for the true plant. hs cost s non-ncreasng ndcatng convergence, but, because of the nput saturaton, the cost cannot be reduced to zero. 23
24 Fgure 8. Responses of the dstllaton system wth nput saturaton Fg. 3. Cost for the true dstllaton system wth nput saturaton References [1] - Macejows J.M., Predctve Control wth Constrants, Prentce Hall, 22. [2] - Morar M., Zaphrou E., Robust Process Control, Prentce Hall Internatonal, [3] L S., Lm K. Y., Fsher D.G., A State Space formulaton for Model Predctve Control, AIChE Journal, 35 (2), (1989). [4] Rawlngs J.B., Muse K. R., he stablty of constraned multvarable recedng horzon control, IEEE ransactons on Automatc Control, 38 (1), (1993). [5] Badgwell. A., Robust model predctve control of stable lnear systems, Internatonal Journal of Control, 68, (1997). 24
25 [6] Odloa D., Extended robust model predctve control, AIChE Journal, 5 (8), (24). [7] Rodrgues M. A., Odloa D., MPC for stable lnear systems wth model uncertanty, Automatca, 39, (23). Complementary bblography to Robust Model Predctve Control C1) Cuzzola F.A., Geromel J.C., Morar M., An mproved approach for constraned robust model predctve control, Automatca, 38 (7), (22). C2) Kothare, M. V., Balarshnan V., Morar M., Robust constraned model predctve control usng lnear matrx nequaltes, Automatca, 32, (1996). C3) Lee J. H., Cooley B.L., Mn-max predctve control technques for a lnear statespace system wth bounded set of nput matrces, Automatca, 36, (2). C4) Lee J.H, Xao J., Use of two-stage optmzaton n model predctve control of stable and ntegratng systems, Computers and Chemcal Engneerng, 24, (2). C5) Ralhan S., Badgwell.A., Robust control of stable lnear systems wth contnuous uncertanty, Computers and Chemcal Engneerng, 24, (2). C6) Ralhan S., Badgwell.A.,, Robust model predctve control for ntegratng systems wth bounded parameters, Ind. Eng. Chem. Res., 39, (2). C7) Scoaert P.O.M., Mayne D.O., Mn-max feedbac model predctve control for constraned lnear systems, IEEE ransactons on Automatc Control, 43 (8), (1998). C8) Wan Z.Y., Kothare M.V., An effcent off-lne formulaton of robust model predctve control usng lnear matrx nequaltes, Automatca, 39 (5), (23). C9) Wang Y. J., Rawlngs J.B., A new robust model predctve control method I: theory and computaton, Journal of Process Control, 14, (24). 25
26 Exercses 1-Wth the help of Matlab routne PASI_Robust you should study, for the system of example 1, the effect of the followng parameters on the robustness of the unconstraned MPC controller: a) Control horzon m b) Input weght rr c) Weght q of one of the outputs whle the weght of the other output s ept constant. d) For the controller depcted n example 1 of the class notes, show by smulaton that the method based on the small gan theorem may be very conservatve. 2-Based on the results of exercse 1, propose a set of tunng parameters for the unconstraned MPC, such that the closed loop system wll be stable for gan uncertantes as large as ±12% of the nomnal gans. 3-Use Matlab routne PASI_MAIN_SIM to evaluate the performance of the MPC controller when appled to the nomnal system and to the worst case system wth ±12% uncertanty n the model gans. 4-For the system of example 2 (hgh purty dstllaton column), use Matlab routne PASI_RIHMPC to explore by smulaton to what extent the process gan uncertanty can be tolerated by the robust extended IHMPC before becomng unstable. ry to justfy why the controller becomes unstable. 5-For the dstllaton column, verfy by smulaton the effect of weght S. For the other tunng parameters of the controller eep the same values used n example 2. 26
PQI 5780 Chemical Processes Control I. (Ogata, K., Modern Control Engineering, Prentice Hall, 4 th Ed. 2002)
PQI 578 Chemcal Processes Control I I-State-Space Models for Process Control (Ogata, K., Modern Control Engneerng, Prentce Hall, 4 th Ed. 22) Some basc defntons: State: he state of a dynamc system s a
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationRobust Model Predictive Control
Robust Model Predictive Control Motivation: An industrial C3/C4 splitter: MPC assuming ideal model: MPC considering model uncertainty Robust Model Predictive Control Nominal model of the plant: 1 = G ()
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationControl of Uncertain Bilinear Systems using Linear Controllers: Stability Region Estimation and Controller Design
Control of Uncertan Blnear Systems usng Lnear Controllers: Stablty Regon Estmaton Controller Desgn Shoudong Huang Department of Engneerng Australan Natonal Unversty Canberra, ACT 2, Australa shoudong.huang@anu.edu.au
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationTHE GUARANTEED COST CONTROL FOR UNCERTAIN LARGE SCALE INTERCONNECTED SYSTEMS
Copyrght 22 IFAC 5th rennal World Congress, Barcelona, Span HE GUARANEED COS CONROL FOR UNCERAIN LARGE SCALE INERCONNECED SYSEMS Hroak Mukadan Yasuyuk akato Yoshyuk anaka Koch Mzukam Faculty of Informaton
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationApplication of IHMPC to an unstable reactor system: study of feasibility and performance
Proceedngs of the 9th Internatonal Symposum on Dynamcs and Control of Process Systems (DYCOPS 21), Leuven, Belgum, July 5-7, 21 Mayuresh Kothare, Moses Tade, Alan Vande Wouwer, Ilse Smets (Eds.) MoAT2.2
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationAppendix B. The Finite Difference Scheme
140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationLectures on Multivariable Feedback Control
Lectures on Multvarable Feedback Control Al Karmpour Department of Electrcal Engneerng, Faculty of Engneerng, Ferdows Unversty of Mashhad June 200) Chapter 9: Quanttatve feedback theory Lecture Notes of
More information10.34 Numerical Methods Applied to Chemical Engineering Fall Homework #3: Systems of Nonlinear Equations and Optimization
10.34 Numercal Methods Appled to Chemcal Engneerng Fall 2015 Homework #3: Systems of Nonlnear Equatons and Optmzaton Problem 1 (30 ponts). A (homogeneous) azeotrope s a composton of a multcomponent mxture
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationFinite Element Modelling of truss/cable structures
Pet Schreurs Endhoven Unversty of echnology Department of Mechancal Engneerng Materals echnology November 3, 214 Fnte Element Modellng of truss/cable structures 1 Fnte Element Analyss of prestressed structures
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationMEM Chapter 4b. LMI Lab commands
1 MEM8-7 Chapter 4b LMI Lab commands setlms lmvar lmterm getlms lmedt lmnbr matnbr lmnfo feasp dec2mat evallm showlm setmvar mat2dec mncx dellm delmvar gevp 2 Intalzng the LMI System he descrpton of an
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationAPPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14
APPROXIMAE PRICES OF BASKE AND ASIAN OPIONS DUPON OLIVIER Prema 14 Contents Introducton 1 1. Framewor 1 1.1. Baset optons 1.. Asan optons. Computng the prce 3. Lower bound 3.1. Closed formula for the prce
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationNeuro-Adaptive Design - I:
Lecture 36 Neuro-Adaptve Desgn - I: A Robustfyng ool for Dynamc Inverson Desgn Dr. Radhakant Padh Asst. Professor Dept. of Aerospace Engneerng Indan Insttute of Scence - Bangalore Motvaton Perfect system
More informationLinear Feature Engineering 11
Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationTime-Varying Systems and Computations Lecture 6
Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationREAL TIME OPTIMIZATION OF a FCC REACTOR USING LSM DYNAMIC IDENTIFIED MODELS IN LLT PREDICTIVE CONTROL ALGORITHM
REAL TIME OTIMIZATION OF a FCC REACTOR USING LSM DYNAMIC IDENTIFIED MODELS IN LLT REDICTIVE CONTROL ALGORITHM Durask, R. G.; Fernandes,. R. B.; Trerweler, J. O. Secch; A. R. federal unversty of Ro Grande
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationCOEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN
Int. J. Chem. Sc.: (4), 04, 645654 ISSN 097768X www.sadgurupublcatons.com COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN R. GOVINDARASU a, R. PARTHIBAN a and P. K. BHABA b* a Department
More informationSolutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.
Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,
More informationA LINEAR PROGRAMMING APPROACH FOR REGIONAL POLE PLACEMENT UNDER POINTWISE CONSTRAINTS
A LINEAR PROGRAMMING APPROACH FOR REGIONAL POLE PLACEMENT UNDER POINTWISE CONSTRAINTS Max M.D. SANTOS, Eugêno B. CASTELAN, Jean-Claude HENNET Abstract Ths paper consders the problem of control of dscrete-tme
More informationLossy Compression. Compromise accuracy of reconstruction for increased compression.
Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost
More informationA NOVEL DESIGN APPROACH FOR MULTIVARIABLE QUANTITATIVE FEEDBACK DESIGN WITH TRACKING ERROR SPECIFICATIONS
A OVEL DESIG APPROACH FOR MULTIVARIABLE QUATITATIVE FEEDBACK DESIG WITH TRACKIG ERROR SPECIFICATIOS Seyyed Mohammad Mahd Alav, Al Khak-Sedgh, Batool Labb Department of Electronc and Computer Engneerng,
More informationThe Expectation-Maximization Algorithm
The Expectaton-Maxmaton Algorthm Charles Elan elan@cs.ucsd.edu November 16, 2007 Ths chapter explans the EM algorthm at multple levels of generalty. Secton 1 gves the standard hgh-level verson of the algorthm.
More informationEstimation of the composition of the liquid and vapor streams exiting a flash unit with a supercritical component
Department of Energ oltecnco d Mlano Va Lambruschn - 05 MILANO Eercses of Fundamentals of Chemcal rocesses rof. Ganpero Gropp Eercse 8 Estmaton of the composton of the lqud and vapor streams etng a unt
More informationPrimer on High-Order Moment Estimators
Prmer on Hgh-Order Moment Estmators Ton M. Whted July 2007 The Errors-n-Varables Model We wll start wth the classcal EIV for one msmeasured regressor. The general case s n Erckson and Whted Econometrc
More informationInductance Calculation for Conductors of Arbitrary Shape
CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationHigh resolution entropy stable scheme for shallow water equations
Internatonal Symposum on Computers & Informatcs (ISCI 05) Hgh resoluton entropy stable scheme for shallow water equatons Xaohan Cheng,a, Yufeng Ne,b, Department of Appled Mathematcs, Northwestern Polytechncal
More informationDUE: WEDS FEB 21ST 2018
HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant
More informationCHAPTER III Neural Networks as Associative Memory
CHAPTER III Neural Networs as Assocatve Memory Introducton One of the prmary functons of the bran s assocatve memory. We assocate the faces wth names, letters wth sounds, or we can recognze the people
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
More informationModule 3: Element Properties Lecture 1: Natural Coordinates
Module 3: Element Propertes Lecture : Natural Coordnates Natural coordnate system s bascally a local coordnate system whch allows the specfcaton of a pont wthn the element by a set of dmensonless numbers
More informationDynamic Systems on Graphs
Prepared by F.L. Lews Updated: Saturday, February 06, 200 Dynamc Systems on Graphs Control Graphs and Consensus A network s a set of nodes that collaborates to acheve what each cannot acheve alone. A network,
More informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationThe equation of motion of a dynamical system is given by a set of differential equations. That is (1)
Dynamcal Systems Many engneerng and natural systems are dynamcal systems. For example a pendulum s a dynamcal system. State l The state of the dynamcal system specfes t condtons. For a pendulum n the absence
More informationHongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)
ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of
More informationStability and Stabilization for Discrete Systems with Time-varying Delays Based on the Average Dwell-time Method
Proceedngs of the 29 IEEE Internatonal Conference on Systems, an, and Cybernetcs San Antono, TX, USA - October 29 Stablty and Stablzaton for Dscrete Systems wth Tme-varyng Delays Based on the Average Dwell-tme
More informationDecentralized robust control design using LMI
Acta Montanstca Slovaca Ročník 3 (28) číslo -4 Decentralzed robust control desgn usng LMI Anna Flasová and Dušan Krokavec ávrh robustného decentralzovaného radena pomocou LMI he paper deals wth applcaton
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationAN EXTENDED MPC CONVERGENCE CONDITION
Latn Amercan Aled esearch 36:57-6 (6 AN EXENDED MPC CONVEGENCE CONDIION A. H. GONZÁLEZ and. L. MACHEI Insttuto de Desarrollo ecnológco ara la Industra uímca, INEC (UNL - CONICE alegon@cerde.gov.ar lmarch@cerde.gov.ar
More informationFall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede
Fall 0 Analyss of Expermental easurements B. Esensten/rev. S. Errede We now reformulate the lnear Least Squares ethod n more general terms, sutable for (eventually extendng to the non-lnear case, and also
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationMath1110 (Spring 2009) Prelim 3 - Solutions
Math 1110 (Sprng 2009) Solutons to Prelm 3 (04/21/2009) 1 Queston 1. (16 ponts) Short answer. Math1110 (Sprng 2009) Prelm 3 - Solutons x a 1 (a) (4 ponts) Please evaluate lm, where a and b are postve numbers.
More informationCOS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture # 15 Scribe: Jieming Mao April 1, 2013
COS 511: heoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 15 Scrbe: Jemng Mao Aprl 1, 013 1 Bref revew 1.1 Learnng wth expert advce Last tme, we started to talk about learnng wth expert advce.
More information1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 -Davd Klenfeld - Fall 2005 (revsed Wnter 2011) 1 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys
More informationSimultaneous BOP Selection and Controller Design for the FCC Process
Smultaneous BOP Selecton and Controller Desgn for the FCC Process Benjamn Omell & Donald J. Chmelewsk Department of Chemcal & Bologcal Engneerng Outlne Motvatng Example Introducton to BOP Selecton and
More informationCME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13
CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 13 GENE H GOLUB 1 Iteratve Methods Very large problems (naturally sparse, from applcatons): teratve methods Structured matrces (even sometmes dense,
More informationOne-Sided Adaptation for Infinite-Horizon Linear Quadratic N-person Nonzero-sum Dynamic Games
Proceedngs of the European Control Conference 7 Kos, Greece, July -5, 7 TuB45 One-Sded Adaptaton for Infnte-Horzon Lnear Quadratc N-person Nonzero-sum Dynamc Games Xaohuan Tan and Jose B Cruz, Jr, Lfe
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationA new construction of 3-separable matrices via an improved decoding of Macula s construction
Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationMcCabe-Thiele Diagrams for Binary Distillation
McCabe-Thele Dagrams for Bnary Dstllaton Tore Haug-Warberg Dept. of Chemcal Engneerng August 31st, 2005 F V 1 V 2 L 1 V n L n 1 V n+1 L n V N L N 1 L N L 0 VN+1 Q < 0 D Q > 0 B FIGURE 1: Smplfed pcture
More informationSupporting Information
Supportng Informaton The neural network f n Eq. 1 s gven by: f x l = ReLU W atom x l + b atom, 2 where ReLU s the element-wse rectfed lnear unt, 21.e., ReLUx = max0, x, W atom R d d s the weght matrx to
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationVisualization of the Economic Impact of Process Uncertainty in Multivariable Control Design
Vsualzaton of the Economc Impact of Process Uncertanty n Multvarable Control Desgn Benjamn Omell & Donald J. Chmelewsk Department of Chemcal & Bologcal Engneerng Illnos Insttute of echnology Mass r r max
More informationPARTICIPATION FACTOR IN MODAL ANALYSIS OF POWER SYSTEMS STABILITY
POZNAN UNIVE RSITY OF TE CHNOLOGY ACADE MIC JOURNALS No 86 Electrcal Engneerng 6 Volodymyr KONOVAL* Roman PRYTULA** PARTICIPATION FACTOR IN MODAL ANALYSIS OF POWER SYSTEMS STABILITY Ths paper provdes a
More informationStabilizing decentralized model predictive control of nonlinear systems
Automatca 42 (26) 23 236 www.elsever.com/locate/automatca Techncal communque Stablzng decentralzed model predctve control of nonlnear systems L. Magn a,, R. Scattoln b a Dpartmento d Informatca e Sstemstca,
More informationPhysics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1
P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the
More informationAn Interactive Optimisation Tool for Allocation Problems
An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationNeural-Based Decentralized Robust Control of Large-Scale Uncertain Nonlinear Systems with Guaranteed H Performance
Proceedngs of the 45th IEEE Conference on Decson & Control Manchester Grand Hyatt Hotel an Dego CA UA December 3-5 26 Neural-Based Decentralzed Robust Control of Large-cale Uncertan Nonlnear ystems wth
More informationHow Strong Are Weak Patents? Joseph Farrell and Carl Shapiro. Supplementary Material Licensing Probabilistic Patents to Cournot Oligopolists *
How Strong Are Weak Patents? Joseph Farrell and Carl Shapro Supplementary Materal Lcensng Probablstc Patents to Cournot Olgopolsts * September 007 We study here the specal case n whch downstream competton
More information10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)
0-80: Advanced Optmzaton and Randomzed Methods Lecture : Convex functons (Jan 5, 04) Lecturer: Suvrt Sra Addr: Carnege Mellon Unversty, Sprng 04 Scrbes: Avnava Dubey, Ahmed Hefny Dsclamer: These notes
More informationOpen Systems: Chemical Potential and Partial Molar Quantities Chemical Potential
Open Systems: Chemcal Potental and Partal Molar Quanttes Chemcal Potental For closed systems, we have derved the followng relatonshps: du = TdS pdv dh = TdS + Vdp da = SdT pdv dg = VdP SdT For open systems,
More information14 Lagrange Multipliers
Lagrange Multplers 14 Lagrange Multplers The Method of Lagrange Multplers s a powerful technque for constraned optmzaton. Whle t has applcatons far beyond machne learnng t was orgnally developed to solve
More informationAdaptive Consensus Control of Multi-Agent Systems with Large Uncertainty and Time Delays *
Journal of Robotcs, etworkng and Artfcal Lfe, Vol., o. (September 04), 5-9 Adaptve Consensus Control of Mult-Agent Systems wth Large Uncertanty and me Delays * L Lu School of Mechancal Engneerng Unversty
More informationNeuro-Adaptive Design II:
Lecture 37 Neuro-Adaptve Desgn II: A Robustfyng Tool for Any Desgn Dr. Radhakant Padh Asst. Professor Dept. of Aerospace Engneerng Indan Insttute of Scence - Bangalore Motvaton Perfect system modelng s
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationDESIGN OF STABLE TWO-DIMENSIONAL IIR NOTCH FILTER USING ROOT MAP
8th European Sgnal Processng Conference EUSIPCO- Aalborg, Denmar, August -7, DESIGN OF STABLE TWO-DIMENSIONAL IIR NOTC FILTER USING ROOT MAP Soo-Chang Pe and Chen-Cheng Tseng Depart. of Electrcal Engneerng,
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More information