SOLUTION TO THE USER EQUILIBRIUM DYNAMIC TRAFFIC ROUTING PROBLEM USING FEEDBACK LINEARIZATION

Size: px
Start display at page:

Download "SOLUTION TO THE USER EQUILIBRIUM DYNAMIC TRAFFIC ROUTING PROBLEM USING FEEDBACK LINEARIZATION"

Transcription

1 Pergamon Transpn Res.-B, Vol. 3, No. 5, pp. 343±360, 998 # 998 Elsever Scence Ltd. All rgts reserved Prnted n Great Brtan 09-65/98 $ PII: S09-65(97) SOLUTION TO THE USER EQUILIBRIUM DYNAMIC TRAFFIC ROUTING PROBLEM USING FEEDBACK LINEARIZATION PUSHKIN KACHROO* Bradley Department o Electrcal and Computer Engneerng, Vrgna Polytecnc Insttute and State Unversty, Blacksburg, VA 406-0, U.S.A. and KAAN OÈ ZBAY Department o Cvl and Envronmental Engneerng, Rutgers, Te State Unversty o New Jersey, Pscataway, NJ , U.S.A. AbstractÐIn ts paper, te Dynamc Tra c Routng problem s de ned as te real-tme pont dverson o tra c durng non-recurrent congeston. Ts dynamc tra c routng problem s ten ormulated as a eedback control problem tat determnes te tme-dependent splt parameters at te dverson pont or routng te ncomng tra c ow onto te alternate routes n order to aceve a user-equlbrum tra c pattern. Feedback lnearzaton tecnque s used to solve ts spec c user-equlbrum ormulaton o te Dynamc Tra c Routng problem. Te control nput s te tra c splt actor at te dverson pont. By transormng te dynamcs o te system nto canoncal orm, a control law s obtaned wc cancels te nonlneartes o te system. Smulaton results sow tat te perormance o ts controller on a test network s qute promsng. # 998 Elsever Scence Ltd. All rgts reserved Keywords: control, closed loop, tra c dverson Tra c varables. NOTATION q q, j ;j v r s U x y u e J (.,.) tra c volume enterng lnk tra c volume enterng lnk j o route tra c densty n lnk tra c densty n lnk j o route average tra c speed n lnk ramp tra c ow enterng lnk ramp tra c ow extng lnk tra c splt actor at a node nput ow at a node state vector measurement vector nput vector error vector objectve uncton travel tme uncton *Autor or correspondence. Tel: ; Fax: ; e-mal: puskn@vt.edu 343

2 344 Puskn Kacroo and Kaan OÈ zbay Secton parameters max v k k jp v j tra c jam densty or lnk ree ow tra c speed or lnk travel tme parameter or lnk travel tme parameter or lnk j route ree ow tra c speed or lnk j route Oters t t L y j A B F G tme nal tme or nte orzon optmal control problems Le dervatve o scalar wt respect to vector eld dervatve o te order j o y state varable or nternal dynamcs transton matrx decouplng matrx transton scalar decouplng scalar. INTRODUCTION Real-tme control o tra c dverson durng non-recurrent congeston contnues to be a callengng topc. Wt te advent o ntellgent transportaton systems (ITS), te need or real-tme models and algortms tat wll control te dverson becomes especally evdent. Several researcers tred to solve ts on-lne control problem by adoptng d erent approaces. Among te models tat ave been developed or determnng dverson routes and dvertng te tra c onto tese routes n te context o advanced tra c management systems (ATMS)/advanced traveller normaton systems (ATIS) are expert systems, eedback control, and matematcal programmng models. Expert system-based strateges ave been used or dverson (Gupta et al., 99; Ketseldou, 993). Gartner and Ress (987) developed a multlevel control system ncorporatng local-level and corrdor-level controls. Ts ramework recognzes and empaszes te completon o te eedback loop between te system outputs and te control nputs. Peraps te most popular way o solvng te dynamc tra c assgnment (DTA)/dynamc tra c routng (DTR) problem s troug te use o tradtonal optmzaton-based approaces tat attempt to optmze te objectve unctons or te nomnal model over te `plannng orzon' (Peeta and Mamassan, 995). Papageorgou (990) and Papageorgou and Messmer (99) ave desgned some bang-bang controllers, controllers based on te lnear quadratc regulator (LQR) prncple, and controllers based on te rollng orzon tecnque. Kacroo and OÈ zbay (996) desgned a uzzy eedback control law or pont dverson. Te DTR eedback controller dscussed n ts paper wll be used as part o an overall ncdent management ramework n order to allevate congeston caused by ncdents (Hobeka et al., 993; Kacroo et al., 997b). Real-tme route gudance d ers rom te dverson concept used n te plannng concept n tat t s not a long-term polcy decson concernng route coce, but rater t s a reacton to an mmedate stuaton acng te motorst (Hall, 974). Te statc and quasdynamc tecnques or tra c assgnment (Ress et al., 99) are useul or acevng pre-set system optmal or user-equlbrum condtons but cannot be used or te eedback control problem. For real-tme tra c ow control, were on-lne sensor normaton and actuaton metods are avalable, te optmzaton-based tecnques used n some o te models descrbed n te prevous secton are not very well suted. Most o tese models are not spec cally desgned or on-lne control problems, suc as te DTR problem dscussed n ts paper. Tey do ave several drawbacks due to te act tat tey were orgnally desgned as extensons o tradtonal optmzatontype models or o -lne applcatons. Most o tese models are not desgned to take ull advantage o te on-lne sensor normaton, but tey do assume a perect knowledge o te transportaton system or a spec c tme perod. Te computatonal requrements o tese models are also very

3 Dynamc tra c routng problem 345 g due to te complexty o te models and soluton algortms tey use. Tereore, altoug tey are perect tools or o -lne plannng/evaluaton problems, tey are not well suted or on-lne control problems. On te oter and, tere exst real-tme eedback control approaces tat are spec cally desgned or suc on-lne systems. Te drawback o te exstng lnear eedback control tecnques tat ave prevously been tred s tat te system sould reman n te lnear regon around te equlbrum or te trajectory at all tmes or te controller to be vald. Snce te system s nonlnear, tme varyng, and contans uncertantes, eedback control laws tat andle suc systems sould be used. Te major motvaton o ts paper s to rst provde a realstc DTR model spec cally developed or eedback control and to use te eedback lnearzaton tecnque to develop e cent and robust eedback control laws or ts nonlnear tra c ow model. Note tat te tecnque developed n ts paper s vald or sngle orgn, sngle destnaton problems. For mult-orgn, multdestnaton problems, we can use oter tecnques, suc as nonlnear H control, wc s te topc o researc beng conducted by te autors... Prelmnary consderatons or usng eedback control or tra c dverson Feedback control or DTR can be an e ectve soluton or allevatng tra c congeston durng major ncdents. However, te success o suc a system depends on te e ectve modelng o te system as well as te desgn o te approprate control law. Te desgner o te controller needs to address ssues suc as controllablty and observablty o te tra c system, actuaton and sensng, robustness, and stablty o te closed-loop system sown n Fg..... Actuaton and sensng. Te actuaton o ts system can be aceved n many ways, ncludng varable message sgns (VMS), n-vecle gudance, and gway advsory rado (HAR). State varables suc as tra c densty and average tra c speed can be sensed usng varous types o tra c sensors suc as nductve loops, tra c cameras, and transponders, wc can be used as sensors.... Controllablty and observablty. Te desgner sould analyze te system beore desgnng te controller to determne te system s controllable and observable. Controllablty mples tat a sutable control law can be devsed n order to obtan a desred response rom te system. Observablty mples tat te system state varables can be observed rom te sensed output. For nstance, te system s not controllable, ten we mgt decde to add more actuaton nrastructure, suc as VMS or HAR, and te system s not observable, we mgt add more sensors to te system...3. Robustness and stablty. Te e ectveness o te control desgn can be measured n terms o ts robustness, stablty, and transent caracterstcs. A robust controller wll perorm well even n te presence o uncertantes n te nomnal model o te system. Models representng tra c systems cannot represent te system ully, and tereore tere are uncertantes n te system tat must be dealt wt. A control law sould provde stablty to te system and desrable transent response. For nstance, a good DTR control law would mnmze te tme or te system to cange rom a congested state to a normal ow state. 3. SYSTEM DYNAMICS Many researcers ave studed and desgned optmal open loop controllers utlzng space and tme dscretzed models o tra c ow (Fresz et al., 989; Tan et al., 993). Some researcers ave Fg.. Block dagram or DTR eedback control.

4 346 Puskn Kacroo and Kaan OÈ zbay also desgned eedback control laws usng smlar models (Papageorgou, 983, 990; Papageorgou and Messmer, 99; Messmer and Papageorgou, 995). Te reason or te popularty o tese models s tat tere are many tecnques avalable to deal wt dscretzed systems. Te same s also true or eedback control, and ence, n order to utlze te varous lnear and nonlnear (Kuo, 987; Isdor, 989; Mosca, 995) control tecnques avalable or lumped parameter systems, te dstrbuted parameter model s space dscretzed (Papageorgou, 983). For ts, te gway s subdvded nto several sectons, as sown n Fg.. Te ollowng ordnary d erental equatons (ODE) wt te gven varable relatonsps can be used to model a space dscretzed reeway: d dt ˆ q t q t r t s t Š; ˆ ; ;...n q t ˆ t v t v ˆ v max 3 Here, r t and s t terms ndcate te on-ramp and o -ramp ows, s te densty o te tra c as a uncton o x and tme t, q(t) s te ow at gven x, (t) v s te ree ow speed, and max s te jam densty. Equaton () and te output eqns (4) gve te matematcal model or a gway, wc can be represented n a standard nonlnear state space orm or control desgn purposes. Te standard state space orm s y j ˆ g j ; ;... n ; j ˆ ; ;...; p 4 d x t ˆ x t ; u t Š dt y t ˆg x t ; u t Š 5 x 0 ˆx 0 were, x ˆ ; ;...; n Š T and u t ˆq 0 t : Tere are varous oter proposed models, wc are more detaled n te descrpton o te system dynamcs. Te penomenon o sock waves, wc s very well represented n te PDE representaton o te system, s modeled by expressng te tra c ow between two contguous sectons o te gway as te wegted sum o te tra c ows n tose two sectons wc correspond to te denstes n tose two sectons. A dynamc relatonsp nstead o a statc one lke eqn (3) as also been proposed by Papageorgou (983) and used successully. In te uture, we wll look nto desgnng eedback controllers usng te models wc can represent spllback also. In general, owever, te plosopy bend eedback control desgn s to use a relatvely smple nomnal model or control desgn, and te robustness o te controller sould take care o te uncertantes n te system model. 4. FEEDBACK CONTROL FOR TRAFFIC In te dscretzed tra c ow model, te reeway s dvded nto sectons wt aggregate tra c denstes. Sensors are used to measure varables suc as denstes, tra c ow, and tra c average Fg.. Hgway dvded nto sectons.

5 Dynamc tra c routng problem 347 speeds n tese sectons, wc can be used by te eedback controller to gve approprate commands to actuators lke VMS and HAR. Tere are essentally two ways to desgn controllers or suc nonlnear tra c systems. One way s to desgn te controller by lnearzng te nonlnear dynamcs o te system about ts equlbrum, or a trajectory; te oter way s to desgn drectly or te nonlnear system. Te rst way s easer, snce an mmense amount o lterature s avalable descrbng te varous desgn tecnques, especally or lnear tme nvarant (LTI) systems, but te results are vald only were te lnearzaton s applcable. On te oter and, desgn o controllers drectly or te nonlnear system s muc more d cult; owever, te results are usually global. Some o te lnear control tecnques are LQR, lnear quadratc gaussan (LQG), proportonal ntegral dervatve (PID), H, and prevew control; some o te nonlnear control tecnques nclude descrbng uncton desgn, eedback lnearzaton, sldng mode control, and nonlnear H. Qualtatve metods suc as uzzy control and expert systems can also be utlzed. Qualtatve metods are usually easy to desgn, but are d cult to tune and analyze. Some o tese ssues are dscussed by Papageorgou and Messmer (99). In te next secton, we present a user-equlbrum ormulaton o te DTR problem or te dscretzed tra c ow model gven n Secton. Ten, n te ollowng sectons, tree d erent controllers or tree d erent versons o te same DTR problem ormulaton are developed usng te eedback lnearzaton tecnque. 4.. DTR ormulaton We rst present a DTR ormulaton or te two alternate routes problem wc s ten generalzed or n routes case. Te two routes are dvded nto n and n sectons, respectvely. For smplcty, we are consderng te statc velocty relatonsp, and gnorng te e ect o downstream ow. Hence, te model used s d dt ;j ˆ q ;j t q ;j t Š; ; j ˆ ; ; ; ;...; ; n ; ; ; ; ;...; ; n 6 wt relatonsps () and (3). Te control nput s gven by t U t ˆq ;0 t ; 044; t U t ˆq ;0 t 7 Te ow U t s measured as a uncton o tme, and te splttng rate t s te control nput. Te output measurement could be te ull state vector,.e. vector o ows o all te sectons, or a subset o tat. Te control problem can be stated as: nd 0 t, te optmal t, wc mnmzes J ˆ t " # X m Xm p j dt 8 0 ˆ were :;: s te travel tme uncton and t s te nal tme. Note tat a eedback soluton s needed or te problem, not an open loop optmal control. Hence, we can eter decde te structure o te eedback control, suc as a PID control wt constant gans, and solve numercally or te optmal values o te gans, or we can state te control objectve or a standard eedback control problem, suc as steady state asymptotc stablty gven by Lt t! ˆ m " # X m Xm p j! 0 9 m and some transent beavor caracterstcs suc as a spec ed settlng tme or percent oversoot. Now we ormulate te same DTR ormulaton or a generalzed case, or an n alternate route problem, as ollows: Problem: Fnd 0, ˆ ; ;...; n, wc mnmze

6 348 Puskn Kacroo and Kaan OÈ zbay t ( ) X X j 0 ; ˆ ; ;...n ˆ n k ;k Xn p 4 j;p dt 0 0 k;p k ˆ ; ;...; n, p ˆ ; ;...; n, and te summatons are taken over te total number o combnatons o n and p, and not permutatons, so tat k; p ˆ ; s consdered te same as k; p ˆ ;, and ence only one o tese two wll be n te summaton), or wc guarantee ˆ jˆ Lt t! e! 0 were "( ) ( ) # X n e ˆ ; Xn X n k j; ;...; ;k Xn p j;p ;... ˆ jˆ ˆ jˆ wt some transent beavor caracterstcs lke a spec ed settlng tme or percent oversoot or te system d dt ;j ˆ q ;j t q ;j t Š; ; j ˆ ; ;...; ; n ; ; ;...; ; n ;...; n; ;...; n; n n wt gven ull and partal state observaton, and nput constrants X n ˆ q ;0 t ˆU t and X n ˆ ˆ 3 5. FEEDBACK LINEARIZATION TECHNIQUE Feedback lnearzaton s an approprate tecnque or developng eedback controllers or nonlnear systems smlar to te DTR model descrbed above. Te eedback lnearzaton tecnque s applcable to an nput a ne square multple nput multple output (MIMO), system. Te detals on exact nonlnear decouplng tecnque (eedback lnearzaton) can be ound n Isdor (989), Slotne and L (99), Lgtll and Wtam (955), and Godbole and Sastry (995), and are bre y summarzed ere or te DTR applcaton. Let us consder te ollowng square MIMO system: _x t ˆ x Xp g x u 4 Ts can be wrtten n a compact orm as ˆ y j ˆ j x j ˆ ; ;...; p X _x t ˆ x g x u : y ˆ x 5 were xr n, x : R n! R n, g x : R p! R n, ur p, and yr p. Te vector elds o x and g x are analytc unctons. It s assumed tat or te system, eac output y j as a de ned relatve degree j. Te concept o relatve degree mples tat te output s d erentated wt respect to tme j tmes, ten te control nput appears n te equaton. Ts can be succnctly represented usng Le dervatves. A de nton o a Le dervatve s gven below, ater wc te de nton o relatve degree n terms o Le dervatves s stated. De nton (Le dervatve): Le dervatve o a smoot scalar uncton : R n! R wt respect to a smoot vector eld : R n! R n s gven by Here, L denotes te Le dervatve o order zero. Hger-order Le dervatves are gven by L ˆ L L ).

7 Dynamc tra c routng problem 349 De nton (relatve degree): Te output y j o te system as a relatve degree j, 9 an nteger, s.t. L g L` x 0 8` < j, 844p, 8xU, andl g L j x 6ˆ0. U R n wc s n a gven negborood o te equlbrum pont o te system. Te total relatve degree o te system r s de ned to be te sum o te relatve degrees o all te output varables,.e., r ˆ Pp j. By successvely takng te Le dervatves o eac o te output varables up to ter respectve relatve degrees, we obtan 6 4 y y y p 3 ˆ L L L p 3 3 x L g L x... L gp L x x L gp L x... L gp L x u p x L g L p x... L gp L p x jˆ 6 Ts can be wrtten as y ˆ A x B x u 7 were y ˆ y y... y p T 8 A x ˆ L x L x... L p T p x 9 3 L g L x... L gp L x L gp L x... L gp L x B x ˆ L g L p x... L gp L p x 0 I te decouplng matrx B x s nvertble, ten we can use te eedback control law eqn () to obtan te decoupled dynamcs eqn (). u ˆ B x A x vš y ˆ v were T v ˆ v v... v p Te vector v can be cosen to render te decoupled system eqn (7) stable wt desred transent beavor. Now, te relatve degree o te system r s less tan te order o te system n, ten te closed loop system sould also ave stable nternal dynamcs. In order to study tat, one can de ne state varables x ; ˆ ; ;...; n r, wc are ndependent o te state varables r related to te output o te system, and are also ndependent o eac oter. Te nternal dynamcs o te system can ten be wrtten as: _ ˆ w ; P ; u 3 wt k ˆ ; ;...; n r and ˆ ; ;...; p

8 350 Puskn Kacroo and Kaan OÈ zbay w k ; ˆL k x P k ; ˆL g k x 4 5 Te eedback controller desgned or eqn (7) usng te eedback lnearzaton tecnque sould also guarantee te stablty o te nternal dynamcs descrbed n eqn (3). Note tat or a sngle nput case, we could use te act tat L g k x ˆ0 to coose te ndependent nternal dynamcs state varables, but or te multple nput case, ts condton s not vald, unless te vectors o g are nvolutve. Note tat te control law eqn () as to satsy te constrants eqn (3). In case te constrants are not sats ed, te control varables take extreme values, and te desred perormance o te egenvalues s not aceved. Te moment te tra c condton canges, suc tat te control varables belong to te easble set, te perormance o te system comes back to te desred state. As an example, to aceve a ast response tme our controller mgt try to overcompensate, but n realty te constrants wll produce a slower rate tan desred by te desgn; neverteless, te system wll move towards equal travel tmes. 6. SAMPLE PROBLEM (TWO ALTERNATE ROUTES WITH ONE SECTION) In order to llustrate te deas dscussed above, we ave desgned a eedback control law or te two alternate routes problem wt a sngle secton eac. Te control s based on eedback lnearzaton tecnque or nonlnear systems. Te tecnque s based on de nng a d eomorpsm and perormng te transormaton on te state varables n order to convert tem nto te canoncal orm. I te relatve degree o te system s less tan te system order, ten te nternal dynamcs are studed to ensure tat t s stable. Te detals o ts tecnque are gven n Godbole and Sastry (995). In ts problem, te system order s two and te relatve degree s one. Te space dscretzed ow equatons used or te two alternate routes are: _ ˆ v U 6 m _ ˆ v U U m We ave consdered a smple rst order travel tme uncton, wc s obtaned by dvdng te lengt o a secton by te average velocty o te vecles on t. Accordng to tat, te travel tme can be calculated as k ˆd = v 8 m k ˆd = v m were d and d are secton lengts, v and v are te ree ow speeds o eac secton, and m and m are te maxmum ( jam) denstes o eac secton. Snce we need to equate te travel tmes accordng to te UE DTR ormulaton dscussed n te prevous secton, we take te new transormed state varable y as te d erence n travel tmes. D erentatng te equaton representng y n terms o te state varables ntroduces te nput splt actor nto te dynamc equaton. Tereore, tat transormed equaton can be used to desgn te nput tat cancels te nonlneartes o te system and ntroduces a desgn nput, wc can be used to place te poles o te error equaton or asymptotc stablty. Tese steps are sown below. Te varable y s equal to te d erence n te travel tme on te two sectons. 7 9 y ˆ k k k 3 k 4 30

9 Dynamc tra c routng problem 35 were k ˆ d m v ; k ˆ m ; k 3 ˆ d m ; k 4 ˆ m v Ts equaton can be d erentated wt respect to tme to gve te travel tme d erence dynamcs. _y ˆ k _ k k 3 _ k 4 By substtutng eqns (6) and (7) n (3), we obtan _y ˆ k v m U k k 3 v m U k Ts equaton can be rewrtten n te ollowng orm: were F ˆ k v k m G ˆ _y ˆ F G k 3 k 4 v U m k k k 3 k 4 U Hence, a eedback lnearzaton control law can be desgned to cancel te nonlneartes and provde te desred error dynamcs. Te eedback control law gven n eqn () s used, ˆ G F 36 wc gves te closed loop dynamcs as y ˆ 37 As was mentoned earler, snce te relatve degree o te system s one, and te system order s two, we need to test te stablty or boundedness o te second transormed state varable gven by ˆ 38 Te state varable s bounded snce te denstes on te sectons cannot exceed te correspondng jam denstes. Ts assumes tat no tra c rom ramps enters a secton wt jam densty, and also tat at te node, te tra c ow nto te sectons s zero jam densty s reaced. Ts s a reasonable assumpton snce measured tra c densty wll never become ger tan te jam densty. 4 m m 39 and ence te overall system s exponentally stable y! 0 we coose ˆ Ky, K > 0, and y asymptotcally goes to zero as y t ˆy 0 e Kt. Ts mples tat wen a splttng value based on (36) s utlzed, te d erence n travel tme o two alternate routes wll go to zero at an exponental rate. Hence, te closed loop tra c system controlled by te proposed eedback lnearzaton law s exponentally stable and as desred transent beavor. Note tat nput saturaton occurs, te rate o convergence cannot be guaranteed.

10 35 Puskn Kacroo and Kaan OÈ zbay 7. SAMPLE PROBLEM (TWO ALTERNATE ROUTES WITH TWO SECTIONS) Now, we extend te above problem to a case wt two sectons and ollow te same steps or desgnng a new controller or ts extended system. Te space dscretzed ow equatons used or te two alternate routes are: _ ˆ v U 40 m _ ˆ v m _ ˆ v m v m U U _ ˆ v v m m We ave consdered a smple rst order travel tme uncton, wc s obtaned by dvdng te lengt o a secton by te average velocty o vecles on t. Accordng to tat, we approxmate travel tme as d t ˆ v m d v m 44 d t ˆ v m d v m 45 were d and d are secton lengts, v and v are te ree ow speeds o eac secton, and m and m are te maxmum (jam) denstes o eac secton. Te system can be wrtten n te standard nonlnear nput a ne orm _x t ˆ x; t g x; t u t y t ˆ x; t 46 were ˆ 6 4 x ˆ Š 0 ; u t ˆ v m v m v m v m v m U v m g ˆ 6 4 U O U O

11 Dynamc tra c routng problem 353 Snce we need to equate te travel tmes on alternate routes accordng to te UE DTR problem ormulaton presented n te prevous secton, we take te new transormed state varable y as te d erence n travel tmes. D erentatng te equaton representng y n terms o te state varables ntroduces te nput splt actor nto te dynamc equaton. Tereore, tat transormed equaton can be used to desgn te nput tat cancels te nonlneartes o te system and ntroduces a desgn nput, wc can be used to place te poles o te error equaton or asymptotc stablty. Tese steps are sown below. Te varable y s equal to te d erence n te travel tme on te two sectons. " # " # d y t ˆ v m d d v m v m d v m 50 Ts equaton can be d erentated wt respect to tme to gve te travel tme d erence dynamcs: _y ˆ k _ k k 3 _ k 4 k 5 _ k 6 k 7 _ k 8 By substtutng eqns (40)±(43) n (5), we obtan _y ˆ k v m U k k 5 v m U U k 6 k 3 v m k 4 k 7 v m v m k 8 v m 5 5 Ts equaton can be rewrtten n te ollowng orm: were F ˆ k v m k k 5 v m U k 6 _y ˆ F G k 3 v m k 4 k 7 v m v m k 8 v m k G ˆ k k 5 k 6 ŠU 55 Hence, a eedback lnearzaton control law smlar to te one gven by eqn () can be desgned to cancel te nonlneartes and provde te desred error dynamcs. Te law used s wc gves te closed loop dynamcs as ˆ G F 56 y ˆ 57

12 354 Puskn Kacroo and Kaan OÈ zbay Te relatve degree o te system s one, and te system order s our, and we need to test te stablty or boundedness o te tree nternal states. Now our task s to obtan te oter tree ndependent state varables. Snce ts s a sngle nput system, to obtan tese state varables, we sould satsy L g k x ˆ 0 as ; ˆ ; ˆ ˆ 58 3 ˆ Te state varable s bounded snce te denstes on te sectons cannot exceed te correspondng jam denstes. We use te same argument as or te prevous example or ts clam. m m and ence te overall system s exponentally stable y! 0 we coose ˆ Ky, K > 0, and y asymptotcally goes to zero as y t ˆy 0 e Kt. Ts mples tat wen a splttng value based on eqn (56) s utlzed, te d erence n travel tme o two alternate routes wll go to zero at an exponental rate. Hence, te closed loop tra c system controlled by te proposed eedback lnearzaton law s exponentally stable and as desred transent beavor. 8. SOLUTION FOR THE ONE-ORIGIN, ONE-DESTINATION CASE WITH MULTIPLE ROUTES WITH MULTIPLE SECTIONS. In ts secton, we gve a generalzed soluton or te n alternate route DTR problem descrbed n Secton 3.. Te space dscretzed ow equatons used or te n alternate routes and n sectons are gven by eqns () and (3). Te number o sectons or eac alternate route I s denoted by n. We are consderng ull state observaton, wc s used or estmatng (sensng) te travel tmes on te varous alternate routes. Te dynamcs can be wrtten as _ j v j j j v j j j 60 j mj mj wen ; j ˆ ; ;...; ; n ; ; ;...; ; n ;...; n; ;...; n; n n _ j U v j j j j mj 6 wen ; j ˆ ; ; ; ;...; n; We ave consdered a smple rst order travel tme uncton, wc s obtaned by dvdng te lengt o a secton by te average velocty o vecles on t. Accordng to tat, we approxmate travel tme or a route as t ˆXn d j 6 jˆ v j j mj Te system can be wrtten n te standard nonlnear nput a ne orm: _x t ˆ x; t g x; t u t y t ˆ x; t 63

13 Dynamc tra c routng problem 355 were x ˆ... n... n... nnn Š 0 ; u t ˆ... n Š 64 Te output vector s denoted by y, and s gven by: were y ˆ y y...y...y n Š y ˆ t t Ts equaton can be d erentated wt respect to tme to gve te travel tme d erence dynamcs. _y ˆ Xn jˆ k j k j _ j j m j Xn jˆ k j k j _ j 67 j mj were k jp denotes a constant p ˆ or tat belongs to secton j o route, smlar to te constant k descrbed or eqn (30). Te system (67) s n te orm o eqn (6) and can be represented n te orm o eqn (7) by determnng te values o A x and B x. Te control law () provdes us wt user equlbrum or te DTR problem. Te nput appears n all te output equatons ater d erentatng tem one tme. Hence, te relatve degree o te system s n. Te order o te system s Pn n. Snce te denstes on te ˆ P sectons are bounded by jam densty values, te ndependent state varables ; ˆ ; ;...; n ˆ n n are also bounded. 9. SIMULATION Several smulaton studes are perormed to demonstrate te utlzaton o te eedback lnearzaton tecnque presented n ts paper. Te test network, wc conssts o two alternate routes, s sown n Fg. 3. Tree d erent smulaton scenaros tat were cosen are: (a) model wtout any parametrc uncertantes and ull user complance, (b) model wt parametrc uncertantes and ull user complance, (c) model wt parametrc uncertantes and partal user complance. Te nput uncton s assumed to be a snusodal uncton wc reaces a pre-de ned peak value and ten settles at a constant value or te rest o te smulaton perod. Ts uncton emulates te peak our demand tat reaces ts maxmum value at a certan tme, and ten settles at a constant value wen te peak perod s over. In ts spec c smulaton study, te peak perod s assumed to be. 9.. Scenaro : model wt ull user complance and wtout any uncertantes In ts scenaro, te controller as perect knowledge o te parameters o te tra c model. In addton, ull complance o te users to te dverson commands s assumed by te controller. Te system dynamcs model also smulates ull complance o te users to te controller s dverson Fg. 3. Sample network.

14 356 Puskn Kacroo and Kaan OÈ zbay Fg. 4. (a) D erences n travel tmes (s) or scenaro ; (b) splt actors or scenaro. Fg. 5. (a) D erences n travel tmes (s) or scenaro ; (b) splt actors or scenaro.

15 Dynamc tra c routng problem 357 Fg. 6. (a) D erences n travel tmes (s) or scenaro 3; (b) splt actors or scenaro 3. commands. In ts case, snce te controller as te complete knowledge o te system dynamcs, t s able to perorm exact cancellaton o te system nonlneartes and attan exponental error convergence. Ts result s sown n Fg. 4(a). Fgure 4(b) sows splt actors. 9.. Scenaro : model wt ull user complance and uncertantes In ts scenaro, te controller does not ave perect knowledge o te parameters o te tra c model. In order to smulate te e ects o uncertantes, 30% errors ave been assumed. However, ull complance o te users to te dverson commands s assumed by te controller and s also smulated by te system model. In ts case, snce te controller does not ave complete knowledge o te system dynamcs, t s not able to perorm exact cancellaton o te system nonlneartes and attan exponental error convergence. However, as can be seen n Fg. 5(a) and (b), te results obtaned by usng ts controller, even wt suc relatvely large parametrc uncertanty, are gly encouragng Scenaro 3: model wt partal user complance and uncertantes In ts scenaro, we assume bot partal user complance (80%), and te exstence o parametrc uncertanty n te model. As can be seen n Fg. 6(a) and (b), te uctuatons o d erences n travel are muc ger tan te prevous scenaros, and t takes te controller a longer tme to attan error convergence. However, even wt partal user complance and arly large parametrc uncertantes, te system stablzes and te d erences n travel tmes asymptotcally converge at a desrable rate Scenaro 4: model wt partal user complance and uncertantes, and a lnear PI controller In ts scenaro, we assume bot partal user complance (80%), and te exstence o parametrc uncertanty n te model, and we use a lnear PI (proportonal, ntegral) controller. As s evdent ere, te perormance o ts controller s neror to te eedback lnearzaton controller [Fg. 7(a) and (b)].

16 358 Puskn Kacroo and Kaan OÈ zbay Fg. 7. (a) D erences n travel tmes (s) or scenaro 4; (b) splt actors or scenaro 4. Fg. 8. (a) D erences n travel tmes (s) or scenaro 5; (b) splt actors or scenaro 5.

17 Dynamc tra c routng problem 359 Fg. 9. Planned deployment ste or dverson Scenaro 5: model wt partal user complance, uncertantes, and dynamc velocty relatonsp In ts scenaro, we assume bot partal user complance (80%), and te exstence o parametrc uncertanty n te model. We also consder a dynamc relatonsp or velocty to represent te sock wave dynamcs n te model. Te results o usng te eedback lnearzaton to uncertantes obtaned by under-modelng o ts knd are also satsactory [Fg. 8(a) and (b)]. In all te scenaros, tere s no congeston created n te two routes. In general, te control algortm cannot prevent congeston tere s a very large n ow o tra c. Consder te stuaton were te n ow tra c s so g tat t produces tra c wc s greater tan te overall capacty o te two routes; ten te splt actor control cannot avod congeston. In tat case, some tra c rom te n ow tsel would ave to be dverted Smulaton envronment Te smulaton envronment we used s SIMNON (Elmqvst, 975), wc s a specal programmng language developed n te Lund Insttute o Tecnology, Sweden, or smulatng dynamc systems descrbed as ordnary d erental equatons, as d erence equatons, or as combnatons o bot. Ts program s avalable n DOS and Wndows envronments. 0. DEPLOYMENT ISSUES We are makng plans or deployng ts strategy at te Su olk area n Vrgna (Fg. 9). Te mornng rus our ow s rom pont A to B, and te evenng rus our n te oter drecton. Altoug ts problem s really a network level problem wt multple nodes and routes, te majorty o te tra c ows only n two alternate routes. Te eedback lnearzaton tecnque can be appled to ts problem or calculatng te desred splt rates, and ten anoter algortm could be desgned to come up wt te means to control te varous ways to aceve tat. For nstance, we would use varable message sgns and gway advsory rado. Wat messages to put on tese systems s part o a separate researc topc, but te results o tose could be combned wt te eedback control desgn to aceve an overall control system. Te eedback control law s desgned wt te nomnal model, and te robustness propertes o te controller are used to andle te uncertantes n te nomnal model. We are currently desgnng controllers or network level problems usng eedback control. Kacroo et al. (997a,998) and Kacroo and OÈ zbay (997) deal wt ormulatons and control solutons or tose problems.. CONCLUSIONS In ts paper, we ave addressed te real-tme tra c control problem or pont dverson. A eedback model s developed or control purposes, and eedback lnearzaton tecnque s used to desgn ts eedback controller. Frst, te smplest case, wt two alternate routes consstng o a sngle secton eac, s studed and a eedback controller usng eedback lnearzaton tecnque s

18 360 Puskn Kacroo and Kaan OÈ zbay developed. Second, te case wt two alternate routes wt two dscrete sectons s analyzed, and a eedback controller usng eedback lnearzaton tecnque s also developed. Fnally, te general case wt multple alternate routes dvded nto multple sectons s analyzed, and a general soluton s proposed. To llustrate te above models, smulaton runs are perormed or tree d erent scenaros or a network topology o two alternate routes. Te eedback controller developed or ts test network perormed arly well or all tree scenaros. An mportant ndng o ts smulaton study was te robustness o te controller even or stuatons were parametrc uncertantes exst and partal user complance s employed. Tereore, we can conclude tat eedback lnearzaton s an e ectve metod or desgnng real-tme tra c control systems. REFERENCES Elmqvst, H. (975) SIMNONÐan nteractve smulaton program or nonlnear systems. Report TFRT-309. Department o Automatc Control, Lund Unversty o Lund, Sweden. Fresz, T. L., Luque, J., Tobn, R. L. and We, B. W. (989) Dynamc network tra c assgnment consdered as a contnuous tme optmal control problem. Operatons Researc 37, 893±90. Gartner, N. H. and Ress, R. A. (987) Congeston control n reeway corrdors: te IMIS System. NATO ASI Seres, F38, Flow Control o Congested Networks. Sprnger±Verlag, Berln. Godbole, D. N. and Sastry, S. S. (995) Approxmate decouplng and asymptotc trackng or MIMO systems. IEEE Transactons on Automatc Control 40, 44±450. Gupta, A., Maslanka, V. and Sprng, G. (99) Development o a prototype KBES n te management o non-recurrent congeston on te Massacusetts Turnpke. Presented at te 7st Annual Meetng o TRB, Wasngton, DC. Hall, W.H. (974) Researc on route dverson parameters. Fnal report prepared or FHWA. Hobeka, A. G., Svanandan, R., Subramanam, S. and OÈ zbay, K. (993) Real-tme tra c dverson model: conceptual approac. ASCE Journal o Transportaton Engneerng 9, 55±534. Isdor, A. (989) Nonlnear Control Systems. Sprnger±Verlag, Berln. Kacroo, P. and OÈ zbay, K. (996) Real tme dynamc tra c routng based on uzzy eedback control metodology. Transportaton Researc Record 556. Kacroo, P. and OÈ zbay, K. (997) Feedback control solutons to network level user-equlbrum real-tme dynamc tra c assgnment problems. Proceedngs o IEEE Souteastcon '97, Blacksburg, VA, ±4 Aprl 997. Kacroo, P., OÈ zbay, K., Kang, S. and Burns, J. A. (n press) System dynamcs and eedback control ormulatons or real tme dynamc tra c routng wt an applcaton example. Intellgent Transportaton Systems-Tra c Sensng and Management. Journal on Matematcal and Computer Modellng (MCM). Kacroo, P., OÈ zbay, K. and Narayanan, A. (997a) Investgatng te use o Kalman lterng approaces or orgn destnaton trp table estmaton. Proceedngs o IEEE Souteastcon '97, Blacksburg, VA, ±4 Aprl, 997. Kacroo, P, OÈ zbay, K. and Zang, Y. (997b) Wde-area ncdent management expert system. FHWA report. Ketseldou, Z. (993) Potental use o knowledge-based expert system or reeway ncdent management. ITS, Unversty o Calorna, Irvne, CA. Kuo, B. C. (987) Automatc Control Systems. Prentce Hall, Englewood Cl s, NJ. Lgtll, M. J. and Wtam, G. B. (955) On knematc waves II: a teory o tra c ow on long crowded roads. Proceedngs o te Royal Socety o London Seres A 9, 37±345. Messmer, A. and Papageorgou, M. (995) Route dverson control n motorway networks va nonlnear optmzaton. IEEE Transactons on Control Systems Tecnology 3. Mosca, E. (995) Optmal Predctve and Adaptve Control. Prentce Hall, Englewood Cl s, NJ. Papageorgou, M. (983) Applcatons o Automatc Control Concepts to Tra c Flow Modelng and Control. Sprnger±Verlag, Berln. Papageorgou, M. (990) Dynamc modelng, assgnment, and route gudance tra c networks. Transportaton Researc-B 4, 47±495. Papageorgou, M. and Messmer, A. (99) Dynamc network tra c assgnment and route gudance va eedback regulaton. Transportaton Researc Board, Wasngton, DC. Peeta, S. and Mamassan, H. (995) Multple user classes real-tme tra c assgnment or on-lne operatons: a rollng orzon soluton ramework. Transportaton Researc-C 3, 83±98. Ress, R. A., Gartner, N. H. and Coen, S. (99) Dynamc control and tra c perormance n a reeway corrdor: a smulaton study. Transportaton Researc-A 5, 67±76. Slotne, J. J. E. and L, W. (99) Appled Nonlnear Control. Prentce Hall, Englewood Cl s, NJ. Tan, B., Boyce, D. E. and LeBlanc, L. J. (993) A new class o nstantaneous dynamcs user-optmal tra c assgnment models. Operatons Researc 4, 9±0.

, rst we solve te PDE's L ad L ad n g g (x) = ; = ; ; ; n () (x) = () Ten, we nd te uncton (x), te lnearzng eedbac and coordnates transormaton are gve

, rst we solve te PDE's L ad L ad n g g (x) = ; = ; ; ; n () (x) = () Ten, we nd te uncton (x), te lnearzng eedbac and coordnates transormaton are gve Freedom n Coordnates Transormaton or Exact Lnearzaton and ts Applcaton to Transent Beavor Improvement Kenj Fujmoto and Tosaru Suge Dvson o Appled Systems Scence, Kyoto Unversty, Uj, Kyoto, Japan suge@robotuassyoto-uacjp

More information

Multivariate Ratio Estimator of the Population Total under Stratified Random Sampling

Multivariate Ratio Estimator of the Population Total under Stratified Random Sampling Open Journal of Statstcs, 0,, 300-304 ttp://dx.do.org/0.436/ojs.0.3036 Publsed Onlne July 0 (ttp://www.scrp.org/journal/ojs) Multvarate Rato Estmator of te Populaton Total under Stratfed Random Samplng

More information

Shuai Dong. Isaac Newton. Gottfried Leibniz

Shuai Dong. Isaac Newton. Gottfried Leibniz Computatonal pyscs Sua Dong Isaac Newton Gottred Lebnz Numercal calculus poston dervatve ntegral v velocty dervatve ntegral a acceleraton Numercal calculus Numercal derentaton Numercal ntegraton Roots

More information

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Transfer 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 information

COMP4630: λ-calculus

COMP4630: λ-calculus COMP4630: λ-calculus 4. Standardsaton Mcael Norrs Mcael.Norrs@ncta.com.au Canberra Researc Lab., NICTA Semester 2, 2015 Last Tme Confluence Te property tat dvergent evaluatons can rejon one anoter Proof

More information

ORDINARY DIFFERENTIAL EQUATIONS EULER S METHOD

ORDINARY DIFFERENTIAL EQUATIONS EULER S METHOD Numercal Analss or Engneers German Jordanan Unverst ORDINARY DIFFERENTIAL EQUATIONS We wll eplore several metods o solvng rst order ordnar derental equatons (ODEs and we wll sow ow tese metods can be appled

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

Solution for singularly perturbed problems via cubic spline in tension

Solution for singularly perturbed problems via cubic spline in tension ISSN 76-769 England UK Journal of Informaton and Computng Scence Vol. No. 06 pp.6-69 Soluton for sngularly perturbed problems va cubc splne n tenson K. Aruna A. S. V. Rav Kant Flud Dynamcs Dvson Scool

More information

Stanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7

Stanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7 Stanford Unversty CS54: Computatonal Complexty Notes 7 Luca Trevsan January 9, 014 Notes for Lecture 7 1 Approxmate Countng wt an N oracle We complete te proof of te followng result: Teorem 1 For every

More information

Note 10. Modeling and Simulation of Dynamic Systems

Note 10. Modeling and Simulation of Dynamic Systems Lecture Notes of ME 475: Introducton to Mechatroncs Note 0 Modelng and Smulaton of Dynamc Systems Department of Mechancal Engneerng, Unversty Of Saskatchewan, 57 Campus Drve, Saskatoon, SK S7N 5A9, Canada

More information

The Finite Element Method: A Short Introduction

The Finite Element Method: A Short Introduction Te Fnte Element Metod: A Sort ntroducton Wat s FEM? Te Fnte Element Metod (FEM) ntroduced by engneers n late 50 s and 60 s s a numercal tecnque for solvng problems wc are descrbed by Ordnary Dfferental

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure 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 information

5 The Laplace Equation in a convex polygon

5 The Laplace Equation in a convex polygon 5 Te Laplace Equaton n a convex polygon Te most mportant ellptc PDEs are te Laplace, te modfed Helmoltz and te Helmoltz equatons. Te Laplace equaton s u xx + u yy =. (5.) Te real and magnary parts of an

More information

An Interactive Approach for Solving Multi-Objective Nonlinear Programming and its Application to Cooperative Continuous Static Games

An Interactive Approach for Solving Multi-Objective Nonlinear Programming and its Application to Cooperative Continuous Static Games J. Appl. Res. Ind. Eng. Vol. 5, No. (08) 96 305 Journal o Appled Researc on Industral Engneerng www.journal-apre.com An Interactve Approac or Solvng Mult-Objectve Nonlnear Programmng and ts Applcaton to

More information

Numerical Simulation of One-Dimensional Wave Equation by Non-Polynomial Quintic Spline

Numerical Simulation of One-Dimensional Wave Equation by Non-Polynomial Quintic Spline IOSR Journal of Matematcs (IOSR-JM) e-issn: 78-578, p-issn: 319-765X. Volume 14, Issue 6 Ver. I (Nov - Dec 018), PP 6-30 www.osrournals.org Numercal Smulaton of One-Dmensonal Wave Equaton by Non-Polynomal

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 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 information

Robust observed-state feedback design. for discrete-time systems rational in the uncertainties

Robust observed-state feedback design. for discrete-time systems rational in the uncertainties Robust observed-state feedback desgn for dscrete-tme systems ratonal n the uncertantes Dmtr Peaucelle Yosho Ebhara & Yohe Hosoe Semnar at Kolloquum Technsche Kybernetk, May 10, 016 Unversty of Stuttgart

More information

TR/95 February Splines G. H. BEHFOROOZ* & N. PAPAMICHAEL

TR/95 February Splines G. H. BEHFOROOZ* & N. PAPAMICHAEL TR/9 February 980 End Condtons for Interpolatory Quntc Splnes by G. H. BEHFOROOZ* & N. PAPAMICHAEL *Present address: Dept of Matematcs Unversty of Tabrz Tabrz Iran. W9609 A B S T R A C T Accurate end condtons

More information

Kernel Methods and SVMs Extension

Kernel 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 information

A New Recursive Method for Solving State Equations Using Taylor Series

A New Recursive Method for Solving State Equations Using Taylor Series I J E E E C Internatonal Journal of Electrcal, Electroncs ISSN No. (Onlne) : 77-66 and Computer Engneerng 1(): -7(01) Specal Edton for Best Papers of Mcael Faraday IET Inda Summt-01, MFIIS-1 A New Recursve

More information

36.1 Why is it important to be able to find roots to systems of equations? Up to this point, we have discussed how to find the solution to

36.1 Why is it important to be able to find roots to systems of equations? Up to this point, we have discussed how to find the solution to ChE Lecture Notes - D. Keer, 5/9/98 Lecture 6,7,8 - Rootndng n systems o equatons (A) Theory (B) Problems (C) MATLAB Applcatons Tet: Supplementary notes rom Instructor 6. Why s t mportant to be able to

More information

Chapter 3 Differentiation and Integration

Chapter 3 Differentiation and Integration MEE07 Computer Modelng Technques n Engneerng Chapter Derentaton and Integraton Reerence: An Introducton to Numercal Computatons, nd edton, S. yakowtz and F. zdarovsky, Mawell/Macmllan, 990. Derentaton

More information

Computing Correlated Equilibria in Multi-Player Games

Computing Correlated Equilibria in Multi-Player Games Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,

More information

One can coose te bass n te 'bg' space V n te form of symmetrzed products of sngle partcle wavefunctons ' p(x) drawn from an ortonormal complete set of

One can coose te bass n te 'bg' space V n te form of symmetrzed products of sngle partcle wavefunctons ' p(x) drawn from an ortonormal complete set of 8.54: Many-body penomena n condensed matter and atomc pyscs Last moded: September 4, 3 Lecture 3. Second Quantzaton, Bosons In ts lecture we dscuss second quantzaton, a formalsm tat s commonly used to

More information

A Fuzzy-Neural Adaptive Iterative Learning Control for Freeway Traffic Flow Systems

A Fuzzy-Neural Adaptive Iterative Learning Control for Freeway Traffic Flow Systems Proceedngs of the Internatonal MultConference of Engneers and Computer Scentsts 016 Vol I, IMECS 016, March 16-18, 016, Hong Kong A Fuzzy-Neural Adaptve Iteratve Learnng Control for Freeway Traffc Flow

More information

Irregular vibrations in multi-mass discrete-continuous systems torsionally deformed

Irregular vibrations in multi-mass discrete-continuous systems torsionally deformed (2) 4 48 Irregular vbratons n mult-mass dscrete-contnuous systems torsonally deformed Abstract In the paper rregular vbratons of dscrete-contnuous systems consstng of an arbtrary number rgd bodes connected

More information

EEE 241: Linear Systems

EEE 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 information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College 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 information

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1

Physics 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 information

Absorbing Markov Chain Models to Determine Optimum Process Target Levels in Production Systems with Rework and Scrapping

Absorbing Markov Chain Models to Determine Optimum Process Target Levels in Production Systems with Rework and Scrapping Archve o SID Journal o Industral Engneerng 6(00) -6 Absorbng Markov Chan Models to Determne Optmum Process Target evels n Producton Systems wth Rework and Scrappng Mohammad Saber Fallah Nezhad a, Seyed

More information

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence

More information

DUE: WEDS FEB 21ST 2018

DUE: 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 information

ECE559VV Project Report

ECE559VV Project Report ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate

More information

Lecture 10 Support Vector Machines II

Lecture 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 information

Local Approximation of Pareto Surface

Local Approximation of Pareto Surface Proceedngs o the World Congress on Engneerng 007 Vol II Local Approxmaton o Pareto Surace S.V. Utyuzhnkov, J. Magnot, and M.D. Guenov Abstract In the desgn process o complex systems, the desgner s solvng

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 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 information

Solving Singularly Perturbed Differential Difference Equations via Fitted Method

Solving Singularly Perturbed Differential Difference Equations via Fitted Method Avalable at ttp://pvamu.edu/aam Appl. Appl. Mat. ISSN: 193-9466 Vol. 8, Issue 1 (June 013), pp. 318-33 Applcatons and Appled Matematcs: An Internatonal Journal (AAM) Solvng Sngularly Perturbed Dfferental

More information

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Econ107 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 information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - 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 information

Linear discriminants. Nuno Vasconcelos ECE Department, UCSD

Linear discriminants. Nuno Vasconcelos ECE Department, UCSD Lnear dscrmnants Nuno Vasconcelos ECE Department UCSD Classfcaton a classfcaton problem as to tpes of varables e.g. X - vector of observatons features n te orld Y - state class of te orld X R 2 fever blood

More information

Neuro-Adaptive Design - I:

Neuro-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 information

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments

More information

Spring Force and Power

Spring Force and Power Lecture 13 Chapter 9 Sprng Force and Power Yeah, energy s better than orces. What s net? Course webste: http://aculty.uml.edu/andry_danylov/teachng/physcsi IN THIS CHAPTER, you wll learn how to solve problems

More information

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc

More information

A SINR Improvement Algorithm for D2D Communication Underlaying Cellular Networks

A SINR Improvement Algorithm for D2D Communication Underlaying Cellular Networks Advanced Scence and Tecnology Letters Vol.3 (CST 06), pp.78-83 ttp://dx.do.org/0.457/astl.06.3.34 A SINR Improvement Algortm for DD Communcaton Underlayng Cellular Networks Ceng uan, Youua Fu,, Jn Wang

More information

Module 9. Lecture 6. Duality in Assignment Problems

Module 9. Lecture 6. Duality in Assignment Problems Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept

More information

Composite Hypotheses testing

Composite Hypotheses testing Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter

More information

Problem Set 4: Sketch of Solutions

Problem Set 4: Sketch of Solutions Problem Set 4: Sketc of Solutons Informaton Economcs (Ec 55) George Georgads Due n class or by e-mal to quel@bu.edu at :30, Monday, December 8 Problem. Screenng A monopolst can produce a good n dfferent

More information

On Pfaff s solution of the Pfaff problem

On Pfaff s solution of the Pfaff problem Zur Pfaff scen Lösung des Pfaff scen Probles Mat. Ann. 7 (880) 53-530. On Pfaff s soluton of te Pfaff proble By A. MAYER n Lepzg Translated by D. H. Delpenc Te way tat Pfaff adopted for te ntegraton of

More information

COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN

COEFFICIENT 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 information

Numerical Heat and Mass Transfer

Numerical 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 information

Physics 5153 Classical Mechanics. Principle of Virtual Work-1

Physics 5153 Classical Mechanics. Principle of Virtual Work-1 P. Guterrez 1 Introducton Physcs 5153 Classcal Mechancs Prncple of Vrtual Work The frst varatonal prncple we encounter n mechancs s the prncple of vrtual work. It establshes the equlbrum condton of a mechancal

More information

OPTIMISATION. Introduction Single Variable Unconstrained Optimisation Multivariable Unconstrained Optimisation Linear Programming

OPTIMISATION. Introduction Single Variable Unconstrained Optimisation Multivariable Unconstrained Optimisation Linear Programming OPTIMIATION Introducton ngle Varable Unconstraned Optmsaton Multvarable Unconstraned Optmsaton Lnear Programmng Chapter Optmsaton /. Introducton In an engneerng analss, sometmes etremtes, ether mnmum or

More information

Interactive Bi-Level Multi-Objective Integer. Non-linear Programming Problem

Interactive Bi-Level Multi-Objective Integer. Non-linear Programming Problem Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan

More information

The optimal delay of the second test is therefore approximately 210 hours earlier than =2.

The optimal delay of the second test is therefore approximately 210 hours earlier than =2. THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple

More information

Observers for non-linear differential-algebraic. system

Observers for non-linear differential-algebraic. system Observers for non-lnear dfferental-algebrac systems Jan Åslund and Erk Frsk Department of Electrcal Engneerng, Lnköpng Unversty 581 83 Lnköpng, Sweden, {jaasl,frsk}@sy.lu.se Abstract In ths paper we consder

More information

An Interactive Optimisation Tool for Allocation Problems

An 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 information

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals

Simultaneous 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 information

Estimating the Fundamental Matrix by Transforming Image Points in Projective Space 1

Estimating the Fundamental Matrix by Transforming Image Points in Projective Space 1 Estmatng the Fundamental Matrx by Transformng Image Ponts n Projectve Space 1 Zhengyou Zhang and Charles Loop Mcrosoft Research, One Mcrosoft Way, Redmond, WA 98052, USA E-mal: fzhang,cloopg@mcrosoft.com

More information

Physics 2A Chapters 6 - Work & Energy Fall 2017

Physics 2A Chapters 6 - Work & Energy Fall 2017 Physcs A Chapters 6 - Work & Energy Fall 017 These notes are eght pages. A quck summary: The work-energy theorem s a combnaton o Chap and Chap 4 equatons. Work s dened as the product o the orce actng on

More information

3.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

3.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 information

CS 331 DESIGN AND ANALYSIS OF ALGORITHMS DYNAMIC PROGRAMMING. Dr. Daisy Tang

CS 331 DESIGN AND ANALYSIS OF ALGORITHMS DYNAMIC PROGRAMMING. Dr. Daisy Tang CS DESIGN ND NLYSIS OF LGORITHMS DYNMIC PROGRMMING Dr. Dasy Tang Dynamc Programmng Idea: Problems can be dvded nto stages Soluton s a sequence o decsons and the decson at the current stage s based on the

More information

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal

More information

Difference Equations

Difference 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 information

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle

More information

Throughput Capacities and Optimal Resource Allocation in Multiaccess Fading Channels

Throughput Capacities and Optimal Resource Allocation in Multiaccess Fading Channels Trougput Capactes and Optmal esource Allocaton n ultaccess Fadng Cannels Hao Zou arc 7, 003 Unversty of Notre Dame Abstract oble wreless envronment would ntroduce specal penomena suc as multpat fadng wc

More information

Energy-Aware Fault Tolerance in Fixed-Priority Real-Time Embedded Systems*

Energy-Aware Fault Tolerance in Fixed-Priority Real-Time Embedded Systems* Energy-Aware Fault Tolerance n Fxed-Prorty Real-Tme Embedded Systems Yng Zang, Krsnendu Cakrabarty and Vsnu Swamnatan Department of Electrcal & Computer Engneerng Duke Unversty, Duram, NC 778, USA Abstract

More information

Chapter - 2. Distribution System Power Flow Analysis

Chapter - 2. Distribution System Power Flow Analysis Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load

More information

Direct Methods for Solving Macromolecular Structures Ed. by S. Fortier Kluwer Academic Publishes, The Netherlands, 1998, pp

Direct Methods for Solving Macromolecular Structures Ed. by S. Fortier Kluwer Academic Publishes, The Netherlands, 1998, pp Drect Metods for Solvng Macromolecular Structures Ed. by S. Forter Kluwer Academc Publses, Te Neterlands, 998, pp. 79-85. SAYRE EQUATION, TANGENT FORMULA AND SAYTAN FAN HAI-FU Insttute of Pyscs, Cnese

More information

Lecture 26 Finite Differences and Boundary Value Problems

Lecture 26 Finite Differences and Boundary Value Problems 4//3 Leture 6 Fnte erenes and Boundar Value Problems Numeral derentaton A nte derene s an appromaton o a dervatve - eample erved rom Talor seres 3 O! Negletng all terms ger tan rst order O O Tat s te orward

More information

Tracking with Kalman Filter

Tracking with Kalman Filter Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,

More information

On a nonlinear compactness lemma in L p (0, T ; B).

On a nonlinear compactness lemma in L p (0, T ; B). On a nonlnear compactness lemma n L p (, T ; B). Emmanuel Matre Laboratore de Matématques et Applcatons Unversté de Haute-Alsace 4, rue des Frères Lumère 6893 Mulouse E.Matre@ua.fr 3t February 22 Abstract

More information

FREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced,

FREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced, FREQUENCY DISTRIBUTIONS Page 1 of 6 I. Introducton 1. The dea of a frequency dstrbuton for sets of observatons wll be ntroduced, together wth some of the mechancs for constructng dstrbutons of data. Then

More information

Numerical Differentiation

Numerical Differentiation Part 5 Capter 19 Numercal Derentaton PowerPonts organzed by Dr. Mcael R. Gustason II, Duke Unversty Revsed by Pro. Jang, CAU All mages copyrgt Te McGraw-Hll Companes, Inc. Permsson requred or reproducton

More information

Lecture Notes on Linear Regression

Lecture 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 information

Derivative-Free Kalman Filtering-Based Control of Prosthetic Legs*

Derivative-Free Kalman Filtering-Based Control of Prosthetic Legs* 7 Amercan Control Conerence Sheraton Seattle Hotel May 4 6, 7, Seattle, USA Dervatve-Free Kalman Flterng-Based Control o Prosthetc Legs* S Mahmoud Moosav, Seyed Abolazl Fakooran, Vahd Azm, Hanz Rchter

More information

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

More information

THE GUARANTEED COST CONTROL FOR UNCERTAIN LARGE SCALE INTERCONNECTED SYSTEMS

THE 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 information

APPENDIX 2 FITTING A STRAIGHT LINE TO OBSERVATIONS

APPENDIX 2 FITTING A STRAIGHT LINE TO OBSERVATIONS Unversty of Oulu Student Laboratory n Physcs Laboratory Exercses n Physcs 1 1 APPEDIX FITTIG A STRAIGHT LIE TO OBSERVATIOS In the physcal measurements we often make a seres of measurements of the dependent

More information

Designing of Combined Continuous Lot By Lot Acceptance Sampling Plan

Designing of Combined Continuous Lot By Lot Acceptance Sampling Plan Internatonal Journal o Scentc Research Engneerng & Technology (IJSRET), ISSN 78 02 709 Desgnng o Combned Contnuous Lot By Lot Acceptance Samplng Plan S. Subhalakshm 1 Dr. S. Muthulakshm 2 1 Research Scholar,

More information

The Karush-Kuhn-Tucker. Nuno Vasconcelos ECE Department, UCSD

The Karush-Kuhn-Tucker. Nuno Vasconcelos ECE Department, UCSD e Karus-Kun-ucker condtons and dualt Nuno Vasconcelos ECE Department, UCSD Optmzaton goal: nd mamum or mnmum o a uncton Denton: gven unctons, g, 1,...,k and, 1,...m dened on some doman Ω R n mn w, w Ω

More information

Integrals and Invariants of Euler-Lagrange Equations

Integrals and Invariants of Euler-Lagrange Equations Lecture 16 Integrals and Invarants of Euler-Lagrange Equatons ME 256 at the Indan Insttute of Scence, Bengaluru Varatonal Methods and Structural Optmzaton G. K. Ananthasuresh Professor, Mechancal Engneerng,

More information

6.3.4 Modified Euler s method of integration

6.3.4 Modified Euler s method of integration 6.3.4 Modfed Euler s method of ntegraton Before dscussng the applcaton of Euler s method for solvng the swng equatons, let us frst revew the basc Euler s method of numercal ntegraton. Let the general from

More information

Multigrid Methods and Applications in CFD

Multigrid Methods and Applications in CFD Multgrd Metods and Applcatons n CFD Mcael Wurst 0 May 009 Contents Introducton Typcal desgn of CFD solvers 3 Basc metods and ter propertes for solvng lnear systems of equatons 4 Geometrc Multgrd 3 5 Algebrac

More information

Finite Difference Method

Finite Difference Method 7/0/07 Instructor r. Ramond Rump (9) 747 698 rcrump@utep.edu EE 337 Computatonal Electromagnetcs (CEM) Lecture #0 Fnte erence Method Lecture 0 These notes ma contan coprghted materal obtaned under ar use

More information

Control of Uncertain Bilinear Systems using Linear Controllers: Stability Region Estimation and Controller Design

Control 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 information

Heuristic Algorithm for Finding Sensitivity Analysis in Interval Solid Transportation Problems

Heuristic Algorithm for Finding Sensitivity Analysis in Interval Solid Transportation Problems Internatonal Journal of Innovatve Research n Advanced Engneerng (IJIRAE) ISSN: 349-63 Volume Issue 6 (July 04) http://rae.com Heurstc Algorm for Fndng Senstvty Analyss n Interval Sold Transportaton Problems

More information

UNIVERSITY OF BOLTON RAK ACADEMIC CENTRE BENG(HONS) MECHANICAL ENGINEERING SEMESTER TWO EXAMINATION 2017/2018 FINITE ELEMENT AND DIFFERENCE SOLUTIONS

UNIVERSITY OF BOLTON RAK ACADEMIC CENTRE BENG(HONS) MECHANICAL ENGINEERING SEMESTER TWO EXAMINATION 2017/2018 FINITE ELEMENT AND DIFFERENCE SOLUTIONS OCD0 UNIVERSITY OF BOLTON RAK ACADEMIC CENTRE BENG(HONS) MECHANICAL ENGINEERING SEMESTER TWO EXAMINATION 07/08 FINITE ELEMENT AND DIFFERENCE SOLUTIONS MODULE NO. AME6006 Date: Wednesda 0 Ma 08 Tme: 0:00

More information

FUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM

FUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL

More information

Lecture 12: Discrete Laplacian

Lecture 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 information

Time-Varying Systems and Computations Lecture 6

Time-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 information

IJESR/Sept 2012/ Volume-2/Issue-9/Article No-1/ ISSN International Journal of Engineering & Science Research

IJESR/Sept 2012/ Volume-2/Issue-9/Article No-1/ ISSN International Journal of Engineering & Science Research IJESR/Sept 202/ Volume-2/Issue-9/Artcle No-/900-908 ISSN 2277-2685 Internatonal Journal of Engneerng & Scence Research ADAPIVE SELF-UNING DECOUPLED CONROL OF EMPERAURE AND RELAIVE HUMIDIY FOR A HVAC SYSEM

More information

Computational Biology Lecture 8: Substitution matrices Saad Mneimneh

Computational Biology Lecture 8: Substitution matrices Saad Mneimneh Computatonal Bology Lecture 8: Substtuton matrces Saad Mnemneh As we have ntroduced last tme, smple scorng schemes lke + or a match, - or a msmatch and -2 or a gap are not justable bologcally, especally

More information

HUET MODEL FOR OSCILLATORY AND STATIC LOADING OF ASPHALT BINDERS AT LOW TEMPERATURE

HUET MODEL FOR OSCILLATORY AND STATIC LOADING OF ASPHALT BINDERS AT LOW TEMPERATURE HUT MODL FOR OSCILLATORY AND STATIC LOADING OF ASPHALT BINDRS AT LOW TMPRATUR K Hoon Moon, Augusto Cannone Falcetto * and Ma Marasteanu Unversty of Mnnesota, Mnneapols, USA. *: correspondng autor. canno5@umn.edu

More information

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

More information

Image classification. Given the bag-of-features representations of images from different classes, how do we learn a model for distinguishing i them?

Image classification. Given the bag-of-features representations of images from different classes, how do we learn a model for distinguishing i them? Image classfcaton Gven te bag-of-features representatons of mages from dfferent classes ow do we learn a model for dstngusng tem? Classfers Learn a decson rule assgnng bag-offeatures representatons of

More information

Design and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm

Design and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:

More information

Iranian Journal of Mathematical Chemistry, Vol. 5, No.2, November 2014, pp

Iranian Journal of Mathematical Chemistry, Vol. 5, No.2, November 2014, pp Iranan Journal of Matematcal Cemstry, Vol. 5, No.2, November 204, pp. 85 90 IJMC Altan dervatves of a grap I. GUTMAN (COMMUNICATED BY ALI REZA ASHRAFI) Faculty of Scence, Unversty of Kragujevac, P. O.

More information

Representation Theorem for Convex Nonparametric Least Squares. Timo Kuosmanen

Representation Theorem for Convex Nonparametric Least Squares. Timo Kuosmanen Representaton Theorem or Convex Nonparametrc Least Squares Tmo Kuosmanen 4th Nordc Econometrc Meetng, Tartu, Estona, 4-6 May 007 Motvaton Inerences oten depend crtcally upon the algebrac orm chosen. It

More information

On an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1

On an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1 On an Extenson of Stochastc Approxmaton EM Algorthm for Incomplete Data Problems Vahd Tadayon Abstract: The Stochastc Approxmaton EM (SAEM algorthm, a varant stochastc approxmaton of EM, s a versatle tool

More information