Constrained Robust Model Predictive Control Based on Polyhedral Invariant Sets by Off-line Optimization
|
|
- Sybil Crawford
- 5 years ago
- Views:
Transcription
1 A pblcaton of 47 CHEMICA ENGINEERING TRANSACTIONS VO 3, 3 Cef Edtors: Saro Percc, Jří J Klemeš Copyrgt 3, AIDIC Servz Srl, ISBN ; ISSN Te Italan Assocaton of Cemcal Engneerng Onlne at: wwwadct/cet Constraned Robst Model Predctve Control Based on Polyedral Invarant Sets by Off-lne Optmzaton Sooratep Keawom*, Pornca Bmroongsr Department of Cemcal Engneerng, Faclty of Engneerng, Clalongkorn Unversty, Payata Rd, Patmwan, Bangkok, 33, Taland sooratepk@claact Ts paper proposes a fast robst model predctve control sng polyedral nvarant sets for ncertan polytopc dscrete-tme systems A seqence of nested polyedral nvarant sets correspondng to a seqence of state feedback gans s constrcted off-lne Ts, most of te comptatonal brdens are moved off-lne At eac samplng tme, wen te measred state les between two adjacent polyedral nvarant sets, a state feedback gan s calclated by solvng a lnear programmng based on lnear nterpolaton between two pre-compted state feedback gans Te controller desgn s llstrated wt an example Te smlaton reslts sowed tat te proposed algortm provdes a better control performance wle on-lne comptaton s stll tractable as compared to prevosly reported algortms Introdcton Model predctve control (MPC) s a control tecnqe tat optmzes ftre beavor of a process by sng a process model Robst model predctve control (RMPC) s a specfc type of MPC wc explctly ncldes model ncertanty n te problem formlaton RMPC as been appled n a wde varety of applcaton areas sc as control of a tablar eat excanger (Bakošová and Oravec, ) and dstllaton colmn (Martn et al, 3) In RMPC, all possble state trajectores are restrcted to le n te nvarant set constrcted, so robst stablty of te system can be garanteed Altog te polyedral nvarant set s well-known to ave some advantages over te ellpsodal nvarant sets sc as better andlng of asymmetrc constrants and enlargement of stablzable regon (Plymers et al, 5), te ellpsodal nvarant set s sally sed n RMPC formlaton de to ts relatvely low on-lne comptatonal complexty Recently, an off-lne RMPC algortm sng polyedral nvarant sets as been developed by Bmroongsr and Keawom (b) Te on-lne comptatonal complexty s redced by constrctng off-lne a seqence of polyedral nvarant sets correspondng to a seqence of pre-compted state feedback gans At eac samplng nstant, te smallest polyedral nvarant set contanng te measred state s determned and te correspondng state feedback gan s mplemented to te process Ts, all of te comptatonal brdens are moved off-lne However, te conservatveness s obtaned becase te control law mplemented at eac tme step s only an approxmaton of te tre optmal control law Moreover, te npt dscontntes cased by a swtcng between state feedback control laws are occrred Terefore, te algortm reqres constrctng a large nmber of polyedral nvarant sets, ence large data storage, n order to mprove te control performance and redce te npt dscontntes In ts paper, we present a fast RMPC sng polyedral nvarant sets tat reqres very small comptaton complexty and data storage A seqence of nested polyedral nvarant sets correspondng to a seqence of state feedback gans s constrcted off-lne At eac samplng nstant, wen te measred state les between two adjacent polyedral nvarant sets, te real-tme control law s calclated by solvng a comptatonally low-demandng lnear programmng tat s based on lnear nterpolaton between two precompted state feedback gans
2 48 T Notaton: For a matrx A, A denotes ts transpose, A denotes ts nverse I denotes te dentty matrx For a vector x, x ( k / denotes te state measred at real tme k, x ( k + / k ) denotes te state at predcton tme k + predcted at real tme k Te symbol denotes te correspondng transpose of te lower block part of symmetrc matrces Problem formlaton Te model consdered ere s te followng lnear tme varyng (TV) system wt polytopc ncertanty x( k + ) A( x( + B( ( y( Cx( () were x ( s te state of te plant, ( s te control npt and y ( s te plant otpt We assme tat [ A (, B( ] Ω, Ω Co{[ A, B ],[ A, B ],,[ A, B ]} () were Ω s te polytope, Co denotes convex ll,, B ] [ j j [ A (, B( ] wtn te polytope s a lnear combnaton of te vertces sc tat A are vertces of te convex ll Any [ A(, B( ] λ j ( [ Aj, B j ], λ j(, λ j ( (3) j j were λ ( [ λ (, λ(,, λ ( ] s te ncertan parameter vector Te am of ts researc s to fnd te state feedback control law ( k + / Kx( k + / (4) tat stablzes () and aceves te followng performance cost nder te nomnal model assmpton x( k / T Θ x( k / ( ( k + / R ( k + / mn J (, J ( k /, (5) were Θ > and R > ( k /,max are symmetrc wegtng matrces, sbject to npt and otpt constrants +,,,3,, n (6) y r( k / yr,max +, r,,3,, ny (7) 3 Te proposed algortm In ts secton, a fast RMPC sng polyedral nvarant sets s presented A seqence of polyedral nvarant sets correspondng to a seqence of state feedback gans s constrcted off-lne At eac samplng nstant, wen te measred state les between two adjacent polyedral nvarant sets, te realtme state feedback gan s calclated by lnear nterpolaton between two pre-compted state feedback gans Te dea of te proposed algortm s based on lnear nterpolaton between two pre-compted state feedback gans to get te real-tme state feedback gan tat s as large as possble Algortm 3 Off-lne step : Coose a seqence of states x {,,,N} te correspondng state feedback gans K YG, and solve te followng problem to obtan
3 49 mn γ Y, G, Qj, st, j,,, x Q j, T G + G Qj, ^ ^ AG + BY Q l, Θ G γi RY γi, j,,,, l,,, (8) (9) () T G + G Qj,, j,,,, l,,, AG j + BY j Ql X, j,,,, X,,,, n Y G G Q T T, max + j, Note tat te followng condton mst be satsfed Q ( A + BK ) Q ( A + BK ) >, j,,,,,,, N, k,,, (3) T j, k k + j, k k + Te optmzaton problem sed to derve te state feedback gans n ts step s based on te onlne RMPC controller proposed by Bmroongsr and Keawom (a) It s te mnmzaton of pper bond of nfnte orzon nomnal cost performance However, te otpt constrants are relaxed n ts step n order to enlarge te stablzable regon and to redce conservatveness Te otpt constrants and also npt constrants are ten properly taken nto accont drng polyedral nvarant set constrcton n off-lne-step Te condton (4) s sed to assre robst stablty satsfacton of a convex combnaton of K and K + / Off-lne Step : Constrct a seqence of polyedral nvarant sets S { x M x d },, N correspondng to a seqence of pre-compted state feedback gans () (),, K,,,, N by followng te procedres of Bmroongsr and Keawom (b) On-lne Step : At eac samplng nstant, f te measred state les between S and S +,,,, N, mplement K λ K + ( λ) K + to te process were λ s calclated by solvng te followng optmzaton problem mn λ (4) λ st mn ( λk + ( λ ) K+ ) xk max (5) M ( A + B ( λ K + ( λ) K )) x d, j,,, (6) j j + k λ (7) If te state les n S N, mplement K N to te process Snce npt and otpt constrants mpose lesser and lesser lmts on state feedback gans as te state converges to te orgn, te norm of pre-compted state feedback gan ncrease from oter to nner polyedral nvarant sets ( K < K +,,,, N ) By mnmzng λ at eac control teraton, te realtme state feedback gan tat s as large as possble s mplemented to te process
4 4 4 An example Consder te applcaton of or approac to te nonlnear two-tank system wc s descrbed by te followng eqaton ρ S ρa g + (8) ρs ρa g ρa g (9) were s te water level n tank, s te water level n tank and s te water flow Te operatng parameters are sown n table Table : Te operatng parameters of nonlnear two-tank system Operatng parameters Vales S,5 cm S,6 cm A 9 cm A 4 cm g 98 cm/s ρ 3 kg/cm et,, eq, eq and eq were sbscrpt eq s sed to denote te correspondng varable at eqlbrm condton, te objectve s to reglate to te orgn by manplatng Te npt and otpt constrants are 5 kg/s, 3 cm, cm 5 By evalatng te Jacoban matrx of (7) and (8) along te vertces of te constrants set, we ave tat all te soltons are also te solton of te followng dfferental nclson S 4 ρ p j A j + () S j ρ were A j, j,, 4 are gven by ρa A ρa ρa A ρa g,mn g,mn g,max g,max ρa ρa g,mn g,mn
5 4 ρa A3 ρa g,mn g,mn ρa g,max ρa A4 ρa g,max g,max ρa g,max () Te dscrete-tme model s obtaned by dscretzaton of (8) and (9) sng Eler frst-order approxmaton wt a samplng perod of s and t s omtted ere for brevty Te tnng parameters are Θ and R Te proposed algortm s compared wt ts onlne conterpart RMPC algortm proposed by Bmroongsr and Keawom (a) and te off-lne RMPC algortm proposed by Bmroongsr and Keawom (b) Fgre sows a seqence of for polyedral nvarant sets S { x / M x d },,,, 4 constrcted off- S wle te norm of state feedback gans lne Te szes of polyedral nvarant sets decrease from S to 4 ncrease from S to S 4 Fgre : A seqence of for polyedral nvarant sets constrcted off-lne Fgre sows profles of te water level n tank (reglated otpt) and te water flow (control npt) obtaned by eac algortm Algortm 3 can steer te state to te orgn faster tat oter algortms Ts s de to te fact tat n te algortm of Bmroongsr and Keawom (b), tere s no nterpolaton between pre-compted state feedback gans Conseqently, te control law mplemented at eac tme step s only an approxmaton of te tre optmal control law
6 4 Fgre : a) Te water level n tank (reglated otpt) and b) te water flow (control npt) Te algortm of Bmroongsr and Keawom (a) ses onlne optmzaton to compte a state feedback gan However, te algortm tlzes an ellpsodal nvarant set tat s more conservatve tan a polyedral nvarant set It s seen tat by nterpolaton between pre-compted state feedback gans as proposed n algortm 3, te control npt varable becomes contnos, and te smoot response s obtaned For eac control teraton, te average on-lne comptatonal tme reqred for algortm 3 s as low as s, becase all of te on-lne optmzaton problems are formlated n te form of lnear programmng Te algortm of Bmroongsr and Keawom (a) ses onlne optmzaton to compte a state feedback gan, and comptatonal tme of 3s s reqred for eac samplng tme 5 Conclsons In ts paper, we ave presented a fast RMPC sng polyedral nvarant sets A seqence of polyedral nvarant sets correspondng to a seqence of pre-compted state feedback gans s constrcted off-lne At eac samplng nstant, te smallest nvarant set contanng te crrently state measred s determned A state feedback gan s calclated by solvng a lnear programmng based on lnear nterpolaton between two pre-compted state feedback gans assocated wt crrent nvarant set determned and te adjacent smaller nvarant set Te smlaton reslts sow tat te proposed algortms can aceve better control performance tan exstng algortms ncldng te off-lne RMPC algortm based on polyedral nvarant sets wtot nterpolaton, and ts onlne conterpart RMPC algortm based on ellpsodal nvarant sets Acknowledgement Ts work was spport by te Hger Edcaton Researc Promoton and Natonal Researc Unversty Project of Taland, Offce of te Hger Edcaton Commsson (EN636A) and Integrated Innovaton Academc Center: IIAC Clalongkorn Unversty Centenary Academc Development Project (CU56- EN8), and Specal Task Force for Actvatng Researc (STAR), Clalongkorn Unversty Centenary Academc Development Project References Bakošová M, Oravec J,, Robst model predctve control of eat excangers, Cem Eng Trans 9, Bmroongsr P, Keawom S, a, Robst constraned MPC based on nomnal performance cost wt applcatons n cemcal processes, Proceda Eng 4, Bmroongsr P, Keawom S, b, An off-lne robst MPC algortm for ncertan polytopc dscretetme systems sng polyedral nvarant sets, J Process Contr, Martn P, Odloak D, Kassab F, 3, Robst model predctve control of a plot plant dstllaton colmn, Control Eng Pract,, 3-4 Plymers B, Rosster JA, Sykens JAK, Moor BD, 5, Te effcent comptaton of polyedral nvarant sets for lnear systems wt polytopc ncertanty, Proc Amercan Control Conf, 84-89
Modeling Local Uncertainty accounting for Uncertainty in the Data
Modelng Local Uncertanty accontng for Uncertanty n the Data Olena Babak and Clayton V Detsch Consder the problem of estmaton at an nsampled locaton sng srrondng samples The standard approach to ths problem
More informationScheduling with Integer Time Budgeting for Low-Power Optimization
Schedlng wth Integer Tme Bdgetng for Low-Power Optmzaton We Jang, Zhr Zhang, Modrag Potkonjak and Jason Cong Compter Scence Department Unversty of Calforna, Los Angeles Spported by NSF, SRC. Otlne Introdcton
More informationAn Improved Isogeometric Analysis Using the Lagrange Multiplier Method
An Improved Isogeometrc Analyss Usng the Lagrange Mltpler Method N. Valzadeh 1, S. Sh. Ghorash 2, S. Mohammad 3, S. Shojaee 1, H. Ghasemzadeh 2 1 Department of Cvl Engneerng, Unversty of Kerman, Kerman,
More informationNumerical Solution of Deformation Equations. in Homotopy Analysis Method
Appled Mathematcal Scences, Vol. 6, 2012, no. 8, 357 367 Nmercal Solton of Deformaton Eqatons n Homotopy Analyss Method J. Izadan and M. MohammadzadeAttar Department of Mathematcs, Faclty of Scences, Mashhad
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationPriority queues and heaps Professors Clark F. Olson and Carol Zander
Prorty queues and eaps Professors Clark F. Olson and Carol Zander Prorty queues A common abstract data type (ADT) n computer scence s te prorty queue. As you mgt expect from te name, eac tem n te prorty
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationA General Algorithm for Computing Distance Transforms in Linear Time
Ths chapter has been pblshed as: A. Mejster, J. B. T. M. Roerdnk and W. H. Hesselnk, A general algorthm for comptng dstance transforms n lnear tme. In: Mathematcal Morphology and ts Applcatons to Image
More informationInvestigations of Topology and Shape of Multi-material Optimum Design of Structures
Advanced Scence and Tecnology Letters Vol.141 (GST 2016), pp.241-245 ttp://dx.do.org/10.14257/astl.2016.141.52 Investgatons of Topology and Sape of Mult-materal Optmum Desgn of Structures Quoc Hoan Doan
More informationΜέθοδος Πολυπλέγματoς (Multigrid)
NATIONAL TECNICAL UNIVERSITY OF ATENS Parallel CFD & Optmzaton Unt Laboratory of Termal Trbomacnes Μέθοδος Πολυπλέγματoς (Mltgrd) Κυριάκος Χ. Γιαννάκογλου, Καθηγητής ΕΜΠ Βαρβάρα Ασούτη, Δρ. Μηχ. Μηχανικός
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationa tree-dmensonal settng. In te presented approac, we construct te ne mes by renng an exstng coarse mes and updatng te nodes of te ne mes accordng to t
Parallel Two-Level Metods for Tree-Dmensonal Transonc Compressble Flow Smulatons on Unstructured Meses R. Atbayev a, X.-C. Ca a, and M. Parascvou b a Department of Computer Scence, Unversty of Colorado,
More informationMachine Learning. K-means Algorithm
Macne Learnng CS 6375 --- Sprng 2015 Gaussan Mture Model GMM pectaton Mamzaton M Acknowledgement: some sldes adopted from Crstoper Bsop Vncent Ng. 1 K-means Algortm Specal case of M Goal: represent a data
More informationFeedback Min-Max Model Predictive Control Based on a Quadratic Cost Function
Proceedngs of the 26 Amercan Control Conference Mnneapols, Mnnesota, USA, June 14-16, 26 WeC5.5 Feedback Mn-Max Model Predctve Control Based on a Quadratc Cost Functon D. Muñoz de la Peña,T.Alamo, A. Bemporad
More informationKFUPM. SE301: Numerical Methods Topic 8 Ordinary Differential Equations (ODEs) Lecture (Term 101) Section 04. Read
SE3: Numercal Metods Topc 8 Ordnar Dfferental Equatons ODEs Lecture 8-36 KFUPM Term Secton 4 Read 5.-5.4 6-7- C ISE3_Topc8L Outlne of Topc 8 Lesson : Introducton to ODEs Lesson : Talor seres metods Lesson
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationDistributed Model Predictive Control Methods For Improving Transient Response Of Automated Irrigation Channels
Dstrbuted Model Predctve Control Methods For Improvng Transent Response Of Automated Irrgaton Channels Al Khodabandehlou, Alreza Farhad and Al Parsa Abstract Ths paper presents dstrbuted model predctve
More informationAn Optimal Algorithm to Find a Minimum 2-neighbourhood Covering Set on Cactus Graphs
Annals of Pre Appled Mathematcs Vol 2 No 1 212 45-59 ISSN: 2279-87X (P) 2279-888(onlne) Pblshed on 18 December 212 wwwresearchmathscorg Annals of An Optmal Algorthm to Fnd a Mnmm 2-neghborhood overng Set
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationThe ray density estimation of a CT system by a supervised learning algorithm
Te ray densty estaton of a CT syste by a suervsed learnng algort Nae : Jongduk Baek Student ID : 5459 Toc y toc s to fnd te ray densty of a new CT syste by usng te learnng algort Background Snce te develoent
More informationPerformance Modeling of Web-based Software Systems with Subspace Identification
Acta Poltechnca Hngarca Vol. 13, No. 7, 2016 Performance Modelng of Web-based Software Sstems wth Sbspace Identfcaton Ágnes Bogárd-Mészöl, András Rövd, Shohe Yokoama Department of Atomaton and Appled Informatcs,
More informationAnalog amplifier card Type VT-VSPA2-1-2X/V0/T1 Type VT-VSPA2-1-2X/V0/T5
Analog amplfer card Type VT-VPA2--2X/V0/T Type VT-VPA2--2X/V0/T5 RE 300-Z/0. Replace: 02. /0 Addtonal nfmaton Infmaton regardng the converson of dfferent amplfer cards to amplfer card type VT-VPA2--2X/V0/T
More informationJ1.8 APPLICATION OF CFD SIMULATIONS FOR SHORT-RANGE ATMOSPHERIC DISPERSION OVER OPEN FIELDS AND WITHIN ARRAYS OF BUILDINGS
AMS th Jont Conference on the Applcatons of Ar Pollton Meteorology wth the A&WMA, Atlanta, GA, Jan - Feb, 6. J.8 APPLICATION OF CFD SIMULATIONS FOR SHORT-RANGE ATMOSPHERIC DISPERSION OVER OPEN FIELDS AND
More informationEfficient Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model. Eiji Oki May 28, 2009 The University of Electro-Communications
Effcent Loa-Balance IP Routng Scheme Base on Shortest Paths n Hose Moel E Ok May 28, 2009 The Unversty of Electro-Communcatons Ok Lab. Semnar, May 28, 2009 1 Outlne Backgroun on IP routng IP routng strategy
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More informationA. General Type- Fzzy Clsterng There are two knds of type- fzzy sets whch are often sed n clsterng algorthms: 1) nterval and ) general. In nterval typ
014 IEEE Internatonal Conference on Fzzy Systems (FUZZ-IEEE) Jly 6-11, 014, Beng, Chna A Hybrd Type- Fzzy Clsterng Technqe for Inpt Data Preprocessng of Classfcaton Algorthms Vahd Nor, Mohammad-. Akbarzadeh-T.
More informationUNIT 2 : INEQUALITIES AND CONVEX SETS
UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces
More information5 The Primal-Dual Method
5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton
More informationClassification / Regression Support Vector Machines
Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM
More informationAn Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method
Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationObstacle Avoidance by Using Modified Hopfield Neural Network
bstacle Avodance by Usng Modfed Hopfeld Neral Network Panrasee Rtthpravat Center of peraton for Feld Robotcs Development (FIB), Kng Mongkt s Unversty of Technology Thonbr. 91 Sksawas road Tongkr Bangkok
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationLECTURE : MANIFOLD LEARNING
LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors
More informationUsing BESO method to optimize the shape and reinforcement of the underground openings
Usng BS method to optmze the shape and renforcement of the ndergrond openngs. Ghabrae, Y.M. Xe & X. Hang School of Cvl, nvronmental and Chemcal ngneerng, MI Unversty, Melborne, Astrala ABSAC: In excavaton
More informationA simple piecewise cubic spline method for approximation of highly nonlinear data
Vol., No., 9 () http://d.do.org/./ns.. Natral Scence A sple pecewse cbc splne ethod for approaton of hghly nonlnear Mehd Zaan Cvl Engneerng Departent, Faclty of Techncal and Engneerng, Yaso Unversty, Yaso,
More informationSENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR
SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR Judth Aronow Rchard Jarvnen Independent Consultant Dept of Math/Stat 559 Frost Wnona State Unversty Beaumont, TX 7776 Wnona, MN 55987 aronowju@hal.lamar.edu
More informationGSA Training Notes Raft and Piled-raft Analysis
GSA Tranng Notes Rat and Pled-rat Analyss 1 Introdcton Rat analyss n GSA provdes a means o lnkng GSA statc analyss and sol settlement analyss, so the sol-strctre nteractons can be consdered n the analyss.
More informationSimultaneous Gate Sizing and Fanout Optimization
Smultaneous Gate Szng and Fanout Optmzaton We Cen *, Ceng-Ta Hse +, Massoud Pedram * * Unversty of Soutern Calforna + VerplexSystems,Inc. Los Angeles, CA 90089 Mlptas, CA 95035 Abstract Ts paper descrbes
More informationCost-efficient deployment of distributed software services
1/30 Cost-effcent deployment of dstrbuted software servces csorba@tem.ntnu.no 2/30 Short ntroducton & contents Cost-effcent deployment of dstrbuted software servces Cost functons Bo-nspred decentralzed
More informationPath Planning for Formation Control of Autonomous
Pat Plannng for Formaton Control of Autonomous Vecles 1 E.K. Xdas, 2 C. Palotta, 3 N.A. Aspragatos and 2 K.Y. Pettersen 1 Department of Product and Systems Desgn engneerng, Unversty of te Aegean, 84100
More informationA Comparative Study of Constraint-Handling Techniques in Evolutionary Constrained Multiobjective Optimization
A omparatve Stdy of onstrant-handlng Technqes n Evoltonary onstraned Mltobectve Optmzaton Ja-Peng L, Yong Wang, Member, IEEE, Shengxang Yang, Senor Member, IEEE, and Zxng a, Senor Member, IEEE Abstract
More informationThe AVL Balance Condition. CSE 326: Data Structures. AVL Trees. The AVL Tree Data Structure. Is this an AVL Tree? Height of an AVL Tree
CSE : Data Structures AL Trees Neva Cernavsy Summer Te AL Balance Condton AL balance property: Left and rgt subtrees of every node ave egts dfferng by at most Ensures small dept ll prove ts by sowng tat
More informationA Facet Generation Procedure. for solving 0/1 integer programs
A Facet Generaton Procedure for solvng 0/ nteger programs by Gyana R. Parja IBM Corporaton, Poughkeepse, NY 260 Radu Gaddov Emery Worldwde Arlnes, Vandala, Oho 45377 and Wlbert E. Wlhelm Teas A&M Unversty,
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationEcient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem
Ecent Computaton of the Most Probable Moton from Fuzzy Correspondences Moshe Ben-Ezra Shmuel Peleg Mchael Werman Insttute of Computer Scence The Hebrew Unversty of Jerusalem 91904 Jerusalem, Israel Emal:
More informationLECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming
CEE 60 Davd Rosenberg p. LECTURE NOTES Dualty Theory, Senstvty Analyss, and Parametrc Programmng Learnng Objectves. Revew the prmal LP model formulaton 2. Formulate the Dual Problem of an LP problem (TUES)
More informationOverlapping Clustering with Sparseness Constraints
2012 IEEE 12th Internatonal Conference on Data Mnng Workshops Overlappng Clusterng wth Sparseness Constrants Habng Lu OMIS, Santa Clara Unversty hlu@scu.edu Yuan Hong MSIS, Rutgers Unversty yhong@cmc.rutgers.edu
More informationOBJECT TRACKING BY ADAPTIVE MEAN SHIFT WITH KERNEL BASED CENTROID METHOD
ISSN : 0973-739 Vol. 3, No., Janary-Jne 202, pp. 39-42 OBJECT TRACKING BY ADAPTIVE MEAN SHIFT WITH KERNEL BASED CENTROID METHOD Rahl Mshra, Mahesh K. Chohan 2, and Dhraj Ntnawwre 3,2,3 Department of Electroncs,
More informationLecture 08 Multiple View Geometry 2
Insttte of Informatcs Insttte of Neronformatcs Lectre 8 Mltple Vew Geometry Dade Scaramzza http://rpg.f.zh.ch/ Lab Exercse 6 - Today afternoon Room ETH HG E. from 3:5 to 5: Work descrpton: 8-pont algorthm
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationPolyhedral Compilation Foundations
Polyhedral Complaton Foundatons Lous-Noël Pouchet pouchet@cse.oho-state.edu Dept. of Computer Scence and Engneerng, the Oho State Unversty Feb 8, 200 888., Class # Introducton: Polyhedral Complaton Foundatons
More informationReport #1 Example. Semester
Report # Eample Parallel FEM Class n Wnter Semester Kengo aajma Informaton Technology Center Techncal & Scentfc Comptng I (480-07) Semnar on Compter Scence I (480-04) Report-0 D Statc Lnear Elastc Problem
More informationLecture #15 Lecture Notes
Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal
More informationSupport Vector Machines. CS534 - Machine Learning
Support Vector Machnes CS534 - Machne Learnng Perceptron Revsted: Lnear Separators Bnar classfcaton can be veed as the task of separatng classes n feature space: b > 0 b 0 b < 0 f() sgn( b) Lnear Separators
More informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More informationLP Decoding. Martin J. Wainwright. Electrical Engineering and Computer Science UC Berkeley, CA,
Jon Feldman LP Decodng Industral Engneerng and Operatons Research Columba Unversty, New York, NY, 10027 jonfeld@eor.columba.edu Martn J. Wanwrght Electrcal Engneerng and Computer Scence UC Berkeley, CA,
More informationMECHANICAL ANALYSIS OF 2D-BRAZED JOINT USING A NEW HYBRID MAX- FEM MODEL
MECHANICAL ANALYSIS OF D-BRAZED JOINT USING A NEW HYBRID MAX- MODEL A. IFIS a, F. Blteryst b, M. Noar c a Laboratore d Energétqe et de Mécanqe Théorqe et Applqée, LEMTA CNRS-UMR 756, GIP-InSIC, 7 re d
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 5 Luca Trevisan September 7, 2017
U.C. Bereley CS294: Beyond Worst-Case Analyss Handout 5 Luca Trevsan September 7, 207 Scrbed by Haars Khan Last modfed 0/3/207 Lecture 5 In whch we study the SDP relaxaton of Max Cut n random graphs. Quc
More informationSome Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.
Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationINTEGER PROGRAMMING MODELING FOR THE CHINESE POSTMAN PROBLEMS
INTEGER PROGRAMMING MODELING FOR THE CHINESE POSTMAN PROBLEMS ABSTRACT Feng Junwen School of Economcs and Management, Nanng Unversty of Scence and Technology, Nanng, 2009, Chna As far as the tradtonal
More informationOn Some Entertaining Applications of the Concept of Set in Computer Science Course
On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,
More information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationA Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC -Trees Abstract 1. Introduction
A Lnear Tme Algorthm for Fndng a Mamal Planar Sbgraph Based on PC-Trees Wen-Lan Hs Insttte of Informaton Scence, Academa Snca, Tape, Tawan, ROC hs@s.snca.ed.tw Abstract In Shh & Hs, a planart test was
More informationBoundary layer and mesh refinement effects on aerodynamic performances of horizontal axis wind turbine (HAWT)
Bondary layer and mesh refnement effects on aerodynamc performances of horzontal axs wnd trbne (HAWT) YOUNES EL KHCHINE, MOHAMMED SRITI Engneerng Scences Laboratory, Polydscplnary Faclty Sd Mohamed Ben
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationCooperative Network Coding-Aware Routing for Multi-Rate Wireless Networks
Ts full text paper was peer revewed at te drecton of IEEE Communcatons Socety subject matter experts for publcaton n te IEEE INFOCOM 009 proceedngs. Cooperatve Network Codng-Aware Routng for Mult-Rate
More informationParallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)
Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)
More informationDynamic wetting property investigation of AFM tips in micro/nanoscale
Dynamc wettng property nvestgaton of AFM tps n mcro/nanoscale The wettng propertes of AFM probe tps are of concern n AFM tp related force measurement, fabrcaton, and manpulaton technques, such as dp-pen
More informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
More informationPLANAR TRANSLATIONAL CABLE-DIRECT-DRIVEN ROBOTS: HARDWARE IMPLEMENTATION
Proceedngs of DETC ASME Desgn Engneerng Tecncal Conferences September -6,, Ccago, IL DETC/DAC-88 PLANAR TRANSLATIONAL CABLE-DIRECT-DRIVEN ROBOTS: ARDWARE IMPLEMENTATION Robert L. Wllams II Oo Unversty
More informationNETWORKED CONTROL SYSTEM: THEORY AND SIMULATIONS. A Project by. Sandeep Bimali
NETWORKED CONTROL SYSTEM: THEORY AND SIMULATIONS A Project by Sandeep Bimali Bacelor s Degree in Electronics Engineering, Tribvani University, Nepal December 21 Sbmitted to te Department of Electrical
More informationResearch Article. ISSN (Print) s k and. d k rate of k -th flow, source node and
Scholars Journal of Engneerng and Technology (SJET) Sch. J. Eng. Tech., 2015; 3(4A):343-350 Scholars Academc and Scentfc Publsher (An Internatonal Publsher for Academc and Scentfc Resources) www.saspublsher.com
More informationATYPICAL SDN consists of a logical controller in the
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 25, NO. 6, DECEMBER 2017 3587 Mnmzng Flow Statstcs Collecton Cost Usng Wldcard-Based Requests n SDNs Hongl Xu, Member, IEEE, Zhuolong Yu, Chen Qan, Member, IEEE,
More informationProf. Feng Liu. Spring /24/2017
Prof. Feng Lu Sprng 2017 ttp://www.cs.pd.edu/~flu/courses/cs510/ 05/24/2017 Last me Compostng and Mattng 2 oday Vdeo Stablzaton Vdeo stablzaton ppelne 3 Orson Welles, ouc of Evl, 1958 4 Images courtesy
More informationLecture 15: Memory Hierarchy Optimizations. I. Caches: A Quick Review II. Iteration Space & Loop Transformations III.
Lecture 15: Memory Herarchy Optmzatons I. Caches: A Quck Revew II. Iteraton Space & Loop Transformatons III. Types of Reuse ALSU 7.4.2-7.4.3, 11.2-11.5.1 15-745: Memory Herarchy Optmzatons Phllp B. Gbbons
More informationMode-seeking by Medoidshifts
Mode-seekng by Medodsfts Yaser Ajmal Sek Robotcs Insttute Carnege Mellon Unversty yaser@cs.cmu.edu Erum Arf Kan Department of Computer Scence Unversty of Central Florda ekan@cs.ucf.edu Takeo Kanade Robotcs
More informationON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE
Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton
More informationSorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions
Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) In-place Merge Sort T(n) = Θ(n lg(n)) Not n-place Selecton Sort (from homework) T(n) = Θ(n 2 ) In-place
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More informationPose, Posture, Formation and Contortion in Kinematic Systems
Pose, Posture, Formaton and Contorton n Knematc Systems J. Rooney and T. K. Tanev Department of Desgn and Innovaton, Faculty of Technology, The Open Unversty, Unted Kngdom Abstract. The concepts of pose,
More informationAn Analytical Tool to Assess Readiness of Existing Networks for Deploying IP Telephony
An Analytcal Tool to Assess Readness of Exstng Networks for Deployng IP Telepony K. Sala M. Almasar Department of Informaton and Computer Scence Kng Fad Unversty of Petroleum and Mnerals Daran 31261, Saud
More informationAvailable online at ScienceDirect. Procedia Engineering 137 (2016 ) GITSS2015
Avalable onlne at www.scencedrect.com ScenceDrect Proceda Engneerng 137 (2016 ) 151 160 GITSS2015 Optmzaton of Urban Sngle-Lne Metro Tmetable for Total Passenger Travel Tme under Dynamc Passenger Demand
More informationMultiple optimum values
1.204 Lecture 22 Unconstraned nonlnear optmzaton: Amoeba BFGS Lnear programmng: Glpk Multple optmum values A B C G E Z X F Y D X 1 X 2 Fgure by MIT OpenCourseWare. Heurstcs to deal wth multple optma: Start
More informationFixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
Fxng Max-Product: Convergent Message Passng Algorthms for MAP LP-Relaxatons Amr Globerson Tomm Jaakkola Computer Scence and Artfcal Intellgence Laboratory Massachusetts Insttute of Technology Cambrdge,
More informationDynamic Processor Allocation for Multiple RHC Systems in Multi-Core Computing Environments
9 Amercan Control Conference Hyatt Regency Rverfront, St. Lous, MO, USA June -, 9 FrB. Dynamc Processor Allocaton for Multple RHC Systems n Mult-Core Coutng Envronments Al Azm and Brandon W. Gordon Abstract
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationNon-Split Restrained Dominating Set of an Interval Graph Using an Algorithm
Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,
More informationCollaborative Filtering for Multi-class Data Using Belief Nets Algorithms
Collaboratve Flterng for Mlt-class Data Usng Belef Nets Algorthms Xaoyan S Compter Scence and Engneerng Florda Atlantc Unversty Boca Raton, FL 33431, USA xs@fa.ed Tagh M. Khoshgoftaar Compter Scence and
More informationA Distributed First and Last Consistent Global Checkpoint Algorithm
A Dstrbuted Frst and Last Consstent Global Cecpont Algortm Yosfum Manabe NTT Basc Researc Laboratores 3-1 Mornosato-Waamya, Atsug-s, Kanagawa 43-01 Japan manabe@teory.brl.ntt.co.p Abstract Dstrbuted coordnated
More informationVirtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process
More informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More informationControl strategies for network efficiency and resilience with route choice
Control strateges for networ effcency and reslence wth route choce Andy Chow Ru Sha Centre for Transport Studes Unversty College London, UK Centralsed strateges UK 1 Centralsed strateges Some effectve
More information