Design and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
|
|
- Susanna Webb
- 5 years ago
- Views:
Transcription
1 Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran Abstract: The reverse movng pendulum system, because of ts nonlnear unstable and non-mnmum phase dynamcs has always been a good crteron for testng and evaluatng control methods. In ths paper, a new method based on fuzzy controllng of the system s presented. Several methods are suggested for optmzng the fuzzy controllers such as, genetc algorthm and neural network. We have used genetc algorthm to fnd the optmum set of fuzzy rules among all possble rules to control the system. Ths controller not only decreases the settlng tme, but also elmnates the fluctuatons of steady state response acceptably and leads to an even moton of the pendulum, whch results n a better controllng of the system n comparson wth the exstng classc methods. KeyWords: Fuzzy Controller, Inverse Pendulum System, Rules Base, Genetc Algorthm (GA), optmzaton. INTRODUCTION A fuzzy controller s based on human logc and attempts to behave lke a human who controls a system. A fuzzy controller for a desred functon requres correct adustment. The number, shape and operatonal range of nput and output membershp functons, table of rules, etc are the parameters that should be adusted accordng to the system specfcatons. Adustng these parameters for a smple system mght be done easly, but for a complcated system t s usually a challenge task, therefore some ntellgent methods such as neural network, that has a hgh level of learnng ablty and Genetc Algorthm that s a powerful searchng method for desgnng a fuzzy controller are appled. In ths document desgn of fuzzy controller based on adustng the rule base usng genetc algorthm s presented. Three methods are usually appled n adustng rule base usng Genetc Algorthm[0] Mchgan method, Pttsburgh method teratve learnng rules In Mchgan method each rule s consdered as a chromosome and populaton conssts of a number of rules. In Pttsburgh method the rule base s consdered as a chromosome. In the thrd method chromosomes consst of a group of rules that each rule enters the chromosome after a large number of teratons. In ths paper Pttsburgh method has been appled to desgn a fuzzy controller for nverse pendulum system based on the two methods presented n [,3]. In part 2 the nverse pendulum system has been descrbed. In part 3 Genetc Algorthm structure s gven. Part 4 explans the procedure of provdng Genetc Algorthm to acheve approprate rule base for the fuzzy controller. Fnally n part 5 Fuzzy controller desgn, the Genetc Algorthm optmzaton and smulatons were done usng MATLAB software. The smulaton results verfy successful applcaton of our method to real moton stuatons. 2 THE INVERSE PENDULUM SYSTEM To solve the problem of nverse pendulum system t s requred to get famlar wth Lagrange Formula n order to be able to formulate the operaton of the system. Therefore we frst descrbe the Lagrange Formula and then usng ths formula we formulate the movement of the nverse pendulum 2. Lagrange Formula q = ( q q,..., q ) Suppose that, 2 n are ndcatons of orthonormal vectors of the space. If T s the Knetc Energy of the system and V s the Potental Energy
2 of the system, then L = T V s called Lagrangan. In ths case the equatons of the moblty of the system can be acheved from the followng equatons. d L L dt q q =,2,..., n = F For the nverse pendulum system whch s shown n fgure () q = x and q 2 = θ (where x s poston and θ s angle of the pendulum). x p = x + l snθ = l cosθ T = 2 y p 2 ( J + ml ) θ + 2( M + m) + ml xθ cosθ L = T V d L L dt x x = F x ( ) (2) d dt L L θ θ = 0 (3) Fgure : the parameters x, tetta defnton T = J θ + 2 m x p + y p + 2 M x 2 (,2,3 ) ( m+ M) x+ mlθ cosθ mlθ snθ = F 2 ( J + ml ) θ+ mlx cosθ mgl snθ = 0 The system model s also provded n fgure (2) V = mgl cosθ Fgure 2: the nverse pendulum system model
3 3 GENETIC ALGORITHM Genetc Algorthm (GA) s a powerful searchng method that operates based on selectng and producng generaton n nature. GA deals wth a populaton of chromosomes and s n search of the one that has the best characterstcs. The effcency of each chromosome s evaluated wth a functon that ndcates ts goodness (cost functon). In fact n an optmzaton we are lookng for a chromosome that has the best performance. Each chromosome s constructed from a number of smaller parts called genes. Intally, GA chooses some chromosomes randomly and generates the frst populaton. The cost functon (how good and effcent the chromosome s) s calculated for each of these chromosomes. To produce next generaton, the chromosomes that have bgger cost functon values have hgher probablty to be chosen and GA operators are appled to them n order to produce new chromosomes. GA operators are crossover and mutaton. In crossover a number of genes are two chromosomes are selected and exchanged to generate new chromosomes that make next generaton and replace the prevous generaton. In mutaton a gene of a chromosome wll be selected and replaced by another gene that s produced randomly. Cost functon s calculated for these chromosomes and other generatons are produced accordng to ts value. 4 PROVIDING GENETIC ALGORITHM In ths part a genetc algorthm for optmzng the rule base wll be provded. Accurate preparaton of ths algorthm for a problem s an mportant part of solvng t, and naccurate adustment of ths algorthm may yeld dvergence n optmum response or may lead us to locally optmum responses. The goal s to get an optmum rule base. Therefore, wth a genetc algorthm approach, an optmum rule base should be found. To do ths, each rule base s consdered as a chromosome, the tnest fracture of a rule base s a rule that descrbes the output membershp functon for a specfc state of the angle and ts dervatve (angular velocty). So each rule can be consdered as a gene. A rule can be defned as follows: If angle belongs to the membershp functon and angular velocty belongs to the membershp functon, then the control sgnal belongs to the membershp functon k. Regardng ths defnton each rule can be descrbed as a three dgt number of k. Intal generaton conssts of a number of chromosomes that there genes are produced randomly. Genes of a chromosome may be repeated, whch means havng dentcal rules n rule base s allowed. Also some rules have dentcal f parts but dfferent then parts, lke 566 and 567, n ths case there fuzzy or combnaton wll be appear n the output. Cost functon should be defned accordng to what s as sutable and unsutablty of a chromosome (rule base). The better the rule base s, the better the system wll be controlled and the output wll follow the nput suffcently. Cost functons may be t t 2 2 I = ( e + u )dt and I = 0 ( e + u )dt for 0 contnues sgnals and I = e + u and 2 2 I = ( e + u ) for dscrete sgnals. To defne cost functon frst each chromosome (rule base)and then the lnear model of the nverse pendulum system together wth the Fuzzy controller are put n a loop and are evaluated for several states of the nput and output, after that the weghted summaton of the obtaned errors are calculated due to ths equaton: f ( RB ). In ths = equaton th α α I I s the performance of the system for rule base for th ntal and fnal state, n whch s the weght of each I regardng the ntal and fnal values. In ths case the cost functon wll be maxmzed. Now the genetc algorthm operatons can be exerted on chromosomes. Choosng operaton s done accordng to the cost functon and wth a rotary method. In the mutaton operaton, frst a gene wll be chosen randomly and another gene that s randomly produced wll replace t n the chromosome. Therefore mutaton changes a rule n the rule base. Fuzzy controller has two nputs (error and ts dervatve) and one output sgnals. In the fuzzy controller Mamdan method and also operand MIN for AND and operand MAX for OR have been used.
4 Snce 5 membershp functons have been chosen for error and dervatve of error, length of a chromosome that s the number of genes s assumed 25. Consderng the 7 membershp functons for the output, all of the forms that a rule can have are equal to = 75, therefore t s better to choose the number of populaton about 75. As descrbed above, each rule (gene) can be represented n 75 forms, snce each chromosome has 25 genes and dentcal rules are allowed, all of the forms that a chromosome may be represented s PROVIDING THE OPTIMAL RULE BASE In ths part we perform GA wth populaton number of 50, crossover probablty of, mutaton probablty of 0.5 and smulaton tme of 5 seconds, for 200 generaton, and analyze the results. Step response of the nverse pendulum system wth a fuzzy controller and the best acheved rule base for a number of generatons s provded and depcted n fgure 4. As can be seen n the fgure, the response does not have overshoot and ts steady state error s zero. As t s obvous from fgure 5, t s probable that we don t get the best response n the last generaton. The best response (maxmum cost functon value) s gven n fgure 5. Although there are some fluctuatons n t, but t s ncreasng whch means better responses wll be obtaned n newer generatons. The rule base correspondent to the best answer s provded n table (). In ths table the output membershp functons are as follows. PL (stands for Postve Large), PM (stands for Postve Medum), PS (stands for Postve Small), Z (stands for zero), NL (stands for Negatve Large), NM (stands for Negatve Medum), NS (stands for Negatve Small). It can be seen that some boxes of the table are empty that occurs under three crcumstances: The nverse pendulum system does not nclude such error and error dot, so the fuzzy controller doesn t need to ths type of rule. Because of the overlap of the membershp functons, ths box s affected by the neghbors boxes rules. The dynamc of system orders that under ths condton t doesn t requre a rule and wats untl the condton changes. Fgure 3: the optmum rule base
5 Fgure 4: the step response for the optmum rule base By omttng the repeated rules we can acheve a table, whch s optmzed regardng number of rules too. The fuzzy controller used n ths system has two nputs and one output, so the plot of the graph (rules surface) can be shown n a three dmensonal space. Fgure (3) ndcates the relatonshp between the error, the error dot and the output control sgnal. Fgure 5: the cost functon for the optmum response(rule base) n each generaton As t can be seen t has a small steady state error, whch s because of the format of the cost functon. As can be seen n these fgures the step response of the system has small overshoot when the error s bg and the controller can control the pendulum wth a very small overshoot whle the error s small. Also the system has a small settlng tme. error NL NS Z PS PL error-dot NL NL NM NS NS - NS NM NS - - PS Z NM PM PS NS - - PS PM PL - PS PS PM PL Table : optmum rule base Fgure 6: step response for ntal state [error, error-dot]= [0.2, 0.05] 6 IMPLEMENTING THE RESULTS ON THE SYSTEM The optmum fuzzy controller explaned n the prevous part s appled to the nverse pendulum n ths secton n real tme mode. The results usng Smulnk Toolbox of MATLAB software for some ntal condtons are shown n fgure 6 and fgure7.
6 Usng Genetc Algorthms, Dept. of computer scence and AI, Unversty of Granada, Techncal Report, #DECSAI-9508, February,995. Fgure 7: step response for ntal state 2 [error, error-dot]= [0.5, 0.05] 7 CONCLUSION In ths paper a fuzzy controller s desgned for the system of the nverse pendulum system. To optmze the fuzzy controller we used Genetc Algorthm. In ths method not only the rules, but also the number of rules s optmzed. The results showed small overshoot and also small settlng tme whch ndcates the good performance of the desgned system. The Genetc Algorthm succeeded to fnd the desred chromosome n 90th generaton between 7525 chromosomes (after searchng 2750 chromosomes) that shows the power of genetc algorthm. 8 REFERENCES [] A.Fateh, C.Lucas, Optmzaton of the Rule Base and Parameters of a Fuzzy Logc Controller by Genetc Algorthms, Proc.Int.Conf Applcaton of Fuzzy systems (ICAFS), Tabrz, Iran, pp , 994. [2] O.Cordon, F.Herrera, M.Lozano, Genetc Algorthms and Fuzzy Logc n Control Processors, Unversty of Granada, Techncal Report #DECSAI-9807, July, 998. [3] R.Schleffer, H.J.Sebastan, E.K.Antonsson, Genetc Algorthms n Fuzzy Engneerng Desgn, 999 ASME Desgn Engneerng Techncal Conferences, Las Vegas, Nevada, USA. [4] O.Cordon, F.Herrera, F.Gomde, F.Hoffmann, L.Magdalena, Ten Years of Genetc Fuzzy Systems: Current Framework and New Trends, Unversdad de Granada. [5] F.Herrera, M.Lozano, J.L.Verdegay, A Learnng Process for Fuzzy Control Rules
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 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 informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationThe Chaotic Robot Prediction by Neuro Fuzzy Algorithm (2) = θ (3) = ω. Asin. A v. Mana Tarjoman, Shaghayegh Zarei
The Chaotc Robot Predcton by Neuro Fuzzy Algorthm Mana Tarjoman, Shaghayegh Zare Abstract In ths paper an applcaton of the adaptve neurofuzzy nference system has been ntroduced to predct the behavor of
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 informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationCOMPARISON 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 informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationOutline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1]
DYNAMIC SHORTEST PATH SEARCH AND SYNCHRONIZED TASK SWITCHING Jay Wagenpfel, Adran Trachte 2 Outlne Shortest Communcaton Path Searchng Bellmann Ford algorthm Algorthm for dynamc case Modfcatons to our algorthm
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 informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationA PROCEDURE FOR SIMULATING THE NONLINEAR CONDUCTION HEAT TRANSFER IN A BODY WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY.
Proceedngs of the th Brazlan Congress of Thermal Scences and Engneerng -- ENCIT 006 Braz. Soc. of Mechancal Scences and Engneerng -- ABCM, Curtba, Brazl,- Dec. 5-8, 006 A PROCEDURE FOR SIMULATING THE NONLINEAR
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 informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationCIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M
CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute
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 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 informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationChapter - 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 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 informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
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 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 informationPhysics 207: Lecture 20. Today s Agenda Homework for Monday
Physcs 207: Lecture 20 Today s Agenda Homework for Monday Recap: Systems of Partcles Center of mass Velocty and acceleraton of the center of mass Dynamcs of the center of mass Lnear Momentum Example problems
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationMultilayer Perceptron (MLP)
Multlayer Perceptron (MLP) Seungjn Cho Department of Computer Scence and Engneerng Pohang Unversty of Scence and Technology 77 Cheongam-ro, Nam-gu, Pohang 37673, Korea seungjn@postech.ac.kr 1 / 20 Outlne
More informationFuzzy Boundaries of Sample Selection Model
Proceedngs of the 9th WSES Internatonal Conference on ppled Mathematcs, Istanbul, Turkey, May 7-9, 006 (pp309-34) Fuzzy Boundares of Sample Selecton Model L. MUHMD SFIIH, NTON BDULBSH KMIL, M. T. BU OSMN
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 informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationA Fast Computer Aided Design Method for Filters
2017 Asa-Pacfc Engneerng and Technology Conference (APETC 2017) ISBN: 978-1-60595-443-1 A Fast Computer Aded Desgn Method for Flters Gang L ABSTRACT *Ths paper presents a fast computer aded desgn method
More informationAP Physics 1 & 2 Summer Assignment
AP Physcs 1 & 2 Summer Assgnment AP Physcs 1 requres an exceptonal profcency n algebra, trgonometry, and geometry. It was desgned by a select group of college professors and hgh school scence teachers
More informationUsing Immune Genetic Algorithm to Optimize BP Neural Network and Its Application Peng-fei LIU1,Qun-tai SHEN1 and Jun ZHI2,*
Advances n Computer Scence Research (ACRS), volume 54 Internatonal Conference on Computer Networks and Communcaton Technology (CNCT206) Usng Immune Genetc Algorthm to Optmze BP Neural Network and Its Applcaton
More informationFirst Law: A body at rest remains at rest, a body in motion continues to move at constant velocity, unless acted upon by an external force.
Secton 1. Dynamcs (Newton s Laws of Moton) Two approaches: 1) Gven all the forces actng on a body, predct the subsequent (changes n) moton. 2) Gven the (changes n) moton of a body, nfer what forces act
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More informationWeek3, 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 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 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 informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationarxiv:quant-ph/ Jul 2002
Lnear optcs mplementaton of general two-photon proectve measurement Andrze Grudka* and Anton Wóck** Faculty of Physcs, Adam Mckewcz Unversty, arxv:quant-ph/ 9 Jul PXOWRZVNDR]QDRODQG Abstract We wll present
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 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 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 informationNormally, in one phase reservoir simulation we would deal with one of the following fluid systems:
TPG4160 Reservor Smulaton 2017 page 1 of 9 ONE-DIMENSIONAL, ONE-PHASE RESERVOIR SIMULATION Flud systems The term sngle phase apples to any system wth only one phase present n the reservor In some cases
More informationPhysics 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 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 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 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 informationNote 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 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 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 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 informationThe Synchronous 8th-Order Differential Attack on 12 Rounds of the Block Cipher HyRAL
The Synchronous 8th-Order Dfferental Attack on 12 Rounds of the Block Cpher HyRAL Yasutaka Igarash, Sej Fukushma, and Tomohro Hachno Kagoshma Unversty, Kagoshma, Japan Emal: {garash, fukushma, hachno}@eee.kagoshma-u.ac.jp
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 informationNON-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 informationDETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM
Ganj, Z. Z., et al.: Determnaton of Temperature Dstrbuton for S111 DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM by Davood Domr GANJI
More informationA Particle Filter Algorithm based on Mixing of Prior probability density and UKF as Generate Importance Function
Advanced Scence and Technology Letters, pp.83-87 http://dx.do.org/10.14257/astl.2014.53.20 A Partcle Flter Algorthm based on Mxng of Pror probablty densty and UKF as Generate Importance Functon Lu Lu 1,1,
More informationSuggested solutions for the exam in SF2863 Systems Engineering. June 12,
Suggested solutons for the exam n SF2863 Systems Engneerng. June 12, 2012 14.00 19.00 Examner: Per Enqvst, phone: 790 62 98 1. We can thnk of the farm as a Jackson network. The strawberry feld s modelled
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 informationGlobal Sensitivity. Tuesday 20 th February, 2018
Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values
More informationThe Expectation-Maximization Algorithm
The Expectaton-Maxmaton Algorthm Charles Elan elan@cs.ucsd.edu November 16, 2007 Ths chapter explans the EM algorthm at multple levels of generalty. Secton 1 gves the standard hgh-level verson of the algorthm.
More informationGravitational Acceleration: A case of constant acceleration (approx. 2 hr.) (6/7/11)
Gravtatonal Acceleraton: A case of constant acceleraton (approx. hr.) (6/7/11) Introducton The gravtatonal force s one of the fundamental forces of nature. Under the nfluence of ths force all objects havng
More informationMathematical Preparations
1 Introducton Mathematcal Preparatons The theory of relatvty was developed to explan experments whch studed the propagaton of electromagnetc radaton n movng coordnate systems. Wthn expermental error the
More informationMarkov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement
Markov Chan Monte Carlo MCMC, Gbbs Samplng, Metropols Algorthms, and Smulated Annealng 2001 Bonformatcs Course Supplement SNU Bontellgence Lab http://bsnuackr/ Outlne! Markov Chan Monte Carlo MCMC! Metropols-Hastngs
More informationSolving of Single-objective Problems based on a Modified Multiple-crossover Genetic Algorithm: Test Function Study
Internatonal Conference on Systems, Sgnal Processng and Electroncs Engneerng (ICSSEE'0 December 6-7, 0 Duba (UAE Solvng of Sngle-objectve Problems based on a Modfed Multple-crossover Genetc Algorthm: Test
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationAnnexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances
ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton
More informationPulse Coded Modulation
Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More information1 Convex Optimization
Convex Optmzaton We wll consder convex optmzaton problems. Namely, mnmzaton problems where the objectve s convex (we assume no constrants for now). Such problems often arse n machne learnng. For example,
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationLOW 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 informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More informationMultilayer Perceptrons and Backpropagation. Perceptrons. Recap: Perceptrons. Informatics 1 CG: Lecture 6. Mirella Lapata
Multlayer Perceptrons and Informatcs CG: Lecture 6 Mrella Lapata School of Informatcs Unversty of Ednburgh mlap@nf.ed.ac.uk Readng: Kevn Gurney s Introducton to Neural Networks, Chapters 5 6.5 January,
More information3.1 ML and Empirical Distribution
67577 Intro. to Machne Learnng Fall semester, 2008/9 Lecture 3: Maxmum Lkelhood/ Maxmum Entropy Dualty Lecturer: Amnon Shashua Scrbe: Amnon Shashua 1 In the prevous lecture we defned the prncple of Maxmum
More informationLecture 20: Noether s Theorem
Lecture 20: Noether s Theorem In our revew of Newtonan Mechancs, we were remnded that some quanttes (energy, lnear momentum, and angular momentum) are conserved That s, they are constant f no external
More informationQuadratic speedup for unstructured search - Grover s Al-
Quadratc speedup for unstructured search - Grover s Al- CS 94- gorthm /8/07 Sprng 007 Lecture 11 001 Unstructured Search Here s the problem: You are gven a boolean functon f : {1,,} {0,1}, and are promsed
More informationApplied Mathematics Letters
Appled Matheatcs Letters 2 (2) 46 5 Contents lsts avalable at ScenceDrect Appled Matheatcs Letters journal hoepage: wwwelseverco/locate/al Calculaton of coeffcents of a cardnal B-splne Gradr V Mlovanovć
More informationPhysics 181. Particle Systems
Physcs 181 Partcle Systems Overvew In these notes we dscuss the varables approprate to the descrpton of systems of partcles, ther defntons, ther relatons, and ther conservatons laws. We consder a system
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 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 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 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 informationClock-Gating and Its Application to Low Power Design of Sequential Circuits
Clock-Gatng and Its Applcaton to Low Power Desgn of Sequental Crcuts ng WU Department of Electrcal Engneerng-Systems, Unversty of Southern Calforna Los Angeles, CA 989, USA, Phone: (23)74-448 Massoud PEDRAM
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationDetermining Transmission Losses Penalty Factor Using Adaptive Neuro Fuzzy Inference System (ANFIS) For Economic Dispatch Application
7 Determnng Transmsson Losses Penalty Factor Usng Adaptve Neuro Fuzzy Inference System (ANFIS) For Economc Dspatch Applcaton Rony Seto Wbowo Maurdh Hery Purnomo Dod Prastanto Electrcal Engneerng Department,
More informationA particle in a state of uniform motion remain in that state of motion unless acted upon by external force.
The fundamental prncples of classcal mechancs were lad down by Galleo and Newton n the 16th and 17th centures. In 1686, Newton wrote the Prncpa where he gave us three laws of moton, one law of gravty,
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationMean Field / Variational Approximations
Mean Feld / Varatonal Appromatons resented by Jose Nuñez 0/24/05 Outlne Introducton Mean Feld Appromaton Structured Mean Feld Weghted Mean Feld Varatonal Methods Introducton roblem: We have dstrbuton but
More informationThin-Walled Structures Group
Thn-Walled Structures Group JOHNS HOPKINS UNIVERSITY RESEARCH REPORT Towards optmzaton of CFS beam-column ndustry sectons TWG-RR02-12 Y. Shfferaw July 2012 1 Ths report was prepared ndependently, but was
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
More informationNewton s Method for One - Dimensional Optimization - Theory
Numercal Methods Newton s Method for One - Dmensonal Optmzaton - Theory For more detals on ths topc Go to Clck on Keyword Clck on Newton s Method for One- Dmensonal Optmzaton You are free to Share to copy,
More information= 1.23 m/s 2 [W] Required: t. Solution:!t = = 17 m/s [W]! m/s [W] (two extra digits carried) = 2.1 m/s [W]
Secton 1.3: Acceleraton Tutoral 1 Practce, page 24 1. Gven: 0 m/s; 15.0 m/s [S]; t 12.5 s Requred: Analyss: a av v t v f v t a v av f v t 15.0 m/s [S] 0 m/s 12.5 s 15.0 m/s [S] 12.5 s 1.20 m/s 2 [S] Statement:
More informationTHE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY. William A. Pearlman. References: S. Arimoto - IEEE Trans. Inform. Thy., Jan.
THE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY Wllam A. Pearlman 2002 References: S. Armoto - IEEE Trans. Inform. Thy., Jan. 1972 R. Blahut - IEEE Trans. Inform. Thy., July 1972 Recall
More informationCHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION
CAPTER- INFORMATION MEASURE OF FUZZY MATRI AN FUZZY BINARY RELATION Introducton The basc concept of the fuzz matr theor s ver smple and can be appled to socal and natural stuatons A branch of fuzz matr
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 informationLinear Feature Engineering 11
Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19
More informationAPPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14
APPROXIMAE PRICES OF BASKE AND ASIAN OPIONS DUPON OLIVIER Prema 14 Contents Introducton 1 1. Framewor 1 1.1. Baset optons 1.. Asan optons. Computng the prce 3. Lower bound 3.1. Closed formula for the prce
More informationLecture 4: Universal Hash Functions/Streaming Cont d
CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected
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 informationDO NOT DO HOMEWORK UNTIL IT IS ASSIGNED. THE ASSIGNMENTS MAY CHANGE UNTIL ANNOUNCED.
EE 539 Homeworks Sprng 08 Updated: Tuesday, Aprl 7, 08 DO NOT DO HOMEWORK UNTIL IT IS ASSIGNED. THE ASSIGNMENTS MAY CHANGE UNTIL ANNOUNCED. For full credt, show all work. Some problems requre hand calculatons.
More information