A NOVEL DESIGN APPROACH FOR MULTIVARIABLE QUANTITATIVE FEEDBACK DESIGN WITH TRACKING ERROR SPECIFICATIONS
|
|
- Jeffry Willis
- 5 years ago
- Views:
Transcription
1 A OVEL DESIG APPROACH FOR MULTIVARIABLE QUATITATIVE FEEDBACK DESIG WITH TRACKIG ERROR SPECIFICATIOS Seyyed Mohammad Mahd Alav, Al Khak-Sedgh, Batool Labb Department of Electronc and Computer Engneerng, Unversty of Lmerck, Lmerck, Ireland Department of Control, K Toos Unversty of Technology, Tehran, Iran E-mal: Alav_smm@yahoocom, Sedgh@kntuacr, Labb@kntuacr Abstract: In ths paper, a novel Two-Degree-Of-Freedom (DOF) desgn procedure for Mult-Input Mult-Output Quanttatve Feedback Theory (MIMO QFT) problems wth Trackng Error Specfcatons (TES s presented In the proposed procedure, the feedback compensator desgn s separated from the pre-flter desgn, usng the model matchng approach and the unstructured uncertanty modelng concept Ths paper specally deals wth an approprate transformaton of the MIMO system to the euvalent SISO problems, whch allows easy desgn mulaton results have been provded to show the effectveness of the proposed methodology Keywords: Quanttatve Feedback Theory (QFT), Trackng Error Specfcatons (TES, Model-matchng problem I ITRODUCTIO Quanttatve feedback theory (QFT) s a Two- Degree-Of-Freedom (DOF) feedback control desgn method for uncertan plants, whch may nclude structured and unstructured uncertanty The general QFT problem s to desgn the feedback compensator and pre-flter shown n Fg to acheve the desred performance The feedback compensator reduces the effects of uncertantes and pre-flter shfts the response to the desred regon Fg 1 Two-degree-of-freedom feedback system There are two man approaches to descrbe the desred performance n QFT desgn In most QFT problems, the desred specfcatons are assumed to be only on the magntudes of the closed loop transfer functons, termed as standard approaches n ths paper These specfcatons place the response of the closed loop system between two lower and upper bounds, (Borghesan et al, 1994; Cheng, et al, 1996) In the second approach, Trackng Error Specfcatons (TES s employed (Alav et al, 004; Alav et al, 005; Boje, 00; Boje, 003; Yanv and Chat, 199) Constranng the magntude of the dfference between closed loop transfer functon and reference model to le wthn a dsk around a desred response can make a better engneerng sense, see (Boje, 00) The dea of TESs for Mult-Input Mult-Output Quanttatve Feedback Theory (MIMO QFT) problems was proposed by Yanv and Chat, (199) In order to smplfy the desgn procedure, they selected the reference model as the pre-flter and lost one degree of freedom Then, a DOF desgn method has been presented by Boje (00), for multvarable systems based on relatve trackng error concept It has been shown that the zero relatve trackng error assumpton for the nomnal plant could separate the feedback compensator desgn from the pre-flter desgn As n standard QFT approach, the feedback
2 compensator s desgned usng a senstvty constrant for each on-dagonal subsystem A nonlnear search s used to fnd the ndvdual elements of F (, whch causes dffcultes wthout necessarly mprovng the desgned pre-flter The desgned pre-flter may be complex and of hgh order In (Alav et al, 005), a novel DOF desgn technue has been proposed for MIMO QFT problems wth TESs Usng an approprate transformaton of the MIMO system to the euvalent ngle-input, ngle-output (SISO) problems, the feedback compensator desgn has been separated from the pre-flter desgn Ths transformaton resulted n approprate output dsturbance rejecton model for the feedback compensator desgn In (Alav et al, 005), t has been shown how the ndvdual elements of the preflter Transfer Functon Matrx (TFM) can be desgned for MIMO systems, usng the dea suggested by Boje, (003) In ths paper a novel DOF desgn procedure n MIMO QFT problems wth TESs s presented It s shown how the feedback compensator desgn s separated from the pre-flter desgn, usng the modelmatchng approach and the unstructured uncertanty modelng concept The elements of the feedback compensator TFM are desgned usng an approprate output dsturbance rejecton model for each euvalent SISO problems The ndvdual elements of the pre-flter TFM are also desgned va the soluton of the obtaned model-matchng problems, e, the euvalent SISO problems The paper s organzed as follows In secton II, the problem of QFT controller desgn s formulated In secton III, the MIMO problem s transformed to the SISO euvalent problems In secton IV and V, the pre-flter and feedback compensator desgn are dscussed, respectvely In secton VI, the desgn procedure s outlned and fnally n secton VII an llustratve example s carred out to show the effectveness of the proposed methodology II PROBLEM FORMULATIO Consder a gven uncertan plant wth the DOF feedback control system shown n Fg 1 The real TESs E( s defned as the magntude of dfference between the reference model M (, and the TFM of the controlled system T m (, as gven by euaton (1): E( M( Tm E( [ e ], M( [ m ], Tm [ tm ] (1) and j {, } The objectve s to desgn a feedback compensator, G (, and a pre-flter, F (, to meet the desred TESs, E d (, gven by euaton () for all plants n the regon of uncertanty M( T( F( E ( j ) d ω () E [ e ] d d T ( represents the complementary senstvty TFM of the controlled system III THE EQUIVALET SISO PROBLEMS In ths secton, the MIMO problem s transformed to the euvalent SISO problems, (Alav et al, 005) It can be shown that the closed loop TFM T m ( can be decomposed as follows: 1 Tm α T( (3) Where, 1 α1 L α1 1( ) 1 ( ) ( ) α s L α s α s M M O M α 1( α L 1 l T f, 1+ l 1 1 P, α and, l 1 + Substtutng euaton (3) nto euaton (1) results n: e j, k α e k α m t (4) Usng the Schwartz neualty on the rght-hand sde of euaton (4), the part of the dfference between reference model and complementary senstvty functon s separated from the other parts as follow: e j K, α ( e m ) t k s α ( e m ) t k s s (5) Defnng 1 (1 + l ) as the senstvty functon of the on-dagonal closed-loop subsystems and substtutng t nto α (, results n α be rewrtten as: e j L, S t Therefore, euaton (5) can ( e k ) (6) Therefore, n order to acheve the desred specfcaton (), t s suffcent to have:
3 S Or m ( e k t t e e d d ( e k for j, ) for j L, (7) ) (8) As n standard QFT, the desgn specfcatons are used to over-bound any unknown functons on the rght-hand sde of euaton (8) Usng the notaton T l (1 + l ), t ( can be rewrtten as t T f Then, euaton (8) can be expressed as follows: m T f ( γ (9) j, Where, γ ( Ed ( ( ( Ed ( + M ( ) k In euaton (9) M ( and E d ( represent the magntude of desred desgn specfcatons, e, M ( : m and Ed ( : ed Euaton (9) descrbes the MIMO problem n the form of the euvalent SISO problems The rght hand sde of (9) should be postve; therefore the followng constrant on senstvty functon wll be obtaned as the cost pad for transformaton of the MIMO problem to the euvalent SISO problem: K, Ed ( (10) mn j, ( ( ) ( )) Ed ω + M ω k Euaton (10) also ndcates a novel crteron for mnmzng the nteractons resulted from other subsystems In euaton (10), n order to attenuate the nteractons between the subsystems, the worst case of Ed ( ( ( ) ( )) Ed ω + M ω k s consdered IV PRE-FILTER DESIG In the prevous secton, t has been shown that how the MIMO QFT problem () s transformed nto the euvalent SISO problems (9) by approprate cost on the senstvty functon for each solated subsystem In fact, euaton (9) represents a model-matchng problem n the face of uncertanty It seems f M / T s upstandng soluton of the obtaned model matchng problem, but snce T ( s uncertan and unknown, f M / T s mpractcal In addton, we wll lose one degree of freedom by selectng f M / T To solve ths problem, an auxlary functon, J ( s added and f ( s suggested to desgn by the followng euaton: M f J (11) To Where, T o ( s the nomnal closed loop transfer functon The followng ponts are to be noted n usng the auxlary functon, J ( : 1 In secton V, t wll be shown that by J 1 for ω ωh the feedback compensator desgn can be separated from the pre-flter desgn whch DOF structure s preserved ω h s the performance bandwdth In addton, ths assumpton on the auxlary functon at low freuency leads to easy desgn of J ( and then pre-flter To have low order pre-flters, J ( could be desgned to cancel some poles and zeros of M To Furthermore, t s very useful for avodance of mproper realzaton of the desgned pre-flter V FEEDBACK COMPESATOR DESIG Havng the euvalent SISO problems and the structure of f (, ths secton presents the feedback compensator desgn By substtutng the multplcatve uncertanty model of T (, (e, T (1 + To ) To ) and (11) nto (9), we have: M ( 1 (1 + To ) J γ (1) By assumng that J 1for ω ωh, euaton (1) can be rewrtten as (13) and the feedback compensator s separated form the pre-flter desgn M ( To γ (13) By relaton between T o ( and o ( (the multplcatve uncertanty model of o (, e, (1 + o ) o ), n the followng form: To o (14)
4 Euatons (14) mply another constrant on the senstvty functon for each euvalent SISO problem gven by: γ (, ω ωh (15) M ( j, o nce the plant s uncertan, the over-bound of ( o ) o, for the entre uncertanty regon wthn the performance bandwdth, e, o o o for ω ωh, s preferred Thus, euaton (15) s modfed as: γ (, ω ωh (16) j, M ( o Substtutng γ nto euaton (16) and rearrangng t, results n: j, ω ω K h Ed( mn j, M ( ) ( ) + ( ( ) ( )) ω o Ed ω + M ω k (17) In relaton (17), n order to attenuate the nteractons between the subsystems, the worst case of Ed ( M + ( o( ( Ed ( + M ( ) k has been consdered In the desgn procedure, two constrant euatons (10) and (17) have been acheved on the senstvty functon of each euvalent SISO problem Euaton (10) s resulted from the transformaton of the MIMO problem nto the euvalent SISO problems Euaton (17) s resulted from the separaton of preflter desgn and feedback compensator desgn for each euvalent SISO problem wthn the performance bandwdth As n standard QFT desgn, the fnal composte permtted robust performance bounds on the loop functon l are constructed from the ntersecton of the euaton (10) and euaton (17) wthn the performance bandwdth It s obvous that satsfyng euaton (17) results n satsfyng euaton (10) Therefore, euaton (17) s the fnal senstvty constrant to mnmze the nteractons and the effects of uncertantes for each euvalent subsystem whch they are treated as an output dsturbance, D, enterng to the each euvalent SISO problems as shown n Fg From above statements, to assure the achevement of the robust performance, t s suffcent to select output dsturbance rejecton model, T D ( as gven by euaton (18) Fg Control Structure of -th euvalent SISO problem Y < TD for ω ωh (18) D Where, TD K, ωωh Ed( mn j, M + ( o( ( Ed( + M ( ) k Usng MATLAB QFT-Toolbox (Borghesan et al 1994) and based on euaton (18), the permtted robust performance bounds on the loop functon l can be generated to desgn the desred feedback compensator for each euvalent SISO problems In order to acheve robust stablty wthn [ 0, ω h ], t s suffcent to desgn the feedback compensator for each euvalent SISO problem such that the loop functon does not ntersect the crtcal o pont ( 180,0dB) A mum overshoot constrant wth margns: T l (1 + l ) δ (19) for ω ωh s also proposed n order to acheve robust stablty desgn bounds at hgher freuences δ s constant and represents the mum allowable freuency peak In order to have robust stablty at hgher freuences than performance bandwdth, the loop functon should not enter the stablty U-Contours VI DESIG PROCEDURE The desgn procedure s summarzed as follows: 1- Draw ( o ) o, for the entre uncertanty regon and fnd o wthn the performance bandwdth - Select an approprate dsturbance rejecton model such that (18) s satsfed 3- Desgn the compensator for each euvalent SISO subsystem 4- Draw ( T To ) To, for the entre uncertanty regon and fnd T o 5- Select ) (s J s such that the desgned pre-flter for each solated subsystem s (strctly) proper and euaton (1) s satsfed
5 Remarks: 1- An approprate selecton of multplcatve uncertanty model, e, and T o o, reduces the desgn conservatveness - The choce of a sutable nomnal plant, n the sense that the lowest uncertanty model s attaned, leads to lower over-degn 3- In ths approach pre-flter may be hgh order If J ( s exactly desgned such that M / To and J ( have the same poles or zeros, the pre-flter wll be lower order T l 1+ l 13 Usng MATLAB QFT-Toolbox, the permtted desgn bounds become as Fg 4 Fg 4 shows that the followng feedback compensator satsfes the performance and stablty bounds 75( s / )( s / )( s / ) 1, ( s / )( s / )( s / )( s / ) VII ILLUSTRATIVE EXAMPLE Consder the lnear tme nvarant plant: 1 k11 k1 k1 [,6] P, s + 1 k 1 k k1 [05,15] Suppose that the desred specfcatons are to acheve the steady state error less than % and settlng tme 5(sec) Fg 3 The output dsturbance rejecton model for solated subsystems Step1: desred specfcatons wth the Followng M ( and ( are satsfed E d 1 001s ( s 1+ 1)( s 5 + 1) ( 0 0 1) ( ) s + s + M s 001s 1 ( 0 0 1) ( 1 1)( 5 1) s + s + s + s + And, s + 00 ed ( s ) j s + The nomnal plant s chosen by mum value of k and ω h 5( rad / sec) s selected as the closed loop bandwdth Step: o ( s computed as 083( s 5 + 1) ( s 6 + 1) for Step3: Computng the rght hand sde of euaton (14) for each euvalent SISO loop, the output dsturbance rejecton models are selected as: 005( s 1 + s 1+ 1) TD 1, ( s ) s Fg 3 shows the selected output dsturbance rejecton model for solated subsystems If the chols envelope does not ntersect the crtcal pont (-180 o,0db), T D guarantees the robust performance and robust stablty wthn ω 0, ω ] At hgher freuences, e, [ h ω {10,0,50}, robust stablty bound has been consdered usng the constrant on the complementary senstvty matrx as Fg 4 Desgn of g ( n chols Chart usng MATLAB QFT-Toolbox wth robust performance ω { 0,,5}( rad / sec) and robust stablty bounds ω { 10,0,50}( rad / sec) Step4: The multplcatve uncertanty model of T o, s obtaned as: 01s To 1, ( s / 8 + 1) Step5: Selectng ( s ) J, ( s )( s ) J ( s j J s + 479) Euaton (1) s satsfed for each element of the transfer functon matrx Fnally, strctly proper preflter s acheved by: f ( s s + 479) ( s + 418)( s + 5)( s + 1)
6 f j s ( s + 418)( s + 0s + 004) Applyng the desgned controller to the system, fgures 5 and 6 show satsfacton of the error specfcatons and unt step responses of the controlled system for several extreme plant cases They show that the desred trackng error wll be satsfed Fg 5 Error specfcatons of the control system, desred dashed REFERECES Alav SMM, A Khak-Sedgh and B Labb (004) A ovel Desgn Approach for Trackng Error Specfcatons n SISO-QFT: A Mnmum Phase Case, Proc 1 th Medterranean Conference on Control and Automaton, MED 04, Turkey Alav SMM, A Khak-Sedgh and B Labb (005) Pre-flter Desgn for Trackng Error Specfcatons n MIMO-QFT, Proc the Jont Conference IEEE Conference on Decson and Control & European Control Conference, CDC- ECC'05, Span, pp Boje, E, (00) Multvarable Quanttatve Feedback Desgn for Trackng Error Specfcatons, Automatca, 38, Boje, E, (003) Pre-flter desgn for trackng error specfcatons n QFT, Int J Robust and onlnear Control, 13, pp Borghesan C, Y Chat and O Yanv, (1994) Quanttatve Feedback Theory Toolbox User s Gude, The MathWorks Inc Cheng, C-C, Y-K Lao and T-S Wang, (1996) Quanttatve feedback desgn of uncertan multvarable control systems, Int J Control, 65, o 3, Yanv, O and Y Chat, (199) A mplfed Multnput Mult-output Formulaton for the Quanttatve Feedback Theory, J Dynamc Systems, Measurement and Control, 114, pp Fg 6 Unt step responses of the controlled system COCLUSIOS Ths paper presents a smple desgn procedure n MIMO-QFT problems wth TESs It has been shown how the feedback compensator desgn s separated from pre-flter desgn through the concept of model matchng problem and unstructured uncertanty Approprate transformaton of MIMO system to the euvalent SISO problems s the other concept dscussed n ths paper The ndvdual elements of the pre-flter TFM are desgned by employng the model matchng soluton Heurstc algorthms such as genetc algorthm would be useful to fnd approprate pre-flter TFM The elements of the feedback compensator are also desgned usng approprate output dsturbance rejecton model An llustratve example has been provded to show the effectveness of the desgn methodology
Lectures on Multivariable Feedback Control
Lectures on Multvarable Feedback Control Al Karmpour Department of Electrcal Engneerng, Faculty of Engneerng, Ferdows Unversty of Mashhad June 200) Chapter 9: Quanttatve feedback theory Lecture Notes of
More informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
More informationControl of Uncertain Bilinear Systems using Linear Controllers: Stability Region Estimation and Controller Design
Control of Uncertan Blnear Systems usng Lnear Controllers: Stablty Regon Estmaton Controller Desgn Shoudong Huang Department of Engneerng Australan Natonal Unversty Canberra, ACT 2, Australa shoudong.huang@anu.edu.au
More informationDesign 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!"#! $ %!&'(! ) &% * +!%,&% * "-%&-!&+ "-%-!" &'&&' ". /
!"#! $ %!&'(! &% * +!%,&% * "-%&-!&+ "-%-!" &'&&' ". /0. 3 Dedcated to my beloved parents and sster! " TABLE OF CONTENTS ACKNOWLEDGEMENTS........... OBJECTIVES OF THE PROJECT.......... ABSTRACT.............
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationRobust 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 informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
More informationCOEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN
Int. J. Chem. Sc.: (4), 04, 645654 ISSN 097768X www.sadgurupublcatons.com COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN R. GOVINDARASU a, R. PARTHIBAN a and P. K. BHABA b* a Department
More informationAdaptive Consensus Control of Multi-Agent Systems with Large Uncertainty and Time Delays *
Journal of Robotcs, etworkng and Artfcal Lfe, Vol., o. (September 04), 5-9 Adaptve Consensus Control of Mult-Agent Systems wth Large Uncertanty and me Delays * L Lu School of Mechancal Engneerng Unversty
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationTHE GUARANTEED COST CONTROL FOR UNCERTAIN LARGE SCALE INTERCONNECTED SYSTEMS
Copyrght 22 IFAC 5th rennal World Congress, Barcelona, Span HE GUARANEED COS CONROL FOR UNCERAIN LARGE SCALE INERCONNECED SYSEMS Hroak Mukadan Yasuyuk akato Yoshyuk anaka Koch Mzukam Faculty of Informaton
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationCONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING INTRODUCTION
CONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING N. Phanthuna 1,2, F. Cheevasuvt 2 and S. Chtwong 2 1 Department of Electrcal Engneerng, Faculty of Engneerng Rajamangala
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationWinter 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 informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationModule 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 informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationThe Concept of Beamforming
ELG513 Smart Antennas S.Loyka he Concept of Beamformng Generc representaton of the array output sgnal, 1 where w y N 1 * = 1 = w x = w x (4.1) complex weghts, control the array pattern; y and x - narrowband
More informationECE559VV 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 informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationAGC Introduction
. Introducton AGC 3 The prmary controller response to a load/generaton mbalance results n generaton adjustment so as to mantan load/generaton balance. However, due to droop, t also results n a non-zero
More informationCanonical transformations
Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,
More informationAt ω = ω i every sub-plant defines a subtemplate. template T ωi is,
Proceedngs of the th Medterranean Conference on Control & Automaton, July 7 -, 007, Athens - Greece T31-0 Analytcal formulaton to compute QFT templates for plants wth a hgh number of uncertan parameters
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationColor Rendering Uncertainty
Australan Journal of Basc and Appled Scences 4(10): 4601-4608 010 ISSN 1991-8178 Color Renderng Uncertanty 1 A.el Bally M.M. El-Ganany 3 A. Al-amel 1 Physcs Department Photometry department- NIS Abstract:
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationProblem 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 informationSolution of Linear System of Equations and Matrix Inversion Gauss Seidel Iteration Method
Soluton of Lnear System of Equatons and Matr Inverson Gauss Sedel Iteraton Method It s another well-known teratve method for solvng a system of lnear equatons of the form a + a22 + + ann = b a2 + a222
More informationChapter 8 Indicator Variables
Chapter 8 Indcator Varables In general, e explanatory varables n any regresson analyss are assumed to be quanttatve n nature. For example, e varables lke temperature, dstance, age etc. are quanttatve n
More informationA LINEAR PROGRAMMING APPROACH FOR REGIONAL POLE PLACEMENT UNDER POINTWISE CONSTRAINTS
A LINEAR PROGRAMMING APPROACH FOR REGIONAL POLE PLACEMENT UNDER POINTWISE CONSTRAINTS Max M.D. SANTOS, Eugêno B. CASTELAN, Jean-Claude HENNET Abstract Ths paper consders the problem of control of dscrete-tme
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationDUE: WEDS FEB 21ST 2018
HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant
More informationLecture 14: Bandits with Budget Constraints
IEOR 8100-001: Learnng and Optmzaton for Sequental Decson Makng 03/07/16 Lecture 14: andts wth udget Constrants Instructor: Shpra Agrawal Scrbed by: Zhpeng Lu 1 Problem defnton In the regular Mult-armed
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationSPANC -- SPlitpole ANalysis Code User Manual
Functonal Descrpton of Code SPANC -- SPltpole ANalyss Code User Manual Author: Dale Vsser Date: 14 January 00 Spanc s a code created by Dale Vsser for easer calbratons of poston spectra from magnetc spectrometer
More informationInexact Newton Methods for Inverse Eigenvalue Problems
Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.
More informationThis model contains two bonds per unit cell (one along the x-direction and the other along y). So we can rewrite the Hamiltonian as:
1 Problem set #1 1.1. A one-band model on a square lattce Fg. 1 Consder a square lattce wth only nearest-neghbor hoppngs (as shown n the fgure above): H t, j a a j (1.1) where,j stands for nearest neghbors
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationInteractive 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 informationMAE140 - Linear Circuits - Winter 16 Final, March 16, 2016
ME140 - Lnear rcuts - Wnter 16 Fnal, March 16, 2016 Instructons () The exam s open book. You may use your class notes and textbook. You may use a hand calculator wth no communcaton capabltes. () You have
More informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationSolutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.
Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationModeling and Design of Real-Time Pricing Systems Based on Markov Decision Processes
Appled Mathematcs, 04, 5, 485-495 Publshed Onlne June 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.504 Modelng and Desgn of Real-Tme Prcng Systems Based on Markov Decson Processes
More informationLimit Cycle Generation for Multi-Modal and 2-Dimensional Piecewise Affine Control Systems
Lmt Cycle Generaton for Mult-Modal and 2-Dmensonal Pecewse Affne Control Systems atsuya Ka Department of Appled Electroncs Faculty of Industral Scence and echnology okyo Unversty of Scence 6-3- Njuku Katsushka-ku
More informationNovember 5, 2002 SE 180: Earthquake Engineering SE 180. Final Project
SE 8 Fnal Project Story Shear Frame u m Gven: u m L L m L L EI ω ω Solve for m Story Bendng Beam u u m L m L Gven: m L L EI ω ω Solve for m 3 3 Story Shear Frame u 3 m 3 Gven: L 3 m m L L L 3 EI ω ω ω
More informationSupport Vector Machines. Vibhav Gogate The University of Texas at dallas
Support Vector Machnes Vbhav Gogate he Unversty of exas at dallas What We have Learned So Far? 1. Decson rees. Naïve Bayes 3. Lnear Regresson 4. Logstc Regresson 5. Perceptron 6. Neural networks 7. K-Nearest
More informationBasic Statistical Analysis and Yield Calculations
October 17, 007 Basc Statstcal Analyss and Yeld Calculatons Dr. José Ernesto Rayas Sánchez 1 Outlne Sources of desgn-performance uncertanty Desgn and development processes Desgn for manufacturablty A general
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More information829. An adaptive method for inertia force identification in cantilever under moving mass
89. An adaptve method for nerta force dentfcaton n cantlever under movng mass Qang Chen 1, Mnzhuo Wang, Hao Yan 3, Haonan Ye 4, Guola Yang 5 1,, 3, 4 Department of Control and System Engneerng, Nanng Unversty,
More informationAppendix B. The Finite Difference Scheme
140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton
More informationSolving Nonlinear Differential Equations by a Neural Network Method
Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationRobust Model Predictive Control
Robust Model Predctve Control Formulatons of robust control [1] he robust control problem concerns to the control of plants that are only approxmately nown. Usually, t s assumed that the plant les n a
More informationSIMULTANEOUS TUNING OF POWER SYSTEM STABILIZER PARAMETERS FOR MULTIMACHINE SYSTEM
SIMULTANEOUS TUNING OF POWER SYSTEM STABILIZER PARAMETERS FOR MULTIMACHINE SYSTEM Mr.M.Svasubramanan 1 Mr.P.Musthafa Mr.K Sudheer 3 Assstant Professor / EEE Assstant Professor / EEE Assstant Professor
More informationOff-policy Reinforcement Learning for Robust Control of Discrete-time Uncertain Linear Systems
Off-polcy Renforcement Learnng for Robust Control of Dscrete-tme Uncertan Lnear Systems Yonglang Yang 1 Zhshan Guo 2 Donald Wunsch 3 Yxn Yn 1 1 School of Automatc and Electrcal Engneerng Unversty of Scence
More informationSIO 224. m(r) =(ρ(r),k s (r),µ(r))
SIO 224 1. A bref look at resoluton analyss Here s some background for the Masters and Gubbns resoluton paper. Global Earth models are usually found teratvely by assumng a startng model and fndng small
More information1 Derivation of Point-to-Plane Minimization
1 Dervaton of Pont-to-Plane Mnmzaton Consder the Chen-Medon (pont-to-plane) framework for ICP. Assume we have a collecton of ponts (p, q ) wth normals n. We want to determne the optmal rotaton and translaton
More informationCHAPTER 4 MAX-MIN AVERAGE COMPOSITION METHOD FOR DECISION MAKING USING INTUITIONISTIC FUZZY SETS
56 CHAPER 4 MAX-MIN AVERAGE COMPOSIION MEHOD FOR DECISION MAKING USING INUIIONISIC FUZZY SES 4.1 INRODUCION Intutonstc fuzz max-mn average composton method s proposed to construct the decson makng for
More information4DVAR, according to the name, is a four-dimensional variational method.
4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationFUZZY 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 informationCopyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor
Taylor Enterprses, Inc. Control Lmts for P Charts Copyrght 2017 by Taylor Enterprses, Inc., All Rghts Reserved. Control Lmts for P Charts Dr. Wayne A. Taylor Abstract: P charts are used for count data
More informationMinimax Optimal Control of Stochastic Uncertain Systems with Relative Entropy Constraints
[IEEE Trans. Aut. Control, 45, 398-412, 2000] Mnmax Optmal Control of Stochastc Uncertan Systems wth Relatve Entropy Constrants Ian R. Petersen Matthew R. James Paul Dupus Abstract Ths paper consders a
More informationA 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 informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
More informationSemi-supervised Classification with Active Query Selection
Sem-supervsed Classfcaton wth Actve Query Selecton Jao Wang and Swe Luo School of Computer and Informaton Technology, Beng Jaotong Unversty, Beng 00044, Chna Wangjao088@63.com Abstract. Labeled samples
More informationOutput Feedback Adaptive Robust Control of Uncertain Linear Systems With Disturbances
Bn Yao 1 School of Mechancal Engneerng, Purdue Unversty, West Lafayette, IN 47907 e-mal: byao@purdue.edu L Xu Research and Advanced Engneerng, Ford Motor Company, Dearborn, MI 48124 Output Feedback Adaptve
More informationIterative General Dynamic Model for Serial-Link Manipulators
EEL6667: Knematcs, Dynamcs and Control of Robot Manpulators 1. Introducton Iteratve General Dynamc Model for Seral-Lnk Manpulators In ths set of notes, we are gong to develop a method for computng a general
More informationA New Evolutionary Computation Based Approach for Learning Bayesian Network
Avalable onlne at www.scencedrect.com Proceda Engneerng 15 (2011) 4026 4030 Advanced n Control Engneerng and Informaton Scence A New Evolutonary Computaton Based Approach for Learnng Bayesan Network Yungang
More informationNeural-Based Decentralized Robust Control of Large-Scale Uncertain Nonlinear Systems with Guaranteed H Performance
Proceedngs of the 45th IEEE Conference on Decson & Control Manchester Grand Hyatt Hotel an Dego CA UA December 3-5 26 Neural-Based Decentralzed Robust Control of Large-cale Uncertan Nonlnear ystems wth
More informationELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM
ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationUNIVERSITY OF TORONTO Faculty of Arts and Science. December 2005 Examinations STA437H1F/STA1005HF. Duration - 3 hours
UNIVERSITY OF TORONTO Faculty of Arts and Scence December 005 Examnatons STA47HF/STA005HF Duraton - hours AIDS ALLOWED: (to be suppled by the student) Non-programmable calculator One handwrtten 8.5'' x
More informationBallot Paths Avoiding Depth Zero Patterns
Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationOutline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique
Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng
More informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
More informationPhysics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1
P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the
More informationPattern Classification
Pattern Classfcaton All materals n these sldes ere taken from Pattern Classfcaton (nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wley & Sons, 000 th the permsson of the authors and the publsher
More informationMechanics Physics 151
Mechancs Physcs 5 Lecture 0 Canoncal Transformatons (Chapter 9) What We Dd Last Tme Hamlton s Prncple n the Hamltonan formalsm Dervaton was smple δi δ p H(, p, t) = 0 Adonal end-pont constrants δ t ( )
More information