7 OPTIMAL CONTROL 7.1 EXERCISE 1. Solve the following optimal control problem. max. (x u 2 )dt x = u x(0) = Solution with the first variation
|
|
- Beatrice Stevens
- 5 years ago
- Views:
Transcription
1 7 OPTIMAL CONTROL 7. EXERCISE Solve the following optimal control problem max 7.. Solution with the first variation The Lagrangian is L(x, u, λ, μ) = (x u )dt x = u x() =. [(x u ) λ(x u)]dt μ(x() ). Now perform the first variation δl(x, u, λ, μ) = d L(x + αδ dα x,u+ αδ u,λ+ αδ λ,μ+ αδ μ ) α= Making the substitution yields d δl = lim [x + αδ x (u + αδ u ) (λ + αδ λ )(x + αδ x u αδ u )]dt α dα (μ + αδ μ )(x() + αδ x() ) After differentiation one has δl = lim α And collecting terms [δ x (u + αδ u )δ u δ λ (x + αδ x u αδ u ) (λ + αδ λ )(δ x δ u )]dt δμ(x() + αδ x() ) (μ + αδ μ )δ x() = [δ x uδ u δ λ (x u) λ(δ x δ u )]dt δ μ (x() ) μδ x() 97
2 98 OPTIMAL CONTROL One can derive directly this last passage skipping the above calculations if performs the differentiation of each variable. Now there is the problem to express the variation δ x in terms of the other variations. To see that consider the term involving δ x, that is λδ x.if one differentiates λδ x with respect to t has d dt [λδ x]=λ δ x + λδ x = λδ x = d dt [λδ x] λ δ x. Using this relation in the above expression gives δl = [δ x uδ u δ λ (x u) d dt (λδ x)+λ δ x + λδ u ]dt δ μ (x() ) μδ x(). Now collecting the variations in order to use the du Bois-Reymond theorem leads to δl = [δ x ( + λ )+δ u ( u + λ)+δ λ (u x )]dt λ()δ x() +(λ() μ)δ x() δμ(x() ) This leads to this system of ordinary differential equations, +λ = λ() = u + λ = λ() μ = u x = x() = From the first differential equation one has λ = t + c, then using the initial condition λ() = yields λ() = +c = = c =. So the multiplier is λ(t) = t +. From the multiplier one can resolve the optimal control u(t), in facts from the second differential equation u + λ = = u(t) = λ(t) = t+. Finally one can reconstruct the state variable x(t). From the first differential equation x = t+ = x(t) = 4 t + t + c. Now from the initial condition on x(t) one has x() = c =. In general, to prove the fact that this control maximizes the integral is a difficult task, therefore it is better to rely on special theorems. 7. EXERCISE Solve the following optimal control problem (OCP). J = u(t) x(t) dt with x (t) = u(t) x() =, x() =.
3 7. EXERCISE Solution with variations calculus To solve the problem, one can use calculus of variation in order to find a maximum of the functional J, so J =max J =max The Lagrangian function is given by L(x, u, λ, μ,μ )= Now perforg the first variation of L yields δl = u(t) +x(t) dt. u +x λ(x +u) dt μ (x() ) μ (x() ) uδ u +δ x λ(δ x +δ u ) δ λ (x +u) dt μ δ x() δ μ (x() ) μ δ x() δ μ (x() ). To simplify the variation δ x it is enough to derive λδ x, (λδ x ) = λ δ x + λδ x = λδ x =(λδ x ) λ δ x, so the previous expression becomes δl = uδ u +δ x + λ δ x λδ u δ λ (x +u) dt λ()δ x() + λ()δ x() μ δ x() δ μ (x() ) μ δ x() δ μ (x() ). Collecting the expression of each variation gives the associated boundary value problem. δ u : u λ δ x : +λ δ λ : x +u δ x() : λ() μ δ x() : λ() μ δ μ : x() δ μ : x() From the variation δ x one can solve the multiplier λ, in facts λ = = λ(t) = t + c c R. From variation δ u one can solve the optimal control u, u λ = u ( t + c) = = u =t c. From the differential equation given by the variation of the multiplier λ x = u = x = t + c = x(t) = t +(c +)t + d d R.
4 OPTIMAL CONTROL Now the constants c, d can be evaluated using the boundary condition x() = and x() =. x() = d = = d = x() = 4+c ++= = c =. In conclusion the optimal control is u(t) =t and the associated trajectory or status is x(t) = t + 3 t +. The extremal value of the functional is therefore ( max u(t) +x(t) dt = t + ( t ) + 3 ) t + dt = 6t +5t +7/4 dt = t t t = 5. If one tries another function that satisfies the required constraints, for example x(t) = (t )(t ) and the associated control u(t) =t 5, that the functional J gives < It can be showed, for example using the Hamiltonian function or with the second variation, that it is a maximum point, so for the original problem it will be a imum. 7.3 EXERCISE 3 Solve the following OCP, x u dt x =x + u x() = Solution with the Hamiltonian The OCP has a quadratic control, so we can apply the Hamiltonian to solve it, H = x u + λ(x + u). The equation for the control is H/ u = u + λ =which implies u = λ/. The adjoint equation is λ =(x λ), thus we have to solve a system of two differential equations. The boundary conditions for this system are x() = and λ() =. To H u = <
5 7.4 EXERCISE 4 solve the system there are various techniques as the Laplace transform or differential equations methods, we choose the latter. Differentiating the adjoint equation yields, λ =(x λ )=(x + u x +λ) =(λ + u) =4λ +u =4λ + λ =5λ. This is a second order differential equation which has boundary conditions given by λ() = and λ () = 5λ() =. Its general solution is λ(t) =c e 5t + c e 5t, substituting the boundary conditions gives c = c =therefore λ(t) =. This implies u(t) =and the differential equation for the state x becomes x =x. The last equation solves in x(t) =ke t with x() = k =, that is x(t) =e t. Let us check if the candidate solution u(t) =is a imum, looking at the H/ u = <, shows that u(t) =can not be a imum, so this problem does not have solution. 7.4 EXERCISE 4 Solve the following OCP, /3 u +x dt x =u + x x() = Solution with the Hamiltonian The OCP has a quadratic control, so we can apply the Hamiltonian to solve it, H = u +x + λ(u + x). The equation for the control is H/ u =u +λ =which implies u = λ. The adjoint equation is λ = 4x λ, thus we have to solve a system of two differential equations. The boundary conditions for this system are x() = and λ(/3) =. Differentiating the adjoint equation yields, λ = 4x λ = 4(u + x) λ = 8u 4x +4x + λ = 8u + λ =9λ. This is a second order differential equation which has boundary conditions given by λ(/3) = and λ (/3) = 9λ(/3) =. Its general solution is λ(t) =c + c e 5t, substituting the boundary conditions gives c = c =therefore λ(t) =. This implies u(t) =and the differential equation for the state x becomes x =x. The last equation solves in x(t) =ke t with x() = k =, that is x(t) =e t. Let us check if the candidate solution u(t) =is a imum, looking at the H/ u = <, shows that u(t) =can not be a imum, so this problem does not have solution.
6 OPTIMAL CONTROL 7.5 EXERCISE 5 x dt x = u x() =, x() =, u Solution with the Hamiltonian t t 6 x(t) =, λ(t) =t 6, u(t) =. t + 6<t H = x + λu. The adjoint equation is λ = H/ x =, which implies that λ(t) =t + c for an unknown constant c. From the Pontryagin maximum principle u = arg λu = signλ. Hence t + c< u =? t + c = t + c>. The problem can have one or zero switching points, depending on the value of c. If c then λ(t) < on the whole [, ] and there are not switching points, thus x(t) =t + k for a constant k to be detered from the boundary conditions. It is clear that a single line x(t) =t + k can not match x() = and x() =, therefore this case does not occur. The same conclusion holds for the case c because x(t) = t + k can not meet the boundary conditions. If there is a switching point, it occurs when λ(t )=t + c =, that is if t = c. This is possible if and only if c (, ), so in the first segment λ <, u = and x(t) = t + k for t =[, c]. Substituting the left boundary condition x(t) =t. In the second segment for t [ c, ] we have u = because λ>, thus x(t) = t + k and the right boundary condition yields k =. From the fact that x(t) is a continuous function, the two segments have to join for t = t = c, i.e. c = c +which gives c = EXERCISE 6 4 u +u x dt x = x + u x() =, u 3.
7 7.7 EXERCISE Solution with the Hamiltonian ( e 4 x(t) = 4 ) e t e4 4 e t + 3, λ(t) = e4 e t, u(t) = 3+e4 e t. The adjoint equation is λ H = u +u x + λ(x + u) = H/ x = λ with λ(4) =, which implies that λ(t) =+c e t for an unknown constant c. Imposing the boundary condition gives c = e 4, thus λ(t) = e 4 e t. The control is quadratic in the Hamiltonian and it can be solved by H/ u =u ++λ =, that implies u = λ = +e4 e t = 3+e4 e t > 3. We have to solve now the differential equation for the state x, x = x + u. Wedoit applying the Laplace transform. sx x() = X + e4 s + 3 s (s )X =+e4 s + 3 s. Dividing for the LHS and perforg partial fraction decomposition we have X = s + e4 s 3 = s + e4 = s 3 s(s ) ( s s s + e4 s + 3 s. The solution is obtained by the inverse Laplace transform and is x(t) = et + e4 sinh t + 3 ( e 4 = 4 ) e t e4 4 e t + 3. ) 7.7 EXERCISE 7 x() + x u dt x =+u x() =.
8 4 OPTIMAL CONTROL 7.7. Solution with the Hamiltonian x(t) =t + 4(3 t) +, λ(t) = t +3, u(t) = (3 t). H = x u + λ( + u ) The adjoint equation is λ = H/ x = with λ() =, which implies that λ(t) = t + c for an unknown constant c. From the final condition we have that c =3and λ(t) = t +3. The control is quadratic in the Hamiltonian and it can be solved by H/ u = + λu =, that implies u(t) = λ(t) = (3 t). The differential equation for the state is x =+u which yields to x (t) =+ 4(3 t) = x(t) =t t + k for a constant k that can be retrieved by the initial condition x() =, i.e. x() = + + k = = k =. 7.8 EXERCISE 8 3x +u dt x = e u + t 3 x() = e, u Solution with the Hamiltonian x(t) = 4 t4 + e t, 4 λ(t) = 3t +6, u(t) =. H =3x +u + λ(e u + t 3 ). The adjoint equation is λ = H/ x = 3 with λ() =, which implies that λ(t) = 3t + c for an unknown constant c. From the final condition we have that c =6and λ(t) = 3t +6. The control is not linear in the Hamiltonian and it can be solved by H/ u = λe u =, that implies ( ) 3t +6 λ = e u u =ln ln λ = u(t) = ln( 3t +6) ln = ln,
9 7.9 EXERCISE 9 5 but this control violates the constraint u 3, in facts it results u<, therefore u(t) =. The differential equation for the state is x = e + t 3 which yields to x(t) = 4 t4 + e t + k = x() = e = 4 + e + k = k = EXERCISE 9 xe t dt x = et u + x x() =, u Solution with the Hamiltonian (t )et x(t) =, λ(t) =e t e 4 e t, u(t) =. ( ) e H = xe t t + λ u(t) + x. The adjoint equation is λ = H/ x =e t λ with λ() =, which implies that λ(t) =c e t + c e t for an unknown constant c,c. From the condition λ() = we have that c =and c = e 4 (in facts λ + λ =c e t =e t ), hence λ(t) =e t e 4 e t. The control can be solved by Pontryagin theorem and gives λe t u = et e 4 u for t [, ] and u>, therefore it violates the constraint and thus u =. The differential equation for the state yields to x(t) = (t )et.
CHAPTER 3 THE MAXIMUM PRINCIPLE: MIXED INEQUALITY CONSTRAINTS. p. 1/73
CHAPTER 3 THE MAXIMUM PRINCIPLE: MIXED INEQUALITY CONSTRAINTS p. 1/73 THE MAXIMUM PRINCIPLE: MIXED INEQUALITY CONSTRAINTS Mixed Inequality Constraints: Inequality constraints involving control and possibly
More informationENGIN 211, Engineering Math. Laplace Transforms
ENGIN 211, Engineering Math Laplace Transforms 1 Why Laplace Transform? Laplace transform converts a function in the time domain to its frequency domain. It is a powerful, systematic method in solving
More informationChapter 5. Pontryagin s Minimum Principle (Constrained OCP)
Chapter 5 Pontryagin s Minimum Principle (Constrained OCP) 1 Pontryagin s Minimum Principle Plant: (5-1) u () t U PI: (5-2) Boundary condition: The goal is to find Optimal Control. 2 Pontryagin s Minimum
More informationCHAPTER 7 APPLICATIONS TO MARKETING. Chapter 7 p. 1/53
CHAPTER 7 APPLICATIONS TO MARKETING Chapter 7 p. 1/53 APPLICATIONS TO MARKETING State Equation: Rate of sales expressed in terms of advertising, which is a control variable Objective: Profit maximization
More informationMATH 2250 Final Exam Solutions
MATH 225 Final Exam Solutions Tuesday, April 29, 28, 6: 8:PM Write your name and ID number at the top of this page. Show all your work. You may refer to one double-sided sheet of notes during the exam
More informationz 2 = 1 4 (x 2) + 1 (y 6)
MA 5 Fall 007 Exam # Review Solutions. Consider the function fx, y y x. a Sketch the domain of f. For the domain, need y x 0, i.e., y x. - - - 0 0 - - - b Sketch the level curves fx, y k for k 0,,,. The
More informationCHAPTER 2 THE MAXIMUM PRINCIPLE: CONTINUOUS TIME. Chapter2 p. 1/67
CHAPTER 2 THE MAXIMUM PRINCIPLE: CONTINUOUS TIME Chapter2 p. 1/67 THE MAXIMUM PRINCIPLE: CONTINUOUS TIME Main Purpose: Introduce the maximum principle as a necessary condition to be satisfied by any optimal
More informationMathematical Economics. Lecture Notes (in extracts)
Prof. Dr. Frank Werner Faculty of Mathematics Institute of Mathematical Optimization (IMO) http://math.uni-magdeburg.de/ werner/math-ec-new.html Mathematical Economics Lecture Notes (in extracts) Winter
More informationMath 234 Final Exam (with answers) Spring 2017
Math 234 Final Exam (with answers) pring 217 1. onsider the points A = (1, 2, 3), B = (1, 2, 2), and = (2, 1, 4). (a) [6 points] Find the area of the triangle formed by A, B, and. olution: One way to solve
More informationOptimal Control Theory
Optimal Control Theory The theory Optimal control theory is a mature mathematical discipline which provides algorithms to solve various control problems The elaborate mathematical machinery behind optimal
More informationDeterministic Dynamic Programming
Deterministic Dynamic Programming 1 Value Function Consider the following optimal control problem in Mayer s form: V (t 0, x 0 ) = inf u U J(t 1, x(t 1 )) (1) subject to ẋ(t) = f(t, x(t), u(t)), x(t 0
More informationCHAPTER 9 MAINTENANCE AND REPLACEMENT. Chapter9 p. 1/66
CHAPTER 9 MAINTENANCE AND REPLACEMENT Chapter9 p. 1/66 MAINTENANCE AND REPLACEMENT The problem of determining the lifetime of an asset or an activity simultaneously with its management during that lifetime
More informationOrdinary Differential Equations (ODEs)
Chapter 13 Ordinary Differential Equations (ODEs) We briefly review how to solve some of the most standard ODEs. 13.1 First Order Equations 13.1.1 Separable Equations A first-order ordinary differential
More informationMinimum Fuel Optimal Control Example For A Scalar System
Minimum Fuel Optimal Control Example For A Scalar System A. Problem Statement This example illustrates the minimum fuel optimal control problem for a particular first-order (scalar) system. The derivation
More informationNumerical Optimal Control Overview. Moritz Diehl
Numerical Optimal Control Overview Moritz Diehl Simplified Optimal Control Problem in ODE path constraints h(x, u) 0 initial value x0 states x(t) terminal constraint r(x(t )) 0 controls u(t) 0 t T minimize
More informationTutorial on Control and State Constrained Optimal Control Pro. Control Problems and Applications Part 3 : Pure State Constraints
Tutorial on Control and State Constrained Optimal Control Problems and Applications Part 3 : Pure State Constraints University of Münster Institute of Computational and Applied Mathematics SADCO Summer
More informationIEOR 6711, HMWK 5, Professor Sigman
IEOR 6711, HMWK 5, Professor Sigman 1. Semi-Markov processes: Consider an irreducible positive recurrent discrete-time Markov chain {X n } with transition matrix P (P i,j ), i, j S, and finite state space.
More informationTHE UNIVERSITY OF WESTERN ONTARIO. Applied Mathematics 375a Instructor: Matt Davison. Final Examination December 14, :00 12:00 a.m.
THE UNIVERSITY OF WESTERN ONTARIO London Ontario Applied Mathematics 375a Instructor: Matt Davison Final Examination December 4, 22 9: 2: a.m. 3 HOURS Name: Stu. #: Notes: ) There are 8 question worth
More informationPontryagin s Minimum Principle 1
ECE 680 Fall 2013 Pontryagin s Minimum Principle 1 In this handout, we provide a derivation of the minimum principle of Pontryagin, which is a generalization of the Euler-Lagrange equations that also includes
More informationFinal Exam January 26th, Dynamic Programming & Optimal Control ( ) Solutions. Number of Problems: 4. No calculators allowed.
Final Exam January 26th, 2017 Dynamic Programming & Optimal Control (151-0563-01) Prof. R. D Andrea Solutions Exam Duration: 150 minutes Number of Problems: 4 Permitted aids: One A4 sheet of paper. No
More informationStat 475 Life Contingencies I. Chapter 2: Survival models
Stat 475 Life Contingencies I Chapter 2: Survival models The future lifetime random variable Notation We are interested in analyzing and describing the future lifetime of an individual. We use (x) to denote
More information20.3. Further Laplace Transforms. Introduction. Prerequisites. Learning Outcomes
Further Laplace Transforms 2.3 Introduction In this Section we introduce the second shift theorem which simplifies the determination of Laplace and inverse Laplace transforms in some complicated cases.
More informationOptimal Control of Differential Equations with Pure State Constraints
University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange Masters Theses Graduate School 8-2013 Optimal Control of Differential Equations with Pure State Constraints Steven Lee
More informationProblem Set 8
Eli H. Ross eross@mit.edu Alberto De Sole November, 8.5 Problem Set 8 Exercise 36 Let X t and Y t be two independent Poisson processes with rate parameters λ and µ respectively, measuring the number of
More informationStructured Markov Chains
Structured Markov Chains Ivo Adan and Johan van Leeuwaarden Where innovation starts Book on Analysis of structured Markov processes (arxiv:1709.09060) I Basic methods Basic Markov processes Advanced Markov
More informationProblem 1 Cost of an Infinite Horizon LQR
THE UNIVERSITY OF TEXAS AT SAN ANTONIO EE 5243 INTRODUCTION TO CYBER-PHYSICAL SYSTEMS H O M E W O R K # 5 Ahmad F. Taha October 12, 215 Homework Instructions: 1. Type your solutions in the LATEX homework
More informationExercises with solutions (Set D)
Exercises with solutions Set D. A fair die is rolled at the same time as a fair coin is tossed. Let A be the number on the upper surface of the die and let B describe the outcome of the coin toss, where
More informationTutorial on Control and State Constrained Optimal Control Problems
Tutorial on Control and State Constrained Optimal Control Problems To cite this version:. blems. SADCO Summer School 211 - Optimal Control, Sep 211, London, United Kingdom. HAL Id: inria-629518
More informationIntroduction to Continuous-Time Dynamic Optimization: Optimal Control Theory
Econ 85/Chatterjee Introduction to Continuous-ime Dynamic Optimization: Optimal Control heory 1 States and Controls he concept of a state in mathematical modeling typically refers to a specification of
More informationMechanical Systems II. Method of Lagrange Multipliers
Mechanical Systems II. Method of Lagrange Multipliers Rafael Wisniewski Aalborg University Abstract. So far our approach to classical mechanics was limited to finding a critical point of a certain functional.
More informationLinear Differential Equations. Problems
Chapter 1 Linear Differential Equations. Problems 1.1 Introduction 1.1.1 Show that the function ϕ : R R, given by the expression ϕ(t) = 2e 3t for all t R, is a solution of the Initial Value Problem x =
More informationDeterministic Optimal Control
page A1 Online Appendix A Deterministic Optimal Control As far as the laws of mathematics refer to reality, they are not certain; and as far as they are certain, they do not refer to reality. Albert Einstein
More informationSecond Order Sufficient Conditions for Optimal Control Problems with Non-unique Minimizers
2 American Control Conference Marriott Waterfront, Baltimore, MD, USA June 3-July 2, 2 WeA22. Second Order Sufficient Conditions for Optimal Control Problems with Non-unique Minimizers Christos Gavriel
More informationEssentials of optimal control theory in ECON 4140
Essentials of optimal control theory in ECON 4140 Things yo need to know (and a detail yo need not care abot). A few words abot dynamic optimization in general. Dynamic optimization can be thoght of as
More informationQuadratic Stability of Dynamical Systems. Raktim Bhattacharya Aerospace Engineering, Texas A&M University
.. Quadratic Stability of Dynamical Systems Raktim Bhattacharya Aerospace Engineering, Texas A&M University Quadratic Lyapunov Functions Quadratic Stability Dynamical system is quadratically stable if
More informationPh.D. Katarína Bellová Page 1 Mathematics 2 (10-PHY-BIPMA2) EXAM - Solutions, 20 July 2017, 10:00 12:00 All answers to be justified.
PhD Katarína Bellová Page 1 Mathematics 2 (10-PHY-BIPMA2 EXAM - Solutions, 20 July 2017, 10:00 12:00 All answers to be justified Problem 1 [ points]: For which parameters λ R does the following system
More information22.2. Applications of Eigenvalues and Eigenvectors. Introduction. Prerequisites. Learning Outcomes
Applications of Eigenvalues and Eigenvectors 22.2 Introduction Many applications of matrices in both engineering and science utilize eigenvalues and, sometimes, eigenvectors. Control theory, vibration
More informationOptimal Control Theory
Adv. Scientific Computing III Optimal Control Theory Catalin Trenchea Department of Mathematics University of Pittsburgh Fall 2008 Adv. Scientific Computing III > Control systems in Banach spaces Let X
More informationChapter 2 Optimal Control Problem
Chapter 2 Optimal Control Problem Optimal control of any process can be achieved either in open or closed loop. In the following two chapters we concentrate mainly on the first class. The first chapter
More informationConvex Analysis and Economic Theory AY Elementary properties of convex functions
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory AY 2018 2019 Topic 6: Convex functions I 6.1 Elementary properties of convex functions We may occasionally
More informationOPTIMAL CONTROL SYSTEMS
SYSTEMS MIN-MAX Harry G. Kwatny Department of Mechanical Engineering & Mechanics Drexel University OUTLINE MIN-MAX CONTROL Problem Definition HJB Equation Example GAME THEORY Differential Games Isaacs
More informationDeterministic Optimal Control
Online Appendix A Deterministic Optimal Control As far as the laws of mathematics refer to reality, they are not certain; and as far as they are certain, they do not refer to reality. Albert Einstein (1879
More informationCourse roadmap. ME451: Control Systems. Example of Laplace transform. Lecture 2 Laplace transform. Laplace transform
ME45: Control Systems Lecture 2 Prof. Jongeun Choi Department of Mechanical Engineering Michigan State University Modeling Transfer function Models for systems electrical mechanical electromechanical Block
More informationOptimization. Escuela de Ingeniería Informática de Oviedo. (Dpto. de Matemáticas-UniOvi) Numerical Computation Optimization 1 / 30
Optimization Escuela de Ingeniería Informática de Oviedo (Dpto. de Matemáticas-UniOvi) Numerical Computation Optimization 1 / 30 Unconstrained optimization Outline 1 Unconstrained optimization 2 Constrained
More informationMath 5311 Constrained Optimization Notes
ath 5311 Constrained Optimization otes February 5, 2009 1 Equality-constrained optimization Real-world optimization problems frequently have constraints on their variables. Constraints may be equality
More informationSTAT/MATH 395 A - PROBABILITY II UW Winter Quarter Moment functions. x r p X (x) (1) E[X r ] = x r f X (x) dx (2) (x E[X]) r p X (x) (3)
STAT/MATH 395 A - PROBABILITY II UW Winter Quarter 07 Néhémy Lim Moment functions Moments of a random variable Definition.. Let X be a rrv on probability space (Ω, A, P). For a given r N, E[X r ], if it
More informationOptimal Control of Drift-Free Invariant Control Systems on the Group of Motions of the Minkowski Plane
Optimal Control of Drift-Free Invariant Control Systems on the Group of Motions of the Minkowski Plane Dennis I. Barrett*, Rory Biggs and Claudiu C. Remsing Geometry and Geometric Control (GGC) Research
More informationLaplace Theory Examples
Laplace Theory Examples Harmonic oscillator s-differentiation Rule First shifting rule Trigonometric formulas Exponentials Hyperbolic functions s-differentiation Rule First Shifting Rule I and II Damped
More informationTonelli Full-Regularity in the Calculus of Variations and Optimal Control
Tonelli Full-Regularity in the Calculus of Variations and Optimal Control Delfim F. M. Torres delfim@mat.ua.pt Department of Mathematics University of Aveiro 3810 193 Aveiro, Portugal http://www.mat.ua.pt/delfim
More informationThe Laplace Transform. Background: Improper Integrals
The Laplace Transform Background: Improper Integrals Recall: Definite Integral: a, b real numbers, a b; f continuous on [a, b] b a f(x) dx 1 Improper integrals: Type I Infinite interval of integration
More informationDIFFERENTIAL EQUATIONS
DIFFERENTIAL EQUATIONS Chapter 1 Introduction and Basic Terminology Most of the phenomena studied in the sciences and engineering involve processes that change with time. For example, it is well known
More informationApplied Mathematics Masters Examination Fall 2016, August 18, 1 4 pm.
Applied Mathematics Masters Examination Fall 16, August 18, 1 4 pm. Each of the fifteen numbered questions is worth points. All questions will be graded, but your score for the examination will be the
More informationLagrangian Duality. Richard Lusby. Department of Management Engineering Technical University of Denmark
Lagrangian Duality Richard Lusby Department of Management Engineering Technical University of Denmark Today s Topics (jg Lagrange Multipliers Lagrangian Relaxation Lagrangian Duality R Lusby (42111) Lagrangian
More informationMath 201 Solutions to Assignment 1. 2ydy = x 2 dx. y = C 1 3 x3
Math 201 Solutions to Assignment 1 1. Solve the initial value problem: x 2 dx + 2y = 0, y(0) = 2. x 2 dx + 2y = 0, y(0) = 2 2y = x 2 dx y 2 = 1 3 x3 + C y = C 1 3 x3 Notice that y is not defined for some
More informationIYGB Mathematical Methods 1
IYGB Mathematical Methods Practice Paper A Time: 3 hours Candidates may use any non programmable, non graphical calculator which does not have the capability of storing data or manipulating algebraic expressions
More informationminimize x subject to (x 2)(x 4) u,
Math 6366/6367: Optimization and Variational Methods Sample Preliminary Exam Questions 1. Suppose that f : [, L] R is a C 2 -function with f () on (, L) and that you have explicit formulae for
More informationMath 162: Calculus IIA
Math 62: Calculus IIA Final Exam ANSWERS December 9, 26 Part A. (5 points) Evaluate the integral x 4 x 2 dx Substitute x 2 cos θ: x 8 cos dx θ ( 2 sin θ) dθ 4 x 2 2 sin θ 8 cos θ dθ 8 cos 2 θ cos θ dθ
More informationHomogeneous Linear Systems of Differential Equations with Constant Coefficients
Objective: Solve Homogeneous Linear Systems of Differential Equations with Constant Coefficients dx a x + a 2 x 2 + + a n x n, dx 2 a 2x + a 22 x 2 + + a 2n x n,. dx n = a n x + a n2 x 2 + + a nn x n.
More informationProblem set 3: Solutions Math 207B, Winter Suppose that u(x) is a non-zero solution of the eigenvalue problem. (u ) 2 dx, u 2 dx.
Problem set 3: Solutions Math 27B, Winter 216 1. Suppose that u(x) is a non-zero solution of the eigenvalue problem u = λu < x < 1, u() =, u(1) =. Show that λ = (u ) 2 dx u2 dx. Deduce that every eigenvalue
More informationElementary ODE Review
Elementary ODE Review First Order ODEs First Order Equations Ordinary differential equations of the fm y F(x, y) () are called first der dinary differential equations. There are a variety of techniques
More informationOptimization via the Hamilton-Jacobi-Bellman Method: Theory and Applications
Optimization via the Hamilton-Jacobi-Bellman Method: Theory and Applications Navin Khaneja lectre notes taken by Christiane Koch Jne 24, 29 1 Variation yields a classical Hamiltonian system Sppose that
More informationMATH1231 CALCULUS. Session II Dr John Roberts (based on notes of A./Prof. Bruce Henry) Red Center Room 3065
MATH1231 CALCULUS Session II 2007. Dr John Roberts (based on notes of A./Prof. Bruce Henry) Red Center Room 3065 Jag.Roberts@unsw.edu.au MATH1231 CALCULUS p.1/66 Overview Systematic Integration Techniques
More informationModule 6. be a sesquilinear form which is hermitian; that is, s(x, u) = s(u, x). Then s(x, u) + s(x, u) =
Module 6 Orthogonal and Orthonormal Basis Let X be a vector space over K, K = R or C We note that R C and the conjugation Let X X s K be a sesquilinear form which is hermitian; that is, s(x, u) = s(u,
More informationEx. 1. Find the general solution for each of the following differential equations:
MATH 261.007 Instr. K. Ciesielski Spring 2010 NAME (print): SAMPLE TEST # 2 Solve the following exercises. Show your work. (No credit will be given for an answer with no supporting work shown.) Ex. 1.
More informationdifferentiable functions in all arguments. Our aim is to minimize the quadratic objective functional (x T (t)qx(t)+u T (t)ru(t))dt, (2)
SOLVING NON-LINEAR QUADRATIC OPTIMAL... 49 differentiable functions in all arguments. Our aim is to minimize the quadratic objective functional J[x, u] = 1 2 tf t 0 (x T (t)qx(t)+u T (t)ru(t))dt, (2) subject
More informationECEN 605 LINEAR SYSTEMS. Lecture 7 Solution of State Equations 1/77
1/77 ECEN 605 LINEAR SYSTEMS Lecture 7 Solution of State Equations Solution of State Space Equations Recall from the previous Lecture note, for a system: ẋ(t) = A x(t) + B u(t) y(t) = C x(t) + D u(t),
More informationAlgorithms for constrained local optimization
Algorithms for constrained local optimization Fabio Schoen 2008 http://gol.dsi.unifi.it/users/schoen Algorithms for constrained local optimization p. Feasible direction methods Algorithms for constrained
More informationThe Laplace Transform. Background: Improper Integrals
The Laplace Transform Background: Improper Integrals Recall: Definite Integral: a, b real numbers, a b; f continuous on [a, b] b a f(x) dx 1 Improper integrals: Type I Infinite interval of integration
More informationMATH 412 Fourier Series and PDE- Spring 2010 SOLUTIONS to HOMEWORK 5
MATH 4 Fourier Series PDE- Spring SOLUTIONS to HOMEWORK 5 Problem (a: Solve the following Sturm-Liouville problem { (xu + λ x u = < x < e u( = u (e = (b: Show directly that the eigenfunctions are orthogonal
More informationNOTES ON CALCULUS OF VARIATIONS. September 13, 2012
NOTES ON CALCULUS OF VARIATIONS JON JOHNSEN September 13, 212 1. The basic problem In Calculus of Variations one is given a fixed C 2 -function F (t, x, u), where F is defined for t [, t 1 ] and x, u R,
More informationSolutions Chapter 9. u. (c) u(t) = 1 e t + c 2 e 3 t! c 1 e t 3c 2 e 3 t. (v) (a) u(t) = c 1 e t cos 3t + c 2 e t sin 3t. (b) du
Solutions hapter 9 dode 9 asic Solution Techniques 9 hoose one or more of the following differential equations, and then: (a) Solve the equation directly (b) Write down its phase plane equivalent, and
More informationGeneralization to inequality constrained problem. Maximize
Lecture 11. 26 September 2006 Review of Lecture #10: Second order optimality conditions necessary condition, sufficient condition. If the necessary condition is violated the point cannot be a local minimum
More informationOPTIMAL CONTROL. Sadegh Bolouki. Lecture slides for ECE 515. University of Illinois, Urbana-Champaign. Fall S. Bolouki (UIUC) 1 / 28
OPTIMAL CONTROL Sadegh Bolouki Lecture slides for ECE 515 University of Illinois, Urbana-Champaign Fall 2016 S. Bolouki (UIUC) 1 / 28 (Example from Optimal Control Theory, Kirk) Objective: To get from
More informationChapter 7: Techniques of Integration
Chapter 7: Techniques of Integration MATH 206-01: Calculus II Department of Mathematics University of Louisville last corrected September 14, 2013 1 / 43 Chapter 7: Techniques of Integration 7.1. Integration
More informationarxiv: v1 [q-fin.mf] 5 Jul 2016
arxiv:607.037v [q-fin.mf] 5 Jul 206 Dynamic optimization and its relation to classical and quantum constrained systems. Mauricio Contreras, Rely Pellicer and Marcelo Villena. July 6, 206 We study the structure
More informationDIFFERENTIAL EQUATIONS
DIFFERENTIAL EQUATIONS 1. Basic Terminology A differential equation is an equation that contains an unknown function together with one or more of its derivatives. 1 Examples: 1. y = 2x + cos x 2. dy dt
More informationSolutions to Math 53 Math 53 Practice Final
Solutions to Math 5 Math 5 Practice Final 20 points Consider the initial value problem y t 4yt = te t with y 0 = and y0 = 0 a 8 points Find the Laplace transform of the solution of this IVP b 8 points
More informationPhysics 351 Wednesday, February 14, 2018
Physics 351 Wednesday, February 14, 2018 HW4 due Friday. For HW help, Bill is in DRL 3N6 Wed 4 7pm. Grace is in DRL 2C2 Thu 5:30 8:30pm. Respond at pollev.com/phys351 or text PHYS351 to 37607 once to join,
More informationOptimal Control. Macroeconomics II SMU. Ömer Özak (SMU) Economic Growth Macroeconomics II 1 / 112
Optimal Control Ömer Özak SMU Macroeconomics II Ömer Özak (SMU) Economic Growth Macroeconomics II 1 / 112 Review of the Theory of Optimal Control Section 1 Review of the Theory of Optimal Control Ömer
More informationFourier transforms. c n e inπx. f (x) = Write same thing in an equivalent form, using n = 1, f (x) = l π
Fourier transforms We can imagine our periodic function having periodicity taken to the limits ± In this case, the function f (x) is not necessarily periodic, but we can still use Fourier transforms (related
More informationMañé s Conjecture from the control viewpoint
Mañé s Conjecture from the control viewpoint Université de Nice - Sophia Antipolis Setting Let M be a smooth compact manifold of dimension n 2 be fixed. Let H : T M R be a Hamiltonian of class C k, with
More informationOptimization using Calculus. Optimization of Functions of Multiple Variables subject to Equality Constraints
Optimization using Calculus Optimization of Functions of Multiple Variables subject to Equality Constraints 1 Objectives Optimization of functions of multiple variables subjected to equality constraints
More informationDIFFERENTIAL EQUATIONS
DIFFERENTIAL EQUATIONS Basic Terminology A differential equation is an equation that contains an unknown function together with one or more of its derivatives. 1 Examples: 1. y = 2x + cos x 2. dy dt =
More informationNumerical Methods for Constrained Optimal Control Problems
Numerical Methods for Constrained Optimal Control Problems Hartono Hartono A Thesis submitted for the degree of Doctor of Philosophy School of Mathematics and Statistics University of Western Australia
More information3. Identify and find the general solution of each of the following first order differential equations.
Final Exam MATH 33, Sample Questions. Fall 7. y = Cx 3 3 is the general solution of a differential equation. Find the equation. Answer: y = 3y + 9 xy. y = C x + C x is the general solution of a differential
More informationIntroduction to invariant and equivariant problems
Introduction to invariant and equivariant problems The curve completion problem Consider the curve completion problem, which is a subproblem of the much more complex inpainting problem. Suppose we are
More informationNon-Differentiable Embedding of Lagrangian structures
Non-Differentiable Embedding of Lagrangian structures Isabelle Greff Joint work with J. Cresson Université de Pau et des Pays de l Adour CNAM, Paris, April, 22nd 2010 Position of the problem 1. Example
More informationConstrained optimization.
ams/econ 11b supplementary notes ucsc Constrained optimization. c 2016, Yonatan Katznelson 1. Constraints In many of the optimization problems that arise in economics, there are restrictions on the values
More informationNonlinear Systems Theory
Nonlinear Systems Theory Matthew M. Peet Arizona State University Lecture 2: Nonlinear Systems Theory Overview Our next goal is to extend LMI s and optimization to nonlinear systems analysis. Today we
More informationTaylor series - Solutions
Taylor series - Solutions. f(x) sin(x) sin(0) + x cos(0) + x x ( sin(0)) +!! ( cos(0)) + + x4 x5 (sin(0)) + 4! 5! 0 + x + 0 x x! + x5 5! x! + 0 + x5 (cos(0)) + x6 6! ( sin(0)) + x 7 7! + x9 9! 5! + 0 +
More informationRESIDUE THEORY. dx, Topics to Review Laurent series and Laurent coefficients
Topics to Review Laurent series and Laurent coefficients from Section 4.5 are used to define residues in Section 5.. auchy s theorem for multiply connected regions Theorem 6, Section 3.4 is the basis for
More informationECE7850 Lecture 7. Discrete Time Optimal Control and Dynamic Programming
ECE7850 Lecture 7 Discrete Time Optimal Control and Dynamic Programming Discrete Time Optimal control Problems Short Introduction to Dynamic Programming Connection to Stabilization Problems 1 DT nonlinear
More informationChapter 2. Poisson Processes. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan
Chapter 2. Poisson Processes Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Outline Introduction to Poisson Processes Definition of arrival process Definition
More informationPontryagin s maximum principle
Pontryagin s maximum principle Emo Todorov Applied Mathematics and Computer Science & Engineering University of Washington Winter 2012 Emo Todorov (UW) AMATH/CSE 579, Winter 2012 Lecture 5 1 / 9 Pontryagin
More informationf x = x x 4. Find the critical numbers of f, showing all of the
MTH 5 Winter Term 011 Test 1 - Calculator Portion Name You may hold onto this portion of the test and work on it some more after you have completed the no calculator portion of the test. On this portion
More informationJUST THE MATHS UNIT NUMBER INTEGRATION APPLICATIONS 10 (Second moments of an arc) A.J.Hobson
JUST THE MATHS UNIT NUMBER 13.1 INTEGRATION APPLICATIONS 1 (Second moments of an arc) by A.J.Hobson 13.1.1 Introduction 13.1. The second moment of an arc about the y-axis 13.1.3 The second moment of an
More informationDIFFERENTIAL EQUATIONS
DIFFERENTIAL EQUATIONS 1. Basic Terminology A differential equation is an equation that contains an unknown function together with one or more of its derivatives. 1 Examples: 1. y = 2x + cos x 2. dy dt
More informationOptimal control theory with applications to resource and environmental economics
Optimal control theory with applications to resource and environmental economics Michael Hoel, August 10, 2015 (Preliminary and incomplete) 1 Introduction This note gives a brief, non-rigorous sketch of
More information20.6. Transfer Functions. Introduction. Prerequisites. Learning Outcomes
Transfer Functions 2.6 Introduction In this Section we introduce the concept of a transfer function and then use this to obtain a Laplace transform model of a linear engineering system. (A linear engineering
More informationTheory and Applications of Constrained Optimal Control Proble
Theory and Applications of Constrained Optimal Control Problems with Delays PART 1 : Mixed Control State Constraints Helmut Maurer 1, Laurenz Göllmann 2 1 Institut für Numerische und Angewandte Mathematik,
More information