On-line Adaptive Optimal Timing Control of Switched Systems

Size: px
Start display at page:

Download "On-line Adaptive Optimal Timing Control of Switched Systems"

Transcription

1 On-line Adapive Opimal Timing Conrol of Swiched Sysems X.C. Ding, Y. Wardi and M. Egersed Absrac In his paper we consider he problem of opimizing over he swiching imes for a muli-modal dynamic sysem when he complee cos-o-go is no available. The insananeous cos is assumed o be unavailable before run-ime, bu can be measured in real ime. Since he cos-o-go for opimizaion is ime-varying, his problem falls under he caegory of online opimizaion of swiched sysems. The goal of he paper is o presen an ieraive process o updae he swiching imes for he sysem in such a way ha hey remain opimal wih respec o he changing cos-o-go funcion. I is shown ha he informaion required o updae he swiching imes is he rae of change of he insananeous cos, which is in he form of he parial derivaive of he insananeous cos funcion. I. INTRODUCTION Consider a swiched-mode hybrid dynamical sysem henceforh denoed as a swiched sysem described by he equaion ẋ = f 1 x, [0, τ 1 ] f 2 x, τ 1, τ 2 ]... f N1 x, τ N, T], where τ i } N i=1 is a monoone-nondecreasing finie sequence of swiching imes wih τ 1 0, τ N T, for a given final ime T. The sae x R n and he iniial condiion x0 = x 0 R n is given. The funcions f i : R n R n represen he various modes of he sysem and hence he sequence f i } is called he modal sequence. I is assumed ha hese funcions are coninuously differeniable so ha here exiss a unique, well-defined soluion o Equaion 1 wih he given iniial condiion x 0. A paricular mode may be repeaed in he modal sequence, and in his case, f i = f j for some i j. The sandard swich-ime opimizaion problem can be defined as follows. Le Lx, : R n [0, T] R be an insananeouscos cos defined over he sae rajecory, and le J be a corresponding performance funcional, defined via J = 0 1 Lx, d. 2 We view J as a funcion of he swiching imes, denoed collecively by τ := τ 1,..., τ N T superscrip T indicaing ranspose, and hence we label i as J τ. The problem of minimizing J τ over all swiching-ime sequences in some given feasible se has been exensively invesigaed in he pas few years. Following is inroducion in a general X.C. Ding, Y. Wardi and M. Egersed are wih he School of Elecrical and Compuer Engineering, Georgia Insiue of Technology, Alana, GA 30332, USA. ding,ywardi,magnus}@ece.gaech.edu nonlinear hybrid-sysems seing in [4], opimaliy condiions, based on he maximum principle, were derived in [9], [10], [12]. For he general case of nonlinear sysems, several algorihms have been proposed and analyzed in [2], [6], [8], [10], [11], [13], [14], among ohers. A paricular kind of problems arises when he cos funcion Lx, is no known a-priori, bu raher he sysem learns abou i incremenally as ime advances. This is for insance he case when he sysem is racking a arge wih unknown dynamics. In his case, i is impracical o aemp o opimize he cos funcional J as defined in 2 and insead we consider he relaed problem of opimizing a suiable cos-ogo performance funcional. This problem requires an on-line approach ha corresponds o he evoluion of he cos o go. We propose an on-line algorihm ha adapively adjuss an esimaed value of he opimal swiching-ime vecor as new informaion abou he cos funcion becomes available. In oher words, i aemps o rack he soluion poin of he opimal cos-o-go problem as i learns abou changes in he cos funcion. This approach may require an off-line soluion of he problem a he iniial ime = 0, which is assumed o be compuable. A similar approach has been developed for a differen kind of real-ime problems, corresponding o siuaions where he cos funcion is known a priori, bu he sae variable x canno be measured and has o be esimaed via an observer [3], [5]. However, despie he similariy of he approach, he problem considered here is more general, and his is refleced in he algorihms and heir analysis, which are differen from hose in [3], [5]. We poin ou ha he variable parameer of he algorihm consiss of he swiching imes beween he modes, bu he sequence of he modes is assumed o be fixed. The moredifficul problem of opimizing J wih respec o he modal sequence has been addressed in [2] in an off-line seing, and is exension o he on-line seing will be invesigaed a a fuure ime based on he resuls derived in his paper. The res of he paper is organized as follows. Secion II carries ou an analysis for he case of a single modeswiching, and Secion III discusses an exension of he analysis o a swiched sysem wih muliple swichings. The analysis of he wo cases are idenical bu he muliswiching case involves more complicaed noaion. Therefore we presen a deailed analysis only for he case of a single swiching. Secion IV presens a numerical example of a double-ank sysem whose inpu flow rae o he firs ank is conrolled by a valve wih discree modes. The problem a hand is o conrol he swiching ime of he sysem so ha he average fluid level for he second ank racks a reference

2 value which is coninuously varying in real-ime. Finally, Secion V concludes he paper and discuss direcions for fuure research. II. THE SINGLE-SWITCH CASE Consider he sysem defined via Equaion 1 for he case where N = 1, namely here is a single swiching ime. We can simplify he noaion by deleing he subscrip from τ 1, and denoe he swiching ime by τ. In his case, according o 1, ẋ = f 1 x for x τ, and ẋ = f 2 x for > τ. Since we consider dynamic compuaions of he swiching ime, we will denoe i by τ o emphasize is dependence on. Furhermore, we sar by defining τ o be a minimum poin of he cos-o-go defined laer, and since his may vary coninuously wih, we firs describe τ} as a coninuous process; our algorihm will be based on i and of course will perform is compuaion a a discree se of imes. In ligh of his, a simple ranslaion of Equaion 1 wih N = 1 ha emphasizes he dependence of he swiching ime on may no be well defined, and we have o carefully define he sae rajecory x and he swiching ime τ simulaneously. To his end, i is convenien o firs define he sae rajecory of he dynamics associaed wih he cos o go. Given x R n, τ [0, T], and [0, T], define xs,, x, τ, s, o be he sae rajecory forward from, as a funcion of s, wih he iniial condiion of x a he ime s = ; ha is, xs,, x, τ is defined via he equaion x s = f1 x, if s τ f 2 x, if s > τ, wih he iniial condiion x,, x, τ = x. x should be hough of as he prediced or simulaed sae rajecory saring a ime s = and evolves unil s = T. Given [0, T], le Lx, s, be a projeced cos funcion of x R n and fuure imes s. I has he following meaning: A ime he sysem has learned abou he cos funcion of he sae variable x and he fuure imes s, and his funcion is Lx, s,. For example, if i is desired o rack a moving arge whose posiion and velociy are known a ime, Lx, s, may indicae he square-disance of he sae x from he goal s projeced posiion a fuure imes s based on is posiion and velociy a ime. Generally, he funcion Lx, s, forms he basis for he cos o go, and we assume ha i is coninuous, coninuously differeniable in x for every [0, T] and s [, T], and piecewise coninuously differeniable in and s for every x R n. Lasly, we assume ha x, s, o be differeniable in he reason for his assumpion o be needed should be clear laer in his secion. For every τ [0, T], [0, T], and x R n, we define he cos-o-go performance funcional, J, x, τ, by J, x, τ = L xs,, x, τ, s, ds. 3 We define τ as a local minimum poin of he cos o go from ime and he iniial sae x a ha ime, where x is he rue rajecory of he sysem. As menioned earlier, we have o formally define he processes τ} and x} simulaneously, and his is done in he following way: x saisfies he differenial equaion dx d = f1 x, if τ f 2 x, if > τ wih a given boundary condiion x0 = x 0 ; and as for τ, as long as < τ hen τ is defined as a funcion ha saisfies, x, τ = 0, 4 wih a given boundary condiion τ0 = τ 0 [0, T] such ha 0, x0, τ0 = 0. If τ, we define τ = 0. We poin ou ha Equaion 4 is based on he sandard necessary opimaliy condiion in nonlinear programming. The condiion τ = 0 when τ reflecs he fac ha once he swiching ime has occurred i become a par of he pas and canno be modified, in oher words, once τ, τξ has a consan value ξ. Throughou his paper, we assume ha he processes x} and τ} are well defined in he above manner and τ is coninuous in. Proving such a hypohesis from verifyable assumpions is beyond he scope of he general seing of his paper, bu would be done for specific classes of problems in forhcoming publicaions. Consider a ime-poin such ha < τ. Since, x, τ = 0, aking he oal derivaive wih respec o, i follows ha d, x, τ = 0 d as well. This oal derivaive has he following form, 2 J 2 J ẋ, x, τ, x, τ 2 J, x, τ τ = 0, 2 and hence, 2 J 2 J 1 τ =, x, τ 2 ẋ, x, τ. 5, x, τ 2 J By he assumpion ha he process τ} is well defined and coninuous, he second derivaive 2 J, x, τ is 2 posiive. We nex simplify he Righ-hand-side RHS of Equaion 5. Define he funcion φ ξ, ξ, by φ ξ = ξ, xξ, τ. Then dφ dξ ξ = 2 J 2 J ẋξ, ξ, xξ, τ ξ, xξ, τ 6 and a ξ =, dφ dξ = 2 J, x, τ 2 J, x, τ ẋ. 7

3 Plug his in 5 o obain, 2 J 1 dφ τ =, x, τ 2. 8 dξ Le us nex derive an expression for dφ dξ. Given [0, T] and x R n, denoe by Φ,x s, s 0 he sae ransiion marix associaed wih he marix-valued T funcion of s f2 xs,, x, τ. Consequenly s Φ,xs, s 0 = f 2 TΦ,x xs,, x, τ s, s 0, 9 wih Φ,x s 0, s 0 = I he ideniy marix in R n. Given [0, T and > 0 such ha T. Lemma 1: For all s and for all s 0, Φ, x,,x,τ s, s 0 = Φ,x s, s Proof: Fix [0, T and > 0 such ha T. s [, T] and s 0 [, T], equaion 9 is in force. Moreover, he same equaion holds wih and x,, x, τ in lieu of and x, respecively, meaning ha d ds Φ, x,,x,τs, s 0 = f2 xs, T, x,, x, τ, τ Φ, x,,x,τ s, s Now s, x s,, x, τ = s f1 x, if s τ f 2 x, if s > τ wih he boundary condiion x,, x, τ = x, and x f1 x, if s τ s,, x,, x, τ, τ = s f 2 x, if s τ wih he boundary condiion x,, x,, x, τ, τ = x,, x, τ. We see ha xs,, x, τ and xs,, x,, x, τ, τ saisfy he same differenial equaion in s s, and hese wo funcions have he same value a s = ; consequenly xs,, x, τ = xs,, x,, x, τ, τ 12 for all s [, T]. Therefore, by 9 and 11, Φ, x,,x,τ s, s 0 and Φ,x s, s 0 saisfy he same differenial equaion in s, wih he same value a s = s 0 i.e., I, and his implies 10. We now can characerize he righmos erm in he RHS of 8, and hence obain a compuable expression for τ. Proposiion 1: Suppose ha < τ. Then he derivaive erm dφ dξ τ Proof: Fix [0, T and x R n, and consider Jx,, τ as a funcion of τ >. Define he cosae ps R n, s [τ, T], via he following differenial equaion, ṗs = f2 xs, T, x, τ ps xs, T, x, τ, s, wih he boundary condiion pt = 0. By Equaion 9, ps = ξ a ξ = has he following form, Now suppose ha < τ. Then ξ [, ], dx dξ = f 1 xξ and x ξ ξ,, x, τ = f1 xξ,, x, τ dφ dξ = wih x,, x, τ = x, and hence, ξ [, ], 2 L xs,, x, τ, s, Φ,x τ, s T xξ,, x, τ = xξ. ds f 1 xτ,, x, τ f2 xτ, In paricular, for ξ =,, x, τ. 13 x,, x, τ = x. 20 s Φ,x s, ξ Tdξ, xξ,, x, τ, ξ, 14 and a s = τ, and replacing ξ by s in 14, we obain, pτ = Nex, by Reference [6], τ Φ,x τ, s Tds. xs,, x, τ, s, 15, x, τ = pτt f 1 xτ,, x, τ f2 xτ,, x, τ, 16 and hence, and by 15,, x, τ = xs, Tds, x, τ, s, Φ,x τ, s f 1 xτ,, x, τ f2 xτ,, x, τ. 17 τ Use 17 wih wo specific values:, x, τ, and, x, τ, o obain he following wo equaions, τ and, x, τ = Tds xs,, x, τ, s, Φ,x τ, s f 1 xτ,, x, τ f2 xτ,, x, τ, 18 τ, x, τ = xs,, x, τ, s, Tds Φ,x τ, s f 1 xτ,, x, τ f 2 xτ,, x, τ. 19

4 By Lemma 1 and Equaion 20, s and s 0, Φ,x s, s 0 = Φ,x s, s 0. Therefore, and by 19, τ, x, τ = xx,, x, τ, s, Tds Φ,x τ, s f 1 xτ,, x, τ f 2 xτ,, x, τ. 21 Moreover, s [, τ], s xs,, x, τ = f 1 xs,, x, τ and s xs,, x, τ = f 1 xs,, x, τ ; while he iniial condiions of he respecive erms in hese wo differeniable equaions are x,, x, τ = x by definiion, and x,, x, τ = x by Equaion 20. Consequenly, s [, τ], xs,, x, τ = xs,, x, τ. Using his in 21 we obain,, x, τ = xs,, x, τ, s, τ Tds Φ,x τ, s f 1 xτ,, x, τ f2 xτ,, x, τ. 22 By 22 and 18,, x, τ, x, τ = [ xs,, x, τ, s, τ xs, T ], x, τs, Φ,x τ, s ds f 1 xτ,, x, τ f2 xτ,, x, τ. 23 Dividing boh erms of Equaion 23 by, aking he limi 0, and recalling he definiion of φ ξ, Equaion 13 follows Finally, we obain an expression for τ. Proposiion 2: For every [0, T such ha < τ, we have ha 2 J 1 τ =, x, τ 2 T 2 L xs, Tds, x, τ, s, Φ,x τ, s τ f 1 xτ,, x, τ f2 xτ,, x, τ. 24 Proof: Follows direcly from Equaion 8 and Proposiion 1. We remark ha Equaion 24 is a differenial equaion in τ, and he algorihm ha we use amouns o is numerical soluion by he forward Euler mehod; his will be illusraed in Secion IV for an example of a nonlinear sysem. III. THE CASE OF MULTIPLE SWITCHING TIMES Consider he case where here are N swiching imes, τ i, i = 1,...,T, denoed collecively by he vecor τ := τ 1,...,τ N T R N. We assume ha 0 τ 1... τ N T, and we define τ 0 := 0 and τ N1 := T. For a fixed vecor τ, he sae equaion is given via 1, bu in he even ha τ is a funcion of ime and hence denoed by τ, we define i ogeher wih he sae rajecory as i was done for he single-swiching case. Given a swiching vecor τ, x R n, [0, T], and s [, T], define he projeced sae rajecory xs,, x, τ by he following differenial equaion, x s = f i x s [τ i 1, τ i ] [, T], i = 1,...,N 1, wih he iniial condiion x,, x, τ = x. Nex, given [0, T] and x R n, le Lx, s, be a cos funcion defined for s, and define he cos-o-go performance funcional, J, x, τ, by J, x, τ = L xs,, x, τ, s, ds. 25 Finally, Define x and τ = τ 1,..., τ N T simulaneously in he following way: x saisfies he differenial equaion dx d = f i x, [τ i 1, τ i, i = 1, 2,.., N 1, 26 wih a given boundary condiion x0 = x 0 ; and as for τ, if < τ i hen i, x, τ = 0 27 wih a given iniial condiion τ i 0 = τ 0, and if τ i hen τ i = 0. Furhermore, we assume ha x and τ are coninuous funcions of. This definiion reflecs he fac ha swiching imes ha occurred prior o ime remain fixed and canno be changed in he fuure. As a maer of fac, he number of fuure swiching imes may decline as ime advances, and herefore he dimension of he opimizaion problem, namely he number of fuure swiching imes, may go down. In he forhcoming discussion we assume ha < τ 1 and we consider variaions in N fuure swiching imes. The main resul of his secion concerns an expression for τ ha is similar o Equaion 24 for he single-swiching case. Is proof is almos idenical o ha of Proposiion 2, and hence i is no presened here. Given [0, T] such ha < τ 1, and given x R n and i = 1,...,N, denoe by Φ i,,x s, s 0 he sae

5 ransiion marix associaed wih he marix-valued funcion T of s fi xs,, x, τ. Furhermore, define he vecor p i R n in a backwards-recursive manner as follows: For i = N 1,...,1, q i T = Φ i,,x τ i, τ i1 q i1 T τi1 τ i Φ i,,x τ i1, s 2 L xs, T, x, τ, s, ds, 28 wih he boundary condiion x 1 x 2 τ N q N = Φ i,,x τ N1, s 2 L xs, T, x, τ, s, ds. 29 Nex, define p i R by p i = q i1 T T Φ i,,x τ i, τ i1 τi1 Furhermore, le p R N be he vecor whose ih coordinae is p i. We now presen he main resul of his secion. Proposiion 3: If < τ 1, hen τ 2 J =, x, τ 1 p I should be noed ha again he compuaion of he vecor p only requires inegraion forward once. IV. NUMERICAL EXAMPLE Consider he double-ank sysem shown in Figure 1, where i is desired o conrol he fluid level in he second lower ank, so as o have i rack a given reference signal, r, by he inpu valve o he firs upper ank. The reference signal is no known in advance, bu is pas values a any ime are known a ha ime. The valve can be eiher open or closed, corresponding o he respecive modes of inpu flow o he firs ank a he rae of eiher a given u > 0, or 0. We denoe he fluid level of he firs and second anks by x 1 x 2, respecively, and we consider x := x 1, x 2 T o be he sae of he sysem. By Torricelli s Principle, he dynamics of his swiched sysem can be described by he following equaions: or Fig. 1. [ ẋ = f 1 x := [ ẋ = f 2 x := The double ank process α 1 x1 α 1 x1 α 2 x2 α 1 x1 u α 1 x1 α 2 x2 ], 32 ], 33 2 L where f 1 corresponds o he mode mode 1 when he valve xs,, x, τ, s, τ i is closed, and f 2 corresponds o he mode mode 2 when Φ i,,x τ i1, s he valve is open. In his example we assume ha iniially T ds he valve is open Mode 2, and i can undergo a single f i xτi,, x, τ f i1 xτi,, x, τ mode-ransiion by becoming closed. Following he noaion of Secion II, τ denoes he opimal cos-o-go a ime,. 30 which is he opimal fuure swiching ime. Since he objecive is o rack he reference signal r by he fluid level in he second ank, we define he cos funcion L, xs,, x, τ, s by L, xs,, x, τ, s = 1 2 x 2s,, x, τ r 2, and correspondingly, he coso-go funcional is J, x, τ = 1 x 2 s,, x, τ r 2 ds I can be seen ha 2 L = [0, ṙ], and herefore, Equaion 24 has he form 2 J 1 τ =, x, τ [0, ṙ] 2 T Tds Φ,x τ, s f 1 xτ,, x, τ τ f 2 xτ,, x, τ. 35 We poin ou ha he RHS of 35 requires he compuaion or approximaion of he sae ransiion marix Φ,x τ, s for every s [τ, T], and his may require numerical inegraion. In his example we se α 1 = α 2 = 1, u = 2, and T is se o 10. Furhermore, o ensure numerical accuracy, we use a relaively small sep-size = o updae he

6 dj/dτ Gradien as funcion of ime Fig. 2. Plo of he gradien dj, x, τ as a funcion of ime. The dτ verical doed line corresponds o he ime when mode swich occured. Afer he mode swich, he gradien is se o 0. τ Swiching ime evoluion Fig. 3. Plo of he swiching ime evoluion τ as funcion of ime. The diagonal line is he line τ = and mode swich akes place if τ his his line. The swiching ime does no change afer his poin since he mode swich has already occured. swiching ime and he sysem. The reference signal is r = Using he mehod oulined in his paper, he resulan dj gradien dτ, x, τ for he cos-o-go 34 is shown in he Figure 2. The gradien is close o 0 for all ime which is he desired resul ha corroboraes he heoreical developmens. The small deviaions in he begining are due o numerical approximaions. Saring a opimal iniial condiion τ0 = 1.86 corresponds o r0 = 0.7, he evoluion of he opimal swiching ime using 35 is shown in Figure 3. The diagonal line represens τ = and mode swich akes place when τ his his line. A his poin, he sysem swichs from mode 2 o mode 1 and he sysem is no longer conrolled. In his paper we address he problem of adaping he opimal swiching imes of a swiched sysem in an online environmen where he insananeous cos funcion is assumed o be coninuously varying. We proposed an approach o obain he rajecory of he opimal swiching imes wih respec o he on-line cos-o-go funcion. We found ha o mainain his opimal swiching ime evoluion, on-line informaion in he form of rae of change of he insananeous cos is required. Fuure work includes exension of his framework o he problem when he insananeous cos funcion undergoes impulsive changes insead of coninuous updaes. REFERENCES [1] H. Axelsson. Opimal Conrol of Swiched Auonomous Sysems: Theory, Algorihms, and Roboic Applicaions. Ph.D Thesis, School of Elecrical and Compuer Engineering, Georgia Insiue of Technology, May [2] H. Axelsson, Y. Wardi, M. Egersed, and E. Verries. A Gradien Descen Approach o Opimal Mode Scheduling in Hybrid Dynamical Sysems. Journal of Opimizaion Theory and Applicaions, Vol. 136, No. 2, pp , February [3] S. Azuma, M. Egersed, and Y. Wardi. Oupu-Based Opimal Timing Conrol of Swiched Sysems. Proc. Hybrid Sysems: Compuaion and Conrol, Springer-Verlag, pp , Sana Barbara, CA, March [4] M.S. Branicky, V.S. Borkar, and S.K. Mier. A Unified Framework for Hybrid Conrol: Model and Opimal Conrol Theory. IEEE Trans. on Auomaic Conrol, Vol. 43, pp , [5] X.C. Ding, Y. Wardi, and M. Egersed. On-Line Opimizaion of Swiched-Mode Dynamical Sysems. IEEE Transacions on Auomaic Conrol, o appear. [6] M. Egersed, S. Azuma, and Y. Wardi. Opimal Timing Conrol of Swiched Linear Sysems Based on Parial Informaion. Nonlinear Analysis: Theory, Mehods & Applicaions, [7] M. Egersed, Y. Wardi, and H. Axelsson. Transiion-Time Opimizaion for Swiched-Mode Dynamical Sysems. IEEE Trans. on Auomaic Conrol, Vol. AC-51, pp , [8] S. Hedlund and A. Ranzer. Opimal Conrol of Hybrid Sysems. IEEE Conf. on Decision and Conrol, pp , [9] B. Piccoli. Hybrid sysems and opimal conrol. Proc. 37h IEEE Conference on Decision and Conrol, Tampa, Florida, [10] M.S. Shaikh and P. Caines. On Trajecory Opimizaion for Hybrid Sysems: Theory and Algorihms for Fixed Schedules. IEEE Conf. on Decision and Conrol, pp , [11] M.S. Shaikh and P. Caines. On he Opimal Conrol of Hybrid Sysems: Opimizaion of Trajecories, Swiching Times and Locaion Schedules. In 6h Inernaional Workshop on Hybrid Sysems: Compuaion and Conrol, [12] H.J. Sussmann. Se-Valued Differenials and he Hybrid Maximum Principle. IEEE Conf. on Decision and Conrol, pp , [13] X. Xu and P. Ansaklis. Opimal Conrol of Swiched Auonomous Sysems. IEEE Conf. on Decision and Conrol, pp , [14] X. Xu and P.J. Ansaklis. Opimal Conrol of Swiched Sysems via Nonlinear Opimizaion Based on Direc Differeniaions of Value Funcions. In. J. of Conrol, Vol. 75, pp , V. CONCLUSION

Lecture 20: Riccati Equations and Least Squares Feedback Control

Lecture 20: Riccati Equations and Least Squares Feedback Control 34-5 LINEAR SYSTEMS Lecure : Riccai Equaions and Leas Squares Feedback Conrol 5.6.4 Sae Feedback via Riccai Equaions A recursive approach in generaing he marix-valued funcion W ( ) equaion for i for he

More information

10. State Space Methods

10. State Space Methods . Sae Space Mehods. Inroducion Sae space modelling was briefly inroduced in chaper. Here more coverage is provided of sae space mehods before some of heir uses in conrol sysem design are covered in he

More information

3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon

3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon 3..3 INRODUCION O DYNAMIC OPIMIZAION: DISCREE IME PROBLEMS A. he Hamilonian and Firs-Order Condiions in a Finie ime Horizon Define a new funcion, he Hamilonian funcion, H. H he change in he oal value of

More information

STATE-SPACE MODELLING. A mass balance across the tank gives:

STATE-SPACE MODELLING. A mass balance across the tank gives: B. Lennox and N.F. Thornhill, 9, Sae Space Modelling, IChemE Process Managemen and Conrol Subjec Group Newsleer STE-SPACE MODELLING Inroducion: Over he pas decade or so here has been an ever increasing

More information

Math Week 14 April 16-20: sections first order systems of linear differential equations; 7.4 mass-spring systems.

Math Week 14 April 16-20: sections first order systems of linear differential equations; 7.4 mass-spring systems. Mah 2250-004 Week 4 April 6-20 secions 7.-7.3 firs order sysems of linear differenial equaions; 7.4 mass-spring sysems. Mon Apr 6 7.-7.2 Sysems of differenial equaions (7.), and he vecor Calculus we need

More information

MATH 5720: Gradient Methods Hung Phan, UMass Lowell October 4, 2018

MATH 5720: Gradient Methods Hung Phan, UMass Lowell October 4, 2018 MATH 5720: Gradien Mehods Hung Phan, UMass Lowell Ocober 4, 208 Descen Direcion Mehods Consider he problem min { f(x) x R n}. The general descen direcions mehod is x k+ = x k + k d k where x k is he curren

More information

EXERCISES FOR SECTION 1.5

EXERCISES FOR SECTION 1.5 1.5 Exisence and Uniqueness of Soluions 43 20. 1 v c 21. 1 v c 1 2 4 6 8 10 1 2 2 4 6 8 10 Graph of approximae soluion obained using Euler s mehod wih = 0.1. Graph of approximae soluion obained using Euler

More information

di Bernardo, M. (1995). A purely adaptive controller to synchronize and control chaotic systems.

di Bernardo, M. (1995). A purely adaptive controller to synchronize and control chaotic systems. di ernardo, M. (995). A purely adapive conroller o synchronize and conrol chaoic sysems. hps://doi.org/.6/375-96(96)8-x Early version, also known as pre-prin Link o published version (if available):.6/375-96(96)8-x

More information

Notes on Kalman Filtering

Notes on Kalman Filtering Noes on Kalman Filering Brian Borchers and Rick Aser November 7, Inroducion Daa Assimilaion is he problem of merging model predicions wih acual measuremens of a sysem o produce an opimal esimae of he curren

More information

Physics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle

Physics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle Chaper 2 Newonian Mechanics Single Paricle In his Chaper we will review wha Newon s laws of mechanics ell us abou he moion of a single paricle. Newon s laws are only valid in suiable reference frames,

More information

Simulation-Solving Dynamic Models ABE 5646 Week 2, Spring 2010

Simulation-Solving Dynamic Models ABE 5646 Week 2, Spring 2010 Simulaion-Solving Dynamic Models ABE 5646 Week 2, Spring 2010 Week Descripion Reading Maerial 2 Compuer Simulaion of Dynamic Models Finie Difference, coninuous saes, discree ime Simple Mehods Euler Trapezoid

More information

15. Vector Valued Functions

15. Vector Valued Functions 1. Vecor Valued Funcions Up o his poin, we have presened vecors wih consan componens, for example, 1, and,,4. However, we can allow he componens of a vecor o be funcions of a common variable. For example,

More information

Sliding Mode Extremum Seeking Control for Linear Quadratic Dynamic Game

Sliding Mode Extremum Seeking Control for Linear Quadratic Dynamic Game Sliding Mode Exremum Seeking Conrol for Linear Quadraic Dynamic Game Yaodong Pan and Ümi Özgüner ITS Research Group, AIST Tsukuba Eas Namiki --, Tsukuba-shi,Ibaraki-ken 5-856, Japan e-mail: pan.yaodong@ais.go.jp

More information

Hybrid Control and Switched Systems. Lecture #3 What can go wrong? Trajectories of hybrid systems

Hybrid Control and Switched Systems. Lecture #3 What can go wrong? Trajectories of hybrid systems Hybrid Conrol and Swiched Sysems Lecure #3 Wha can go wrong? Trajecories of hybrid sysems João P. Hespanha Universiy of California a Sana Barbara Summary 1. Trajecories of hybrid sysems: Soluion o a hybrid

More information

Predator - Prey Model Trajectories and the nonlinear conservation law

Predator - Prey Model Trajectories and the nonlinear conservation law Predaor - Prey Model Trajecories and he nonlinear conservaion law James K. Peerson Deparmen of Biological Sciences and Deparmen of Mahemaical Sciences Clemson Universiy Ocober 28, 213 Ouline Drawing Trajecories

More information

Finish reading Chapter 2 of Spivak, rereading earlier sections as necessary. handout and fill in some missing details!

Finish reading Chapter 2 of Spivak, rereading earlier sections as necessary. handout and fill in some missing details! MAT 257, Handou 6: Ocober 7-2, 20. I. Assignmen. Finish reading Chaper 2 of Spiva, rereading earlier secions as necessary. handou and fill in some missing deails! II. Higher derivaives. Also, read his

More information

Class Meeting # 10: Introduction to the Wave Equation

Class Meeting # 10: Introduction to the Wave Equation MATH 8.5 COURSE NOTES - CLASS MEETING # 0 8.5 Inroducion o PDEs, Fall 0 Professor: Jared Speck Class Meeing # 0: Inroducion o he Wave Equaion. Wha is he wave equaion? The sandard wave equaion for a funcion

More information

Vehicle Arrival Models : Headway

Vehicle Arrival Models : Headway Chaper 12 Vehicle Arrival Models : Headway 12.1 Inroducion Modelling arrival of vehicle a secion of road is an imporan sep in raffic flow modelling. I has imporan applicaion in raffic flow simulaion where

More information

t is a basis for the solution space to this system, then the matrix having these solutions as columns, t x 1 t, x 2 t,... x n t x 2 t...

t is a basis for the solution space to this system, then the matrix having these solutions as columns, t x 1 t, x 2 t,... x n t x 2 t... Mah 228- Fri Mar 24 5.6 Marix exponenials and linear sysems: The analogy beween firs order sysems of linear differenial equaions (Chaper 5) and scalar linear differenial equaions (Chaper ) is much sronger

More information

Robotics I. April 11, The kinematics of a 3R spatial robot is specified by the Denavit-Hartenberg parameters in Tab. 1.

Robotics I. April 11, The kinematics of a 3R spatial robot is specified by the Denavit-Hartenberg parameters in Tab. 1. Roboics I April 11, 017 Exercise 1 he kinemaics of a 3R spaial robo is specified by he Denavi-Harenberg parameers in ab 1 i α i d i a i θ i 1 π/ L 1 0 1 0 0 L 3 0 0 L 3 3 able 1: able of DH parameers of

More information

Section 3.5 Nonhomogeneous Equations; Method of Undetermined Coefficients

Section 3.5 Nonhomogeneous Equations; Method of Undetermined Coefficients Secion 3.5 Nonhomogeneous Equaions; Mehod of Undeermined Coefficiens Key Terms/Ideas: Linear Differenial operaor Nonlinear operaor Second order homogeneous DE Second order nonhomogeneous DE Soluion o homogeneous

More information

Hamilton- J acobi Equation: Explicit Formulas In this lecture we try to apply the method of characteristics to the Hamilton-Jacobi equation: u t

Hamilton- J acobi Equation: Explicit Formulas In this lecture we try to apply the method of characteristics to the Hamilton-Jacobi equation: u t M ah 5 2 7 Fall 2 0 0 9 L ecure 1 0 O c. 7, 2 0 0 9 Hamilon- J acobi Equaion: Explici Formulas In his lecure we ry o apply he mehod of characerisics o he Hamilon-Jacobi equaion: u + H D u, x = 0 in R n

More information

Chapter 3 Boundary Value Problem

Chapter 3 Boundary Value Problem Chaper 3 Boundary Value Problem A boundary value problem (BVP) is a problem, ypically an ODE or a PDE, which has values assigned on he physical boundary of he domain in which he problem is specified. Le

More information

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION SUPPLEMENTARY INFORMATION DOI: 0.038/NCLIMATE893 Temporal resoluion and DICE * Supplemenal Informaion Alex L. Maren and Sephen C. Newbold Naional Cener for Environmenal Economics, US Environmenal Proecion

More information

Lecture 2-1 Kinematics in One Dimension Displacement, Velocity and Acceleration Everything in the world is moving. Nothing stays still.

Lecture 2-1 Kinematics in One Dimension Displacement, Velocity and Acceleration Everything in the world is moving. Nothing stays still. Lecure - Kinemaics in One Dimension Displacemen, Velociy and Acceleraion Everyhing in he world is moving. Nohing says sill. Moion occurs a all scales of he universe, saring from he moion of elecrons in

More information

Some Basic Information about M-S-D Systems

Some Basic Information about M-S-D Systems Some Basic Informaion abou M-S-D Sysems 1 Inroducion We wan o give some summary of he facs concerning unforced (homogeneous) and forced (non-homogeneous) models for linear oscillaors governed by second-order,

More information

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation Course Noes for EE7C Spring 018: Convex Opimizaion and Approximaion Insrucor: Moriz Hard Email: hard+ee7c@berkeley.edu Graduae Insrucor: Max Simchowiz Email: msimchow+ee7c@berkeley.edu Ocober 15, 018 3

More information

Non-uniform circular motion *

Non-uniform circular motion * OpenSax-CNX module: m14020 1 Non-uniform circular moion * Sunil Kumar Singh This work is produced by OpenSax-CNX and licensed under he Creaive Commons Aribuion License 2.0 Wha do we mean by non-uniform

More information

Solutions from Chapter 9.1 and 9.2

Solutions from Chapter 9.1 and 9.2 Soluions from Chaper 9 and 92 Secion 9 Problem # This basically boils down o an exercise in he chain rule from calculus We are looking for soluions of he form: u( x) = f( k x c) where k x R 3 and k is

More information

Application of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing

Application of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing Applicaion of a Sochasic-Fuzzy Approach o Modeling Opimal Discree Time Dynamical Sysems by Using Large Scale Daa Processing AA WALASZE-BABISZEWSA Deparmen of Compuer Engineering Opole Universiy of Technology

More information

4.5 Constant Acceleration

4.5 Constant Acceleration 4.5 Consan Acceleraion v() v() = v 0 + a a() a a() = a v 0 Area = a (a) (b) Figure 4.8 Consan acceleraion: (a) velociy, (b) acceleraion When he x -componen of he velociy is a linear funcion (Figure 4.8(a)),

More information

4.6 One Dimensional Kinematics and Integration

4.6 One Dimensional Kinematics and Integration 4.6 One Dimensional Kinemaics and Inegraion When he acceleraion a( of an objec is a non-consan funcion of ime, we would like o deermine he ime dependence of he posiion funcion x( and he x -componen of

More information

LAPLACE TRANSFORM AND TRANSFER FUNCTION

LAPLACE TRANSFORM AND TRANSFER FUNCTION CHBE320 LECTURE V LAPLACE TRANSFORM AND TRANSFER FUNCTION Professor Dae Ryook Yang Spring 2018 Dep. of Chemical and Biological Engineering 5-1 Road Map of he Lecure V Laplace Transform and Transfer funcions

More information

Module 2 F c i k c s la l w a s o s f dif di fusi s o i n

Module 2 F c i k c s la l w a s o s f dif di fusi s o i n Module Fick s laws of diffusion Fick s laws of diffusion and hin film soluion Adolf Fick (1855) proposed: d J α d d d J (mole/m s) flu (m /s) diffusion coefficien and (mole/m 3 ) concenraion of ions, aoms

More information

The expectation value of the field operator.

The expectation value of the field operator. The expecaion value of he field operaor. Dan Solomon Universiy of Illinois Chicago, IL dsolom@uic.edu June, 04 Absrac. Much of he mahemaical developmen of quanum field heory has been in suppor of deermining

More information

An introduction to the theory of SDDP algorithm

An introduction to the theory of SDDP algorithm An inroducion o he heory of SDDP algorihm V. Leclère (ENPC) Augus 1, 2014 V. Leclère Inroducion o SDDP Augus 1, 2014 1 / 21 Inroducion Large scale sochasic problem are hard o solve. Two ways of aacking

More information

SZG Macro 2011 Lecture 3: Dynamic Programming. SZG macro 2011 lecture 3 1

SZG Macro 2011 Lecture 3: Dynamic Programming. SZG macro 2011 lecture 3 1 SZG Macro 2011 Lecure 3: Dynamic Programming SZG macro 2011 lecure 3 1 Background Our previous discussion of opimal consumpion over ime and of opimal capial accumulaion sugges sudying he general decision

More information

Online Convex Optimization Example And Follow-The-Leader

Online Convex Optimization Example And Follow-The-Leader CSE599s, Spring 2014, Online Learning Lecure 2-04/03/2014 Online Convex Opimizaion Example And Follow-The-Leader Lecurer: Brendan McMahan Scribe: Sephen Joe Jonany 1 Review of Online Convex Opimizaion

More information

Stability and Bifurcation in a Neural Network Model with Two Delays

Stability and Bifurcation in a Neural Network Model with Two Delays Inernaional Mahemaical Forum, Vol. 6, 11, no. 35, 175-1731 Sabiliy and Bifurcaion in a Neural Nework Model wih Two Delays GuangPing Hu and XiaoLing Li School of Mahemaics and Physics, Nanjing Universiy

More information

Math 2214 Solution Test 1B Fall 2017

Math 2214 Solution Test 1B Fall 2017 Mah 14 Soluion Tes 1B Fall 017 Problem 1: A ank has a capaci for 500 gallons and conains 0 gallons of waer wih lbs of sal iniiall. A soluion conaining of 8 lbsgal of sal is pumped ino he ank a 10 galsmin.

More information

A Primal-Dual Type Algorithm with the O(1/t) Convergence Rate for Large Scale Constrained Convex Programs

A Primal-Dual Type Algorithm with the O(1/t) Convergence Rate for Large Scale Constrained Convex Programs PROC. IEEE CONFERENCE ON DECISION AND CONTROL, 06 A Primal-Dual Type Algorihm wih he O(/) Convergence Rae for Large Scale Consrained Convex Programs Hao Yu and Michael J. Neely Absrac This paper considers

More information

WEEK-3 Recitation PHYS 131. of the projectile s velocity remains constant throughout the motion, since the acceleration a x

WEEK-3 Recitation PHYS 131. of the projectile s velocity remains constant throughout the motion, since the acceleration a x WEEK-3 Reciaion PHYS 131 Ch. 3: FOC 1, 3, 4, 6, 14. Problems 9, 37, 41 & 71 and Ch. 4: FOC 1, 3, 5, 8. Problems 3, 5 & 16. Feb 8, 018 Ch. 3: FOC 1, 3, 4, 6, 14. 1. (a) The horizonal componen of he projecile

More information

T L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB

T L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB Elecronic Companion EC.1. Proofs of Technical Lemmas and Theorems LEMMA 1. Le C(RB) be he oal cos incurred by he RB policy. Then we have, T L E[C(RB)] 3 E[Z RB ]. (EC.1) Proof of Lemma 1. Using he marginal

More information

Projection-Based Optimal Mode Scheduling

Projection-Based Optimal Mode Scheduling Projecion-Based Opimal Mode Scheduling T. M. Caldwell and T. D. Murphey Absrac This paper develops an ieraive opimizaion echnique ha can be applied o mode scheduling. The algorihm provides boh a mode schedule

More information

A Dynamic Model of Economic Fluctuations

A Dynamic Model of Economic Fluctuations CHAPTER 15 A Dynamic Model of Economic Flucuaions Modified for ECON 2204 by Bob Murphy 2016 Worh Publishers, all righs reserved IN THIS CHAPTER, OU WILL LEARN: how o incorporae dynamics ino he AD-AS model

More information

Optimal Path Planning for Flexible Redundant Robot Manipulators

Optimal Path Planning for Flexible Redundant Robot Manipulators 25 WSEAS In. Conf. on DYNAMICAL SYSEMS and CONROL, Venice, Ialy, November 2-4, 25 (pp363-368) Opimal Pah Planning for Flexible Redundan Robo Manipulaors H. HOMAEI, M. KESHMIRI Deparmen of Mechanical Engineering

More information

KINEMATICS IN ONE DIMENSION

KINEMATICS IN ONE DIMENSION KINEMATICS IN ONE DIMENSION PREVIEW Kinemaics is he sudy of how hings move how far (disance and displacemen), how fas (speed and velociy), and how fas ha how fas changes (acceleraion). We say ha an objec

More information

In this chapter the model of free motion under gravity is extended to objects projected at an angle. When you have completed it, you should

In this chapter the model of free motion under gravity is extended to objects projected at an angle. When you have completed it, you should Cambridge Universiy Press 978--36-60033-7 Cambridge Inernaional AS and A Level Mahemaics: Mechanics Coursebook Excerp More Informaion Chaper The moion of projeciles In his chaper he model of free moion

More information

2. Nonlinear Conservation Law Equations

2. Nonlinear Conservation Law Equations . Nonlinear Conservaion Law Equaions One of he clear lessons learned over recen years in sudying nonlinear parial differenial equaions is ha i is generally no wise o ry o aack a general class of nonlinear

More information

BU Macro BU Macro Fall 2008, Lecture 4

BU Macro BU Macro Fall 2008, Lecture 4 Dynamic Programming BU Macro 2008 Lecure 4 1 Ouline 1. Cerainy opimizaion problem used o illusrae: a. Resricions on exogenous variables b. Value funcion c. Policy funcion d. The Bellman equaion and an

More information

Recursive Least-Squares Fixed-Interval Smoother Using Covariance Information based on Innovation Approach in Linear Continuous Stochastic Systems

Recursive Least-Squares Fixed-Interval Smoother Using Covariance Information based on Innovation Approach in Linear Continuous Stochastic Systems 8 Froniers in Signal Processing, Vol. 1, No. 1, July 217 hps://dx.doi.org/1.2266/fsp.217.112 Recursive Leas-Squares Fixed-Inerval Smooher Using Covariance Informaion based on Innovaion Approach in Linear

More information

Variational Iteration Method for Solving System of Fractional Order Ordinary Differential Equations

Variational Iteration Method for Solving System of Fractional Order Ordinary Differential Equations IOSR Journal of Mahemaics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 1, Issue 6 Ver. II (Nov - Dec. 214), PP 48-54 Variaional Ieraion Mehod for Solving Sysem of Fracional Order Ordinary Differenial

More information

d 1 = c 1 b 2 - b 1 c 2 d 2 = c 1 b 3 - b 1 c 3

d 1 = c 1 b 2 - b 1 c 2 d 2 = c 1 b 3 - b 1 c 3 and d = c b - b c c d = c b - b c c This process is coninued unil he nh row has been compleed. The complee array of coefficiens is riangular. Noe ha in developing he array an enire row may be divided or

More information

Georey E. Hinton. University oftoronto. Technical Report CRG-TR February 22, Abstract

Georey E. Hinton. University oftoronto.   Technical Report CRG-TR February 22, Abstract Parameer Esimaion for Linear Dynamical Sysems Zoubin Ghahramani Georey E. Hinon Deparmen of Compuer Science Universiy oftorono 6 King's College Road Torono, Canada M5S A4 Email: zoubin@cs.orono.edu Technical

More information

Inventory Control of Perishable Items in a Two-Echelon Supply Chain

Inventory Control of Perishable Items in a Two-Echelon Supply Chain Journal of Indusrial Engineering, Universiy of ehran, Special Issue,, PP. 69-77 69 Invenory Conrol of Perishable Iems in a wo-echelon Supply Chain Fariborz Jolai *, Elmira Gheisariha and Farnaz Nojavan

More information

Chapter 6. Systems of First Order Linear Differential Equations

Chapter 6. Systems of First Order Linear Differential Equations Chaper 6 Sysems of Firs Order Linear Differenial Equaions We will only discuss firs order sysems However higher order sysems may be made ino firs order sysems by a rick shown below We will have a sligh

More information

EXPLICIT TIME INTEGRATORS FOR NONLINEAR DYNAMICS DERIVED FROM THE MIDPOINT RULE

EXPLICIT TIME INTEGRATORS FOR NONLINEAR DYNAMICS DERIVED FROM THE MIDPOINT RULE Version April 30, 2004.Submied o CTU Repors. EXPLICIT TIME INTEGRATORS FOR NONLINEAR DYNAMICS DERIVED FROM THE MIDPOINT RULE Per Krysl Universiy of California, San Diego La Jolla, California 92093-0085,

More information

Sliding Mode Controller for Unstable Systems

Sliding Mode Controller for Unstable Systems S. SIVARAMAKRISHNAN e al., Sliding Mode Conroller for Unsable Sysems, Chem. Biochem. Eng. Q. 22 (1) 41 47 (28) 41 Sliding Mode Conroller for Unsable Sysems S. Sivaramakrishnan, A. K. Tangirala, and M.

More information

t dt t SCLP Bellman (1953) CLP (Dantzig, Tyndall, Grinold, Perold, Anstreicher 60's-80's) Anderson (1978) SCLP

t dt t SCLP Bellman (1953) CLP (Dantzig, Tyndall, Grinold, Perold, Anstreicher 60's-80's) Anderson (1978) SCLP Coninuous Linear Programming. Separaed Coninuous Linear Programming Bellman (1953) max c () u() d H () u () + Gsusds (,) () a () u (), < < CLP (Danzig, yndall, Grinold, Perold, Ansreicher 6's-8's) Anderson

More information

IMPLICIT AND INVERSE FUNCTION THEOREMS PAUL SCHRIMPF 1 OCTOBER 25, 2013

IMPLICIT AND INVERSE FUNCTION THEOREMS PAUL SCHRIMPF 1 OCTOBER 25, 2013 IMPLICI AND INVERSE FUNCION HEOREMS PAUL SCHRIMPF 1 OCOBER 25, 213 UNIVERSIY OF BRIISH COLUMBIA ECONOMICS 526 We have exensively sudied how o solve sysems of linear equaions. We know how o check wheher

More information

IB Physics Kinematics Worksheet

IB Physics Kinematics Worksheet IB Physics Kinemaics Workshee Wrie full soluions and noes for muliple choice answers. Do no use a calculaor for muliple choice answers. 1. Which of he following is a correc definiion of average acceleraion?

More information

arxiv: v1 [math.ca] 15 Nov 2016

arxiv: v1 [math.ca] 15 Nov 2016 arxiv:6.599v [mah.ca] 5 Nov 26 Counerexamples on Jumarie s hree basic fracional calculus formulae for non-differeniable coninuous funcions Cheng-shi Liu Deparmen of Mahemaics Norheas Peroleum Universiy

More information

) were both constant and we brought them from under the integral.

) were both constant and we brought them from under the integral. YIELD-PER-RECRUIT (coninued The yield-per-recrui model applies o a cohor, bu we saw in he Age Disribuions lecure ha he properies of a cohor do no apply in general o a collecion of cohors, which is wha

More information

Decentralized Stochastic Control with Partial History Sharing: A Common Information Approach

Decentralized Stochastic Control with Partial History Sharing: A Common Information Approach 1 Decenralized Sochasic Conrol wih Parial Hisory Sharing: A Common Informaion Approach Ashuosh Nayyar, Adiya Mahajan and Demoshenis Tenekezis arxiv:1209.1695v1 [cs.sy] 8 Sep 2012 Absrac A general model

More information

6.2 Transforms of Derivatives and Integrals.

6.2 Transforms of Derivatives and Integrals. SEC. 6.2 Transforms of Derivaives and Inegrals. ODEs 2 3 33 39 23. Change of scale. If l( f ()) F(s) and c is any 33 45 APPLICATION OF s-shifting posiive consan, show ha l( f (c)) F(s>c)>c (Hin: In Probs.

More information

Modal identification of structures from roving input data by means of maximum likelihood estimation of the state space model

Modal identification of structures from roving input data by means of maximum likelihood estimation of the state space model Modal idenificaion of srucures from roving inpu daa by means of maximum likelihood esimaion of he sae space model J. Cara, J. Juan, E. Alarcón Absrac The usual way o perform a forced vibraion es is o fix

More information

Modelling traffic flow with constant speed using the Galerkin finite element method

Modelling traffic flow with constant speed using the Galerkin finite element method Modelling raffic flow wih consan speed using he Galerin finie elemen mehod Wesley Ceulemans, Magd A. Wahab, Kur De Prof and Geer Wes Absrac A macroscopic level, raffic can be described as a coninuum flow.

More information

Crossing the Bridge between Similar Games

Crossing the Bridge between Similar Games Crossing he Bridge beween Similar Games Jan-David Quesel, Marin Fränzle, and Werner Damm Universiy of Oldenburg, Deparmen of Compuing Science, Germany CMACS Seminar CMU, Pisburgh, PA, USA 2nd December

More information

Announcements: Warm-up Exercise:

Announcements: Warm-up Exercise: Fri Apr 13 7.1 Sysems of differenial equaions - o model muli-componen sysems via comparmenal analysis hp//en.wikipedia.org/wiki/muli-comparmen_model Announcemens Warm-up Exercise Here's a relaively simple

More information

Two Coupled Oscillators / Normal Modes

Two Coupled Oscillators / Normal Modes Lecure 3 Phys 3750 Two Coupled Oscillaors / Normal Modes Overview and Moivaion: Today we ake a small, bu significan, sep owards wave moion. We will no ye observe waves, bu his sep is imporan in is own

More information

1 Review of Zero-Sum Games

1 Review of Zero-Sum Games COS 5: heoreical Machine Learning Lecurer: Rob Schapire Lecure #23 Scribe: Eugene Brevdo April 30, 2008 Review of Zero-Sum Games Las ime we inroduced a mahemaical model for wo player zero-sum games. Any

More information

From Particles to Rigid Bodies

From Particles to Rigid Bodies Rigid Body Dynamics From Paricles o Rigid Bodies Paricles No roaions Linear velociy v only Rigid bodies Body roaions Linear velociy v Angular velociy ω Rigid Bodies Rigid bodies have boh a posiion and

More information

Designing Information Devices and Systems I Spring 2019 Lecture Notes Note 17

Designing Information Devices and Systems I Spring 2019 Lecture Notes Note 17 EES 16A Designing Informaion Devices and Sysems I Spring 019 Lecure Noes Noe 17 17.1 apaciive ouchscreen In he las noe, we saw ha a capacior consiss of wo pieces on conducive maerial separaed by a nonconducive

More information

23.5. Half-Range Series. Introduction. Prerequisites. Learning Outcomes

23.5. Half-Range Series. Introduction. Prerequisites. Learning Outcomes Half-Range Series 2.5 Inroducion In his Secion we address he following problem: Can we find a Fourier series expansion of a funcion defined over a finie inerval? Of course we recognise ha such a funcion

More information

An Introduction to Malliavin calculus and its applications

An Introduction to Malliavin calculus and its applications An Inroducion o Malliavin calculus and is applicaions Lecure 5: Smoohness of he densiy and Hörmander s heorem David Nualar Deparmen of Mahemaics Kansas Universiy Universiy of Wyoming Summer School 214

More information

23.2. Representing Periodic Functions by Fourier Series. Introduction. Prerequisites. Learning Outcomes

23.2. Representing Periodic Functions by Fourier Series. Introduction. Prerequisites. Learning Outcomes Represening Periodic Funcions by Fourier Series 3. Inroducion In his Secion we show how a periodic funcion can be expressed as a series of sines and cosines. We begin by obaining some sandard inegrals

More information

Rapid Termination Evaluation for Recursive Subdivision of Bezier Curves

Rapid Termination Evaluation for Recursive Subdivision of Bezier Curves Rapid Terminaion Evaluaion for Recursive Subdivision of Bezier Curves Thomas F. Hain School of Compuer and Informaion Sciences, Universiy of Souh Alabama, Mobile, AL, U.S.A. Absrac Bézier curve flaening

More information

Appendix to Online l 1 -Dictionary Learning with Application to Novel Document Detection

Appendix to Online l 1 -Dictionary Learning with Application to Novel Document Detection Appendix o Online l -Dicionary Learning wih Applicaion o Novel Documen Deecion Shiva Prasad Kasiviswanahan Huahua Wang Arindam Banerjee Prem Melville A Background abou ADMM In his secion, we give a brief

More information

Ordinary Differential Equations

Ordinary Differential Equations Ordinary Differenial Equaions 5. Examples of linear differenial equaions and heir applicaions We consider some examples of sysems of linear differenial equaions wih consan coefficiens y = a y +... + a

More information

Guest Lectures for Dr. MacFarlane s EE3350 Part Deux

Guest Lectures for Dr. MacFarlane s EE3350 Part Deux Gues Lecures for Dr. MacFarlane s EE3350 Par Deux Michael Plane Mon., 08-30-2010 Wrie name in corner. Poin ou his is a review, so I will go faser. Remind hem o go lisen o online lecure abou geing an A

More information

u(x) = e x 2 y + 2 ) Integrate and solve for x (1 + x)y + y = cos x Answer: Divide both sides by 1 + x and solve for y. y = x y + cos x

u(x) = e x 2 y + 2 ) Integrate and solve for x (1 + x)y + y = cos x Answer: Divide both sides by 1 + x and solve for y. y = x y + cos x . 1 Mah 211 Homework #3 February 2, 2001 2.4.3. y + (2/x)y = (cos x)/x 2 Answer: Compare y + (2/x) y = (cos x)/x 2 wih y = a(x)x + f(x)and noe ha a(x) = 2/x. Consequenly, an inegraing facor is found wih

More information

System of Linear Differential Equations

System of Linear Differential Equations Sysem of Linear Differenial Equaions In "Ordinary Differenial Equaions" we've learned how o solve a differenial equaion for a variable, such as: y'k5$e K2$x =0 solve DE yx = K 5 2 ek2 x C_C1 2$y''C7$y

More information

Concourse Math Spring 2012 Worked Examples: Matrix Methods for Solving Systems of 1st Order Linear Differential Equations

Concourse Math Spring 2012 Worked Examples: Matrix Methods for Solving Systems of 1st Order Linear Differential Equations Concourse Mah 80 Spring 0 Worked Examples: Marix Mehods for Solving Sysems of s Order Linear Differenial Equaions The Main Idea: Given a sysem of s order linear differenial equaions d x d Ax wih iniial

More information

Robust estimation based on the first- and third-moment restrictions of the power transformation model

Robust estimation based on the first- and third-moment restrictions of the power transformation model h Inernaional Congress on Modelling and Simulaion, Adelaide, Ausralia, 6 December 3 www.mssanz.org.au/modsim3 Robus esimaion based on he firs- and hird-momen resricions of he power ransformaion Nawaa,

More information

6. Stochastic calculus with jump processes

6. Stochastic calculus with jump processes A) Trading sraegies (1/3) Marke wih d asses S = (S 1,, S d ) A rading sraegy can be modelled wih a vecor φ describing he quaniies invesed in each asse a each insan : φ = (φ 1,, φ d ) The value a of a porfolio

More information

Lecture 9: September 25

Lecture 9: September 25 0-725: Opimizaion Fall 202 Lecure 9: Sepember 25 Lecurer: Geoff Gordon/Ryan Tibshirani Scribes: Xuezhi Wang, Subhodeep Moira, Abhimanu Kumar Noe: LaTeX emplae couresy of UC Berkeley EECS dep. Disclaimer:

More information

Math 334 Test 1 KEY Spring 2010 Section: 001. Instructor: Scott Glasgow Dates: May 10 and 11.

Math 334 Test 1 KEY Spring 2010 Section: 001. Instructor: Scott Glasgow Dates: May 10 and 11. 1 Mah 334 Tes 1 KEY Spring 21 Secion: 1 Insrucor: Sco Glasgow Daes: Ma 1 and 11. Do NOT wrie on his problem saemen bookle, excep for our indicaion of following he honor code jus below. No credi will be

More information

(1) (2) Differentiation of (1) and then substitution of (3) leads to. Therefore, we will simply consider the second-order linear system given by (4)

(1) (2) Differentiation of (1) and then substitution of (3) leads to. Therefore, we will simply consider the second-order linear system given by (4) Phase Plane Analysis of Linear Sysems Adaped from Applied Nonlinear Conrol by Sloine and Li The general form of a linear second-order sysem is a c b d From and b bc d a Differeniaion of and hen subsiuion

More information

The fundamental mass balance equation is ( 1 ) where: I = inputs P = production O = outputs L = losses A = accumulation

The fundamental mass balance equation is ( 1 ) where: I = inputs P = production O = outputs L = losses A = accumulation Hea (iffusion) Equaion erivaion of iffusion Equaion The fundamenal mass balance equaion is I P O L A ( 1 ) where: I inpus P producion O oupus L losses A accumulaion Assume ha no chemical is produced or

More information

Linear Surface Gravity Waves 3., Dispersion, Group Velocity, and Energy Propagation

Linear Surface Gravity Waves 3., Dispersion, Group Velocity, and Energy Propagation Chaper 4 Linear Surface Graviy Waves 3., Dispersion, Group Velociy, and Energy Propagaion 4. Descripion In many aspecs of wave evoluion, he concep of group velociy plays a cenral role. Mos people now i

More information

Single and Double Pendulum Models

Single and Double Pendulum Models Single and Double Pendulum Models Mah 596 Projec Summary Spring 2016 Jarod Har 1 Overview Differen ypes of pendulums are used o model many phenomena in various disciplines. In paricular, single and double

More information

EE363 homework 1 solutions

EE363 homework 1 solutions EE363 Prof. S. Boyd EE363 homework 1 soluions 1. LQR for a riple accumulaor. We consider he sysem x +1 = Ax + Bu, y = Cx, wih 1 1 A = 1 1, B =, C = [ 1 ]. 1 1 This sysem has ransfer funcion H(z) = (z 1)

More information

0.1 MAXIMUM LIKELIHOOD ESTIMATION EXPLAINED

0.1 MAXIMUM LIKELIHOOD ESTIMATION EXPLAINED 0.1 MAXIMUM LIKELIHOOD ESTIMATIO EXPLAIED Maximum likelihood esimaion is a bes-fi saisical mehod for he esimaion of he values of he parameers of a sysem, based on a se of observaions of a random variable

More information

Matrix Versions of Some Refinements of the Arithmetic-Geometric Mean Inequality

Matrix Versions of Some Refinements of the Arithmetic-Geometric Mean Inequality Marix Versions of Some Refinemens of he Arihmeic-Geomeric Mean Inequaliy Bao Qi Feng and Andrew Tonge Absrac. We esablish marix versions of refinemens due o Alzer ], Carwrigh and Field 4], and Mercer 5]

More information

Physics 101 Fall 2006: Exam #1- PROBLEM #1

Physics 101 Fall 2006: Exam #1- PROBLEM #1 Physics 101 Fall 2006: Exam #1- PROBLEM #1 1. Problem 1. (+20 ps) (a) (+10 ps) i. +5 ps graph for x of he rain vs. ime. The graph needs o be parabolic and concave upward. ii. +3 ps graph for x of he person

More information

Ordinary Differential Equations

Ordinary Differential Equations Lecure 22 Ordinary Differenial Equaions Course Coordinaor: Dr. Suresh A. Karha, Associae Professor, Deparmen of Civil Engineering, IIT Guwahai. In naure, mos of he phenomena ha can be mahemaically described

More information

Essential Microeconomics : OPTIMAL CONTROL 1. Consider the following class of optimization problems

Essential Microeconomics : OPTIMAL CONTROL 1. Consider the following class of optimization problems Essenial Microeconomics -- 6.5: OPIMAL CONROL Consider he following class of opimizaion problems Max{ U( k, x) + U+ ( k+ ) k+ k F( k, x)}. { x, k+ } = In he language of conrol heory, he vecor k is he vecor

More information

Two Popular Bayesian Estimators: Particle and Kalman Filters. McGill COMP 765 Sept 14 th, 2017

Two Popular Bayesian Estimators: Particle and Kalman Filters. McGill COMP 765 Sept 14 th, 2017 Two Popular Bayesian Esimaors: Paricle and Kalman Filers McGill COMP 765 Sep 14 h, 2017 1 1 1, dx x Bel x u x P x z P Recall: Bayes Filers,,,,,,, 1 1 1 1 u z u x P u z u x z P Bayes z = observaion u =

More information

18 Biological models with discrete time

18 Biological models with discrete time 8 Biological models wih discree ime The mos imporan applicaions, however, may be pedagogical. The elegan body of mahemaical heory peraining o linear sysems (Fourier analysis, orhogonal funcions, and so

More information

Recursive Estimation and Identification of Time-Varying Long- Term Fading Channels

Recursive Estimation and Identification of Time-Varying Long- Term Fading Channels Recursive Esimaion and Idenificaion of ime-varying Long- erm Fading Channels Mohammed M. Olama, Kiran K. Jaladhi, Seddi M. Djouadi, and Charalambos D. Charalambous 2 Universiy of ennessee Deparmen of Elecrical

More information