Faculty of Civil and Environmental Engineering P-O Gutman 2004-02-20 Abstract When using the Pontryagin Maximum Principle in optimal control problems,

Slides:



Advertisements
Similar presentations
The Maximum Principle: Continuous Time Main purpose: to introduce the maximum principle as a necessary condition that must be satisfied by any optimal.
Advertisements

Chapter 8 The Maximum Principle: Discrete Time 8.1 Nonlinear Programming Problems We begin by starting a general form of a nonlinear programming problem.
5.4 Basis And Dimension.
One-phase Solidification Problem: FEM approach via Parabolic Variational Inequalities Ali Etaati May 14 th 2008.
1 C02,C03 – ,27,29 Advanced Robotics for Autonomous Manipulation Department of Mechanical EngineeringME 696 – Advanced Topics in Mechanical Engineering.
Hamiltonian Formalism
Systems of Linear Equations (see Appendix A.6, Trucco & Verri) CS485/685 Computer Vision Prof. George Bebis.
Autar Kaw Humberto Isaza
Course Outline 1.MATLAB tutorial 2.Motion of systems that can be idealized as particles Description of motion; Newton’s laws; Calculating forces required.
3.II.1. Representing Linear Maps with Matrices 3.II.2. Any Matrix Represents a Linear Map 3.II. Computing Linear Maps.
1 MECH 221 FLUID MECHANICS (Fall 06/07) Tutorial 6 FLUID KINETMATICS.
Maximum likelihood (ML) and likelihood ratio (LR) test
Shallow water equations in 1D: Method of characteristics
Lecture 7 Exact solutions
Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.
Math 3120 Differential Equations with Boundary Value Problems

Chapter 6 APPLICATIONS TO PRODUCTION AND INVENTORY Hwang, Fan, Erickson (1967) Hendricks et al (1971) Bensoussan et al (1974) Thompson-Sethi (1980) Stochastic.
Lesson 5 Method of Weighted Residuals. Classical Solution Technique The fundamental problem in calculus of variations is to obtain a function f(x) such.
Chapter 3 The Maximum Principle: Mixed Inequality Constraints Mixed inequality constraints: Inequality constraints involving control and possibly state.
Maximum likelihood (ML)
III Solution of pde’s using variational principles
SOLUTION FOR THE BOUNDARY LAYER ON A FLAT PLATE
Stability Analysis of Linear Switched Systems: An Optimal Control Approach 1 Michael Margaliot School of Elec. Eng. Tel Aviv University, Israel Joint work.
Algorithms for a large sparse nonlinear eigenvalue problem Yusaku Yamamoto Dept. of Computational Science & Engineering Nagoya University.
Lecture 3 Differential Constraints Method Andrei D. Polyanin.
Dr. Hatim Dirar Department of Physics, College of Science Imam Mohamad Ibn Saud Islamic University.
Outline: 5.1 INTRODUCTION
1 C03 – Advanced Robotics for Autonomous Manipulation Department of Mechanical EngineeringME 696 – Advanced Topics in Mechanical Engineering.
Quadruped Robot Modeling and Numerical Generation of the Open-Loop Trajectory Introduction We model a symmetric quadruped gait for a planar robot with.
4 - 1 Kinematics of Particles Kinematics is the study of motion without reference to the force which produced the motion. First, we will study the kinematics.
EASTERN MEDITERRANEAN UNIVERSITY Department of Industrial Engineering Non linear Optimization Spring Instructor: Prof.Dr.Sahand Daneshvar Submited.
Dr. R. Nagarajan Professor Dept of Chemical Engineering IIT Madras
1 MODELING MATTER AT NANOSCALES 4. Introduction to quantum treatments The variational method.
Vector Analysis Copyright © Cengage Learning. All rights reserved.
Jump to first page Chapter 3 Splines Definition (3.1) : Given a function f defined on [a, b] and a set of numbers, a = x 0 < x 1 < x 2 < ……. < x n = b,
Linearizability of Chemical Reactors By M. Guay Department of Chemical and Materials Engineering University of Alberta Edmonton, Alberta, Canada Work Supported.
OR Chapter 7. The Revised Simplex Method  Recall Theorem 3.1, same basis  same dictionary Entire dictionary can be constructed as long as we.
CHAP 3 WEIGHTED RESIDUAL AND ENERGY METHOD FOR 1D PROBLEMS
Phy 303: Classical Mechanics (2) Chapter 3 Lagrangian and Hamiltonian Mechanics.
Functions of Several Variables Copyright © Cengage Learning. All rights reserved.
INTRODUCTION TO DYNAMICS ANALYSIS OF ROBOTS (Part 4)
Review of PMP Derivation We want to find control u(t) which minimizes the function: x(t) = x*(t) +  x(t); u(t) = u*(t) +  u(t); (t) = *(t) +  (t);
Optimization of Nonlinear Singularly Perturbed Systems with Hypersphere Control Restriction A.I. Kalinin and J.O. Grudo Belarusian State University, Minsk,
Determining 3D Structure and Motion of Man-made Objects from Corners.
Linear Programming Chapter 9. Interior Point Methods  Three major variants  Affine scaling algorithm - easy concept, good performance  Potential.
Chapter 4 The Maximum Principle: General Inequality Constraints.
F. Fairag, H Tawfiq and M. Al-Shahrani Department of Math & Stat Department of Mathematics and Statistics, KFUPM. Nov 6, 2013 Preconditioning Technique.
Instructor: Mircea Nicolescu Lecture 9
Optimal Path Planning on Matrix Lie Groups Mechanical Engineering and Applied Mechanics Sung K. Koh U n i v e r s i t y o f P e n n s y l v a n i a.
Vector Analysis 15 Copyright © Cengage Learning. All rights reserved.
Amir Yavariabdi Introduction to the Calculus of Variations and Optical Flow.
Particle Kinematics Direction of velocity vector is parallel to path Magnitude of velocity vector is distance traveled / time Inertial frame – non accelerating,
Linear Algebra Engineering Mathematics-I. Linear Systems in Two Unknowns Engineering Mathematics-I.
Differential Equations Copyright © Cengage Learning. All rights reserved.
Ordinary Differential Equations (ODEs). Objectives of Topic  Solve Ordinary Differential Equations (ODEs).  Appreciate the importance of numerical methods.
Use or disclosure of the information contained herein is subject to specific written CIRA approval 1 PURSUIT – EVASION GAMES GAME THEORY AND ANALYSIS OF.
1 Week 3 First-order ordinary differential equations (ODE) 1.Basic definitions 2.Separable ODEs 3.ODEs reducible to separable form 4.Linear first-order.
YLE13: Hotelling model Marko Lindroos.
We will be looking for a solution to the system of linear differential equations with constant coefficients.
Morphing and Shape Processing
FIRST ORDER DIFFERENTIAL EQUATIONS
Mathematical Descriptions of Systems
Optimal control T. F. Edgar Spring 2012.
§1-3 Solution of a Dynamical Equation
Chapter 4 . Trajectory planning and Inverse kinematics
Chapter 3 Modeling in the Time Domain
Optimal Control of Systems
Chapter 2. Simplex method
1st semester a.y. 2018/2019 – November 22, 2018
Presentation transcript:

Faculty of Civil and Environmental Engineering P-O Gutman Abstract When using the Pontryagin Maximum Principle in optimal control problems, the most difficult part of the numerical solution is associated with the non-linear operation of the maximization of the Hamiltonian over the control variables. For a class of problems, the optimal control vector is a vector function with continuous time derivatives. A method is presented to find this smooth control without the maximization of the the Hamiltonian. Three illustrative examples are considered. On smooth optimal control determination Ilya Ioslovich and Per-Olof Gutman

Faculty of Civil and Environmental Engineering P-O Gutman Contents  The classical optimal control problem  Classical solution · The new idea without optimization w.r.t. the control u · Theorem · Example 1: Rigid body rotation · Example 2: Optimal spacing for greenhouse lettuce growth · Example 3: Maximal area under a curve of given length · Conclusions

Faculty of Civil and Environmental Engineering P-O Gutman The classical optimal control problem Consider the classical optimal control problem (OCP), Pontryagin et al. (1962), Lee and Marcus (1967), Athans and Falb (1966), etc. the control variables u(t)  R m, the state variables x(t)  R n, and f(x,u)  R n are column vectors, with m  n. f 0 (x,u), f(x,u) are smooth in all arguments. The Hamiltonian is where it holds for the column vector p(t)  R n of co-state variables, that according to the Pontryagin Maximum Principle (PMP).

Faculty of Civil and Environmental Engineering P-O Gutman Classical solution If an optimal solution (x*,u*) exists, then, by PMP, it holds that H(x*, u*, p*)  H(x*, u, p*) implying here by smoothness, and the presence of constraint (3) only, that for u= u*, or, with (5) inserted into (7), where  f 0 /  u is 1  m, and  f/  u is n  m. To find (x*, u*, p*) the two point boundary value problem (2)-(6) must be solved. At each t, (8) gives u* as a function of x and p. (8) is often non-linear, and computationally costly. p(0) has as many unknowns as given end conditions x(T).

Faculty of Civil and Environmental Engineering P-O Gutman The new idea without optimization w.r.t. u We note that (8) is linear in p. Assume that rank(  f/  u)=m   a non- singular m  m submatrix. Then, re-index the corresponding vectors where  a denotes an m-vector. Then, (8) gives Hence by linear operations, m elements of p  R n, i.e. p a, are computed as a function of u, x, and p b.

Faculty of Civil and Environmental Engineering P-O Gutman The new idea, cont’d Differentiate (10): where B is assumed non-singular. (6) gives (10) into RHS of (12, 13), noting that dp a /dt is given by the RHS of (11) and (12), and solving for du/dt, gives

Faculty of Civil and Environmental Engineering P-O Gutman Theorem Remark: if m=n, then x a =x, and p a =p, and (15) becomes Theorem: If the optimal control problem (1)-(3), m  n, has the optimal solution x*, u* such that u* is smooth and belongs to the open set U, and if the Hamiltonian is given by (5), the Jacobians  f a /  u and B=  p a /  u are non-singular, then the optimal states x*, co-states p* b, and control u* satisfy with the appropriate initial conditions u(0)=u 0, p b (0)=p b 0 to be found. Remark: The number of equa- tions in (15) is 2n, just as in PMP, but without the maxim- ization of the Hamiltonian.

Faculty of Civil and Environmental Engineering P-O Gutman Example 1: Rigid body rotation Stopping axisymmetric rigid body rotation (Athans and Falb, 1963)

Faculty of Civil and Environmental Engineering P-O Gutman Example 1: Rigid body rotation, cont’d The problem is solved without maximizing the Hamiltonian! (23)  Polar coordinates: then, clearly, Þ(u1, u2) and (x, y) rotate collinearly with the same angular velocity a. Let then, from (17), (25), (26),

Faculty of Civil and Environmental Engineering P-O Gutman Example 2: Optimal spacing for greenhouse lettuce growth Optimal variable spacing policy (Seginer, Ioslovich, Gutman), assuming constant climate with v [kg/plant] = dry mass, G [kg/m 2 /s] net photosynth- esis, W [kg/m 2 ] plant density (control), a [m 2 /plant] spacing, v T marketable plant mass, and final time T [s] free. p is obtained from  H/  W=0, (34), (35)  Differentiating (34), (36), (37)  Free final time  Then, at t=T, (39,32,34): (38, 40) show that  t, W* satisfies   G(W*)/  W* = 0 For free final time, (38)... also w/o maximization of the Hamiltonian, I&G 99

Faculty of Civil and Environmental Engineering P-O Gutman Example 3: Maximal area under a curve of given length Variational, isoparametric problem, e.g. Gelfand and Fomin, (1969). Here, it is possible to solve (48) for u, but let us solve for p 1 Differentiating (49), and using (47) gives Guessing p 2 =constant and u(0), and integrate (43), (44), (50), such that (45) is satisfied, yields 

Faculty of Civil and Environmental Engineering P-O Gutman Conclusions A method to find the smooth optimal control for a class of optimal control problems was presented. The method does not require the maximization of the Hamiltonian over the control. Instead, the ODEs for m co-states are substituted for ODEs for the m smooth control variables. Three illustrative examples were given.