Principles of Optimal Control Spring 2008

Size: px
Start display at page:

Download "Principles of Optimal Control Spring 2008"

Transcription

1 MIT OpenCourseWare Principles of Optial Control Spring 2008 For inforation about citing these aterials or our Ters of Use, visit:

2 Lecture 10 Singular Arcs Bryson Chapter 8 Kirk Section 5.6

3 Spr Singular Probles There are occasions when the PMP { } u (t) = arg in H(x, u, p, t) u(t) U fails to define u (t) can an extreal control still exist? Typically occurs when the Hailtonian is linear in the control, and the coefficient of the control ter equals zero. Exaple: on page 9-10 we wrote the control law: u b < p 2 (t) u(t) = 0 b < p 2 (t) < b u p 2 (t) < b but we do not know what happens if p 2 = b for an interval of tie. Called a singular arc. Botto line is that the straightforward solution approach does not work, and we need to investigate the PMP conditions in ore detail. Key point: depending on the syste and the cost, singular arcs ight exist, and we ust deterine their existence to fully characterize the set of possible control solutions. Note: control on the singular arc is deterined by the requireents that the coefficient of the linear control ters in H u reain zero on the singular arc and so ust the tie derivatives of H u. Necessary condition for scalar u can be stated as [( ) ] d 2k ( 1) k H u dt 2k u 0 k = 0, 1, 2...

4 Spr 2008 Singular Arc Exaple With ẋ = u, x(0) = 1 and 0 u(t) 4, consider objective in 2 0 (x(t) t 2 ) 2 dt First for standard Hailtonian H = (x(t) t 2 ) 2 + p(t)u(t) which gives H u = p(t) and ṗ(t) = H x = 2(x t 2 ), with p(2) = 0 (10.15) Note that if p(t) > 0, then PMP indicates that we should take the iniu possible value of u(t) = 0. Siilarly, if p(t) < 0, we should take u(t) = 4. Question: can we get that H u 0 for soe interval of tie? Note: H u 0 iplies p(t) 0, which eans ṗ(t) 0, and thus ṗ(t) 0 x(t) = t 2, u(t) = ẋ = 2t Thus we get the control law that 0 p(t) > 0 u(t) = 2t when p(t) = 0 4 p(t) < 0

5 Spr Can show by contradiction that optial solution has x(t) t 2 for t [0, 2]. And thus we know that ṗ(t) 0 for t [0, 2] But p(2) = 0 and ṗ(t) 0 iply that p(t) 0 for t [0, 2] So there ust be a point in tie k [0, 2] after which p(t) = 0 (soe steps skipped here...) Check options: k = 0? contradiction Check options: k = 2? contradiction So ust have 0 < k < 2. How find it? Control law will be { 0 when 0 t < k u(t) = 2t k t < 2 apply this control to the state equations and get: { 1 when 0 t k x(t) = 2 t + (1 k 2 ) k t 2 To find k, note that ust have p(t) 0 for t [k, 2], so in this tie range ṗ(t) 0 = 2(1 k 2 ) k = 1 So now both u(t) and x(t) are known, and the optial solution is to bang off and then follow a singular arc.

6 Spr 2008 Singular Arc Exaple LTI syste, x 1 (0), x 2 (0), t f given; x 1 (t f ) = x 2 (t f ) = 0 [ ] [ ] A = B = t f and J = 1 2 x 2 1 dt (see Bryson and Ho, p. 248) 0 So H = 1 x 1 (t) p 1 (t)x 2 (t) + p 1 (t)u(t) p 2 (t)u(t) ṗ 1 (t) = x 1 (t), ṗ 2 (t) = p 1 (t) For a singular arc, we ust have H u = 0 for a finite tie interval Thus, during that interval H u = p 1 (t) p 2 (t) = 0? d Hu = ṗ 1 (t) ṗ 2 (t) dt = x 1 (t) + p 1 (t) = 0 Note that H is not an explicit function of tie, so H is a constant for all tie H = 1 x 1 (t) 2 + p 1 (t)x 2 (t) + [p 1 (t) p 2 (t)] u(t) = C 2 but can now substitute fro above along the singular arc 1 x1 (t) 2 + x 1 (t)x 2 (t) = C 2 which gives a faily of singular arcs in the state x 1, x 2 To find the appropriate control to stay on the arc, use d 2 dt 2 (H u) = ẋ 1 + ṗ 1 = (x 2 (t) + u(t)) x 1 (t) = 0 or that u(t) = (x 1 (t) + x 2 (t)) which is a linear feedback law to use along the singular arc.

7 Spr 2008 Details for LTI Systes Consider the in tie-fuel proble for the general syste with M u i M + and ẋ = Ax + Bu tf J = (1 + c i u i )dt 0 i=1 t f is free and we want to drive the state to the origin We studied this case before, and showed that H = 1 + (c i u i + p T B i u i ) + p T Ax i=1 d On a singular arc, k dt k (H u ) = 0 coefficient of u in H is zero p T (t)b i = ±c i for non-zero period of tie and ( ) T d k (p T d k p(t) (t)b i ) = B i = 0 k 1 dt k dt k Recall the necessary conditions ṗ T = H x = p T A, which iply. ( ) T d k p(t) dt k p T = ṗ T A = p T A 2... p T = p TA = p T A 3 ( 1) k p T A k and cobining with the above gives ( ) T d k p(t) B i = ( 1) k p T A k B i = 0 dt k

8 Spr Rewriting these equations yields the conditions that p T AB i = 0, p T A 2 B i = 0, [ ] p T A B i AB i A n 1 B i = 0 There are three ways to get: [ ] p T A B i AB i A n 1 B i = 0 On a singular arc, we know that p(t) = 0 so this does not cause the condition to be zero. What if A singular, and p(t) T A = 0 on the arc? Then ṗ T = p T A = 0. In this case, p(t) is constant over [t 0, t f ] Indicates that if the proble is singular at any tie, it is singular for all tie. This also indicates that u is a constant. A possible case, but would be unusual since it is very restrictive set of control inputs. [ ] Third possibility is that B i AB i A n 1 B i is singular, eaning that the syste is not controllable by the individual control inputs. Very likely scenario ost coon cause of singularity conditions. Lack of controllability by a control input does not necessarily ean that a singular arc has to exist, but it is a possibility.

9 Spr For Min Tie probles, now c i = 0, so things are a bit different In this case the switchings are at p T B i = 0 and a siilar analysis as before gives the condition that [ ] p T B i AB i A n 1 B i = 0 Now there are only 2 possibilities p = 0 is one, but in that case, but we would expect that H = 0 H = 1 + p T (Ax + Bu) = 1 Second condition is obviously the lack of controllability again. Suary (Min tie): If the syste is copletely controllable by B i, then u i can have no singular intervals Not shown, but if the syste is not copletely controllable by B i, then u i ust have a singular interval. Suary (Min tie-fuel): If the syste is copletely controllable by B i and A is non-singular, then there can be no singular intervals

10 Spr 2008 Nonlinear Systes Consider systes that are nonlinear in the state, but linear in the control ẋ(t) = a(x(t)) + b(x(t))u(t) with cost J = tf t 0 g(x(t))dt For a singular arc, in general you will find that d k dt k (H u i ) = 0 k = 0,..., r 1 but these conditions provide no indication of the control required to keep the syste on the singular arc i.e. the coefficient of the control ters is zero. d But then for soe r and i, r dt r (H ui ) = 0 does retain u i. So if u j (x, p) are the other control inputs, then d r (H ui ) = C(x, p, u j (x, p)) + D(x, p, u j (x, p))u i = 0 dt r with D = 0, so the condition does depend on u i. Then can define the appropriate control law to stay on the singular arc as C(x, p, u j (x, p, )) u i = D(x, p, uj (x, p, ))

11 Spr Properties of this solution are: r 2 is even Singular surface of diension 2n r in space of (x, p) in general, but 2n r 1 if t f is free (additional constraint that H(t) = 0) Additional necessary condition for the singular arc to be extreal is that: [ ] d r ( 1) r/2 H u 0 u i dt r Note that in the exaple above, [ ] d r H u D u i dt r

12 Spr 2008 Last Exaple Goddard proble: thrust progra for axiu altitude of a sounding rocket [Bryson and Ho, p. 253]. Given the EOM: 1 v = [F (t) D(v, h)] g ḣ = v F (t) ṁ = c where g is a constant, and drag odel is D(v, h) = 1 2 ρv2 C d Se βh Proble: Find 0 F (t) F ax to axiize h(t f ) with v(0) = h(0) = 0 and (0), (t f ) are given The Hailtonian is ( ) 1 F (t) H = p 1 [F (t) D(v, h)] g + p 2 v p 3 c and since v(t f ) is not specified and we are axiizing h(t f ), p 2 (t f ) = 1 p 1 (t f ) = 0 Note that H(t) = 0 since the final tie is not specified. The costate EOM are: 1 D v D ṗ = 0 0 p h F D H is linear in the controls, and the iniu is found by iniizing ( p 1 p c 3 )F (t), which clearly has 3 possible solutions: F = F ax ( p 1 p c 3 ) < 0 0 < F < F ax if ( p 1 p c 3 ) = 0 1 F = 0 p c 3 ) > 0 ( p Middle expression corresponds to a singular arc.

13 Spr Note: on a singular arc, ust have H u = p 1 c p 3 = 0 for finite interval, so then Ḣ u = 0 and Ḧ u = 0, which eans ( ) D D + p 1 p 2 = 0 v c and F = D + g + (10.16) D + 2c D + c 2 2 D [ v v 2 ] D D 2 D g(d + c ) + c(c v) vc 2 v h v h which is a nonlinear feedback control law for thrust on a singular arc. For this particular drag odel, the feedback law siplifies to: [ g βc 2 ( v ) c ] F = D + g (c/v) + 2(c/v) 2 g c v ( ) and the singular surface is: g = 1 + v c D Constraints H(t) = 0, H u = 0, and Ḣ u = 0 provide a condition that defines a surface for the singular arc in v, h, space: v D D + g D v = 0 (10.17) c v It can then be shown that the solution typically consists of 3 arcs: 1. F = F ax until is satisfied. 2. Follow singular arc using feedback law until (t) = (t f ). 3. F = 0 until v = 0. which is of the for bang-singular-bang

14 Spr Figure 10.1: Goddard Proble

15 Spr Figure 10.2: Goddard Proble

16 Spr Figure 10.3: Goddard Proble

Principles of Optimal Control Spring 2008

Principles of Optimal Control Spring 2008 MIT OpenCourseWare http://ocw.mit.edu 16.323 Principles of Optimal Control Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 16.323 Lecture

More information

List Scheduling and LPT Oliver Braun (09/05/2017)

List Scheduling and LPT Oliver Braun (09/05/2017) List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)

More information

Lecture 8 Symmetries, conserved quantities, and the labeling of states Angular Momentum

Lecture 8 Symmetries, conserved quantities, and the labeling of states Angular Momentum Lecture 8 Syetries, conserved quantities, and the labeling of states Angular Moentu Today s Progra: 1. Syetries and conserved quantities labeling of states. hrenfest Theore the greatest theore of all ties

More information

Support Vector Machines MIT Course Notes Cynthia Rudin

Support Vector Machines MIT Course Notes Cynthia Rudin Support Vector Machines MIT 5.097 Course Notes Cynthia Rudin Credit: Ng, Hastie, Tibshirani, Friedan Thanks: Şeyda Ertekin Let s start with soe intuition about argins. The argin of an exaple x i = distance

More information

Force and dynamics with a spring, analytic approach

Force and dynamics with a spring, analytic approach Force and dynaics with a spring, analytic approach It ay strie you as strange that the first force we will discuss will be that of a spring. It is not one of the four Universal forces and we don t use

More information

Support Vector Machines. Maximizing the Margin

Support Vector Machines. Maximizing the Margin Support Vector Machines Support vector achines (SVMs) learn a hypothesis: h(x) = b + Σ i= y i α i k(x, x i ) (x, y ),..., (x, y ) are the training exs., y i {, } b is the bias weight. α,..., α are the

More information

A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words)

A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words) 1 A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine (1900 words) Contact: Jerry Farlow Dept of Matheatics Univeristy of Maine Orono, ME 04469 Tel (07) 866-3540 Eail: farlow@ath.uaine.edu

More information

Introduction to Discrete Optimization

Introduction to Discrete Optimization Prof. Friedrich Eisenbrand Martin Nieeier Due Date: March 9 9 Discussions: March 9 Introduction to Discrete Optiization Spring 9 s Exercise Consider a school district with I neighborhoods J schools and

More information

Feature Extraction Techniques

Feature Extraction Techniques Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that

More information

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,

More information

arxiv: v1 [cs.ds] 3 Feb 2014

arxiv: v1 [cs.ds] 3 Feb 2014 arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/

More information

The Methods of Solution for Constrained Nonlinear Programming

The Methods of Solution for Constrained Nonlinear Programming Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 01-06 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.co The Methods of Solution for Constrained

More information

1 Identical Parallel Machines

1 Identical Parallel Machines FB3: Matheatik/Inforatik Dr. Syaantak Das Winter 2017/18 Optiizing under Uncertainty Lecture Notes 3: Scheduling to Miniize Makespan In any standard scheduling proble, we are given a set of jobs J = {j

More information

COS 424: Interacting with Data. Written Exercises

COS 424: Interacting with Data. Written Exercises COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well

More information

USEFUL HINTS FOR SOLVING PHYSICS OLYMPIAD PROBLEMS. By: Ian Blokland, Augustana Campus, University of Alberta

USEFUL HINTS FOR SOLVING PHYSICS OLYMPIAD PROBLEMS. By: Ian Blokland, Augustana Campus, University of Alberta 1 USEFUL HINTS FOR SOLVING PHYSICS OLYMPIAD PROBLEMS By: Ian Bloland, Augustana Capus, University of Alberta For: Physics Olypiad Weeend, April 6, 008, UofA Introduction: Physicists often attept to solve

More information

8.1 Force Laws Hooke s Law

8.1 Force Laws Hooke s Law 8.1 Force Laws There are forces that don't change appreciably fro one instant to another, which we refer to as constant in tie, and forces that don't change appreciably fro one point to another, which

More information

Curious Bounds for Floor Function Sums

Curious Bounds for Floor Function Sums 1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International

More information

Periodic Motion is everywhere

Periodic Motion is everywhere Lecture 19 Goals: Chapter 14 Interrelate the physics and atheatics of oscillations. Draw and interpret oscillatory graphs. Learn the concepts of phase and phase constant. Understand and use energy conservation

More information

1 Bounding the Margin

1 Bounding the Margin COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost

More information

A Simple Regression Problem

A Simple Regression Problem A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where

More information

CONTROL SYSTEMS, ROBOTICS, AND AUTOMATION Vol. IX Uncertainty Models For Robustness Analysis - A. Garulli, A. Tesi and A. Vicino

CONTROL SYSTEMS, ROBOTICS, AND AUTOMATION Vol. IX Uncertainty Models For Robustness Analysis - A. Garulli, A. Tesi and A. Vicino UNCERTAINTY MODELS FOR ROBUSTNESS ANALYSIS A. Garulli Dipartiento di Ingegneria dell Inforazione, Università di Siena, Italy A. Tesi Dipartiento di Sistei e Inforatica, Università di Firenze, Italy A.

More information

Introduction to Machine Learning. Recitation 11

Introduction to Machine Learning. Recitation 11 Introduction to Machine Learning Lecturer: Regev Schweiger Recitation Fall Seester Scribe: Regev Schweiger. Kernel Ridge Regression We now take on the task of kernel-izing ridge regression. Let x,...,

More information

13 Harmonic oscillator revisited: Dirac s approach and introduction to Second Quantization

13 Harmonic oscillator revisited: Dirac s approach and introduction to Second Quantization 3 Haronic oscillator revisited: Dirac s approach and introduction to Second Quantization. Dirac cae up with a ore elegant way to solve the haronic oscillator proble. We will now study this approach. The

More information

PHYSICS 110A : CLASSICAL MECHANICS MIDTERM EXAM #2

PHYSICS 110A : CLASSICAL MECHANICS MIDTERM EXAM #2 PHYSICS 110A : CLASSICAL MECHANICS MIDTERM EXAM #2 [1] Two blocks connected by a spring of spring constant k are free to slide frictionlessly along a horizontal surface, as shown in Fig. 1. The unstretched

More information

Block designs and statistics

Block designs and statistics Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent

More information

Answers to Econ 210A Midterm, October A. The function f is homogeneous of degree 1/2. To see this, note that for all t > 0 and all (x 1, x 2 )

Answers to Econ 210A Midterm, October A. The function f is homogeneous of degree 1/2. To see this, note that for all t > 0 and all (x 1, x 2 ) Question. Answers to Econ 20A Midter, October 200 f(x, x 2 ) = ax {x, x 2 } A. The function f is hoogeneous of degree /2. To see this, note that for all t > 0 and all (x, x 2 ) f(tx, x 2 ) = ax {tx, tx

More information

Ph 20.3 Numerical Solution of Ordinary Differential Equations

Ph 20.3 Numerical Solution of Ordinary Differential Equations Ph 20.3 Nuerical Solution of Ordinary Differential Equations Due: Week 5 -v20170314- This Assignent So far, your assignents have tried to failiarize you with the hardware and software in the Physics Coputing

More information

P235 Midterm Examination Prof. Cline

P235 Midterm Examination Prof. Cline P235 Mier Exaination Prof. Cline THIS IS A CLOSED BOOK EXAMINATION. Do all parts of all four questions. Show all steps to get full credit. 7:00-10.00p, 30 October 2009 1:(20pts) Consider a rocket fired

More information

Approximation in Stochastic Scheduling: The Power of LP-Based Priority Policies

Approximation in Stochastic Scheduling: The Power of LP-Based Priority Policies Approxiation in Stochastic Scheduling: The Power of -Based Priority Policies Rolf Möhring, Andreas Schulz, Marc Uetz Setting (A P p stoch, r E( w and (B P p stoch E( w We will assue that the processing

More information

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential

More information

A1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3

A1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3 A. Find all ordered pairs a, b) of positive integers for which a + b = 3 08. Answer. The six ordered pairs are 009, 08), 08, 009), 009 337, 674) = 35043, 674), 009 346, 673) = 3584, 673), 674, 009 337)

More information

EE5900 Spring Lecture 4 IC interconnect modeling methods Zhuo Feng

EE5900 Spring Lecture 4 IC interconnect modeling methods Zhuo Feng EE59 Spring Parallel LSI AD Algoriths Lecture I interconnect odeling ethods Zhuo Feng. Z. Feng MTU EE59 So far we ve considered only tie doain analyses We ll soon see that it is soeties preferable to odel

More information

SIMPLE HARMONIC MOTION: NEWTON S LAW

SIMPLE HARMONIC MOTION: NEWTON S LAW SIMPLE HARMONIC MOTION: NEWTON S LAW siple not siple PRIOR READING: Main 1.1, 2.1 Taylor 5.1, 5.2 http://www.yoops.org/twocw/it/nr/rdonlyres/physics/8-012fall-2005/7cce46ac-405d-4652-a724-64f831e70388/0/chp_physi_pndul.jpg

More information

lecture 36: Linear Multistep Mehods: Zero Stability

lecture 36: Linear Multistep Mehods: Zero Stability 95 lecture 36: Linear Multistep Mehods: Zero Stability 5.6 Linear ultistep ethods: zero stability Does consistency iply convergence for linear ultistep ethods? This is always the case for one-step ethods,

More information

8.012 Physics I: Classical Mechanics Fall 2008

8.012 Physics I: Classical Mechanics Fall 2008 MIT OpenCourseWare http://ocw.it.edu 8.012 Physics I: Classical Mechanics Fall 2008 For inforation about citing these aterials or our Ters of Use, isit: http://ocw.it.edu/ters. MASSACHUSETTS INSTITUTE

More information

Lecture #8-3 Oscillations, Simple Harmonic Motion

Lecture #8-3 Oscillations, Simple Harmonic Motion Lecture #8-3 Oscillations Siple Haronic Motion So far we have considered two basic types of otion: translation and rotation. But these are not the only two types of otion we can observe in every day life.

More information

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths

More information

Polygonal Designs: Existence and Construction

Polygonal Designs: Existence and Construction Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G

More information

The Weierstrass Approximation Theorem

The Weierstrass Approximation Theorem 36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined

More information

Donald Fussell. October 28, Computer Science Department The University of Texas at Austin. Point Masses and Force Fields.

Donald Fussell. October 28, Computer Science Department The University of Texas at Austin. Point Masses and Force Fields. s Vector Moving s and Coputer Science Departent The University of Texas at Austin October 28, 2014 s Vector Moving s Siple classical dynaics - point asses oved by forces Point asses can odel particles

More information

OSCILLATIONS AND WAVES

OSCILLATIONS AND WAVES OSCILLATIONS AND WAVES OSCILLATION IS AN EXAMPLE OF PERIODIC MOTION No stories this tie, we are going to get straight to the topic. We say that an event is Periodic in nature when it repeats itself in

More information

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal

More information

Mathematical Model and Algorithm for the Task Allocation Problem of Robots in the Smart Warehouse

Mathematical Model and Algorithm for the Task Allocation Problem of Robots in the Smart Warehouse Aerican Journal of Operations Research, 205, 5, 493-502 Published Online Noveber 205 in SciRes. http://www.scirp.org/journal/ajor http://dx.doi.org/0.4236/ajor.205.56038 Matheatical Model and Algorith

More information

CHAPTER 15: Vibratory Motion

CHAPTER 15: Vibratory Motion CHAPTER 15: Vibratory Motion courtesy of Richard White courtesy of Richard White 2.) 1.) Two glaring observations can be ade fro the graphic on the previous slide: 1.) The PROJECTION of a point on a circle

More information

Quantum Chemistry Exam 2 Take-home Solutions

Quantum Chemistry Exam 2 Take-home Solutions Cheistry 60 Fall 07 Dr Jean M Standard Nae KEY Quantu Cheistry Exa Take-hoe Solutions 5) (0 points) In this proble, the nonlinear variation ethod will be used to deterine an approxiate solution for the

More information

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes Graphical Models in Local, Asyetric Multi-Agent Markov Decision Processes Ditri Dolgov and Edund Durfee Departent of Electrical Engineering and Coputer Science University of Michigan Ann Arbor, MI 48109

More information

Multi-Dimensional Hegselmann-Krause Dynamics

Multi-Dimensional Hegselmann-Krause Dynamics Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory

More information

Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis

Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis City University of New York (CUNY) CUNY Acadeic Works International Conference on Hydroinforatics 8-1-2014 Experiental Design For Model Discriination And Precise Paraeter Estiation In WDS Analysis Giovanna

More information

Bipartite subgraphs and the smallest eigenvalue

Bipartite subgraphs and the smallest eigenvalue Bipartite subgraphs and the sallest eigenvalue Noga Alon Benny Sudaov Abstract Two results dealing with the relation between the sallest eigenvalue of a graph and its bipartite subgraphs are obtained.

More information

Support Vector Machines. Goals for the lecture

Support Vector Machines. Goals for the lecture Support Vector Machines Mark Craven and David Page Coputer Sciences 760 Spring 2018 www.biostat.wisc.edu/~craven/cs760/ Soe of the slides in these lectures have been adapted/borrowed fro aterials developed

More information

Finite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields

Finite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields Finite fields I talked in class about the field with two eleents F 2 = {, } and we ve used it in various eaples and hoework probles. In these notes I will introduce ore finite fields F p = {,,...,p } for

More information

CHAPTER 19: Single-Loop IMC Control

CHAPTER 19: Single-Loop IMC Control When I coplete this chapter, I want to be able to do the following. Recognize that other feedback algoriths are possible Understand the IMC structure and how it provides the essential control features

More information

lecture 37: Linear Multistep Methods: Absolute Stability, Part I lecture 38: Linear Multistep Methods: Absolute Stability, Part II

lecture 37: Linear Multistep Methods: Absolute Stability, Part I lecture 38: Linear Multistep Methods: Absolute Stability, Part II lecture 37: Linear Multistep Methods: Absolute Stability, Part I lecture 3: Linear Multistep Methods: Absolute Stability, Part II 5.7 Linear ultistep ethods: absolute stability At this point, it ay well

More information

Now multiply the left-hand-side by ω and the right-hand side by dδ/dt (recall ω= dδ/dt) to get:

Now multiply the left-hand-side by ω and the right-hand side by dδ/dt (recall ω= dδ/dt) to get: Equal Area Criterion.0 Developent of equal area criterion As in previous notes, all powers are in per-unit. I want to show you the equal area criterion a little differently than the book does it. Let s

More information

m potential kinetic forms of energy.

m potential kinetic forms of energy. Spring, Chapter : A. near the surface of the earth. The forces of gravity and an ideal spring are conservative forces. With only the forces of an ideal spring and gravity acting on a ass, energy F F will

More information

Using EM To Estimate A Probablity Density With A Mixture Of Gaussians

Using EM To Estimate A Probablity Density With A Mixture Of Gaussians Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points

More information

I. Understand get a conceptual grasp of the problem

I. Understand get a conceptual grasp of the problem MASSACHUSETTS INSTITUTE OF TECHNOLOGY Departent o Physics Physics 81T Fall Ter 4 Class Proble 1: Solution Proble 1 A car is driving at a constant but unknown velocity,, on a straightaway A otorcycle is

More information

Figure 1: Equivalent electric (RC) circuit of a neurons membrane

Figure 1: Equivalent electric (RC) circuit of a neurons membrane Exercise: Leaky integrate and fire odel of neural spike generation This exercise investigates a siplified odel of how neurons spike in response to current inputs, one of the ost fundaental properties of

More information

Principles of Optimal Control Spring 2008

Principles of Optimal Control Spring 2008 MIT OpenCourseWare http://ocw.mit.edu 16.323 Principles of Optimal Control Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 16.323 Lecture

More information

4 = (0.02) 3 13, = 0.25 because = 25. Simi-

4 = (0.02) 3 13, = 0.25 because = 25. Simi- Theore. Let b and be integers greater than. If = (. a a 2 a i ) b,then for any t N, in base (b + t), the fraction has the digital representation = (. a a 2 a i ) b+t, where a i = a i + tk i with k i =

More information

Physics 207 Lecture 18. Physics 207, Lecture 18, Nov. 3 Goals: Chapter 14

Physics 207 Lecture 18. Physics 207, Lecture 18, Nov. 3 Goals: Chapter 14 Physics 07, Lecture 18, Nov. 3 Goals: Chapter 14 Interrelate the physics and atheatics of oscillations. Draw and interpret oscillatory graphs. Learn the concepts of phase and phase constant. Understand

More information

On Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40

On Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40 On Poset Merging Peter Chen Guoli Ding Steve Seiden Abstract We consider the follow poset erging proble: Let X and Y be two subsets of a partially ordered set S. Given coplete inforation about the ordering

More information

Physics 202H - Introductory Quantum Physics I Homework #12 - Solutions Fall 2004 Due 5:01 PM, Monday 2004/12/13

Physics 202H - Introductory Quantum Physics I Homework #12 - Solutions Fall 2004 Due 5:01 PM, Monday 2004/12/13 Physics 0H - Introctory Quantu Physics I Hoework # - Solutions Fall 004 Due 5:0 PM, Monday 004//3 [70 points total] Journal questions. Briefly share your thoughts on the following questions: What aspects

More information

EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS

EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS Jochen Till, Sebastian Engell, Sebastian Panek, and Olaf Stursberg Process Control Lab (CT-AST), University of Dortund,

More information

Ştefan ŞTEFĂNESCU * is the minimum global value for the function h (x)

Ştefan ŞTEFĂNESCU * is the minimum global value for the function h (x) 7Applying Nelder Mead s Optiization Algorith APPLYING NELDER MEAD S OPTIMIZATION ALGORITHM FOR MULTIPLE GLOBAL MINIMA Abstract Ştefan ŞTEFĂNESCU * The iterative deterinistic optiization ethod could not

More information

This model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.

This model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t. CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when

More information

Lower Bounds for Quantized Matrix Completion

Lower Bounds for Quantized Matrix Completion Lower Bounds for Quantized Matrix Copletion Mary Wootters and Yaniv Plan Departent of Matheatics University of Michigan Ann Arbor, MI Eail: wootters, yplan}@uich.edu Mark A. Davenport School of Elec. &

More information

In this chapter we will start the discussion on wave phenomena. We will study the following topics:

In this chapter we will start the discussion on wave phenomena. We will study the following topics: Chapter 16 Waves I In this chapter we will start the discussion on wave phenoena. We will study the following topics: Types of waves Aplitude, phase, frequency, period, propagation speed of a wave Mechanical

More information

i ij j ( ) sin cos x y z x x x interchangeably.)

i ij j ( ) sin cos x y z x x x interchangeably.) Tensor Operators Michael Fowler,2/3/12 Introduction: Cartesian Vectors and Tensors Physics is full of vectors: x, L, S and so on Classically, a (three-diensional) vector is defined by its properties under

More information

Kernel Methods and Support Vector Machines

Kernel Methods and Support Vector Machines Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic

More information

Elastic Force: A Force Balance: Elastic & Gravitational Force: Force Example: Determining Spring Constant. Some Other Forces

Elastic Force: A Force Balance: Elastic & Gravitational Force: Force Example: Determining Spring Constant. Some Other Forces Energy Balance, Units & Proble Solving: Mechanical Energy Balance ABET Course Outcoes: 1. solve and docuent the solution of probles involving eleents or configurations not previously encountered (e) (e.g.

More information

Probability Distributions

Probability Distributions Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples

More information

Lecture 16: Scattering States and the Step Potential. 1 The Step Potential 1. 4 Wavepackets in the step potential 6

Lecture 16: Scattering States and the Step Potential. 1 The Step Potential 1. 4 Wavepackets in the step potential 6 Lecture 16: Scattering States and the Step Potential B. Zwiebach April 19, 2016 Contents 1 The Step Potential 1 2 Step Potential with E>V 0 2 3 Step Potential with E

More information

Chaotic Coupled Map Lattices

Chaotic Coupled Map Lattices Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each

More information

12 Towards hydrodynamic equations J Nonlinear Dynamics II: Continuum Systems Lecture 12 Spring 2015

12 Towards hydrodynamic equations J Nonlinear Dynamics II: Continuum Systems Lecture 12 Spring 2015 18.354J Nonlinear Dynaics II: Continuu Systes Lecture 12 Spring 2015 12 Towards hydrodynaic equations The previous classes focussed on the continuu description of static (tie-independent) elastic systes.

More information

Non-Parametric Non-Line-of-Sight Identification 1

Non-Parametric Non-Line-of-Sight Identification 1 Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,

More information

U V. r In Uniform Field the Potential Difference is V Ed

U V. r In Uniform Field the Potential Difference is V Ed SPHI/W nit 7.8 Electric Potential Page of 5 Notes Physics Tool box Electric Potential Energy the electric potential energy stored in a syste k of two charges and is E r k Coulobs Constant is N C 9 9. E

More information

Understanding Machine Learning Solution Manual

Understanding Machine Learning Solution Manual Understanding Machine Learning Solution Manual Written by Alon Gonen Edited by Dana Rubinstein Noveber 17, 2014 2 Gentle Start 1. Given S = ((x i, y i )), define the ultivariate polynoial p S (x) = i []:y

More information

National 5 Summary Notes

National 5 Summary Notes North Berwick High School Departent of Physics National 5 Suary Notes Unit 3 Energy National 5 Physics: Electricity and Energy 1 Throughout the Course, appropriate attention should be given to units, prefixes

More information

INNER CONSTRAINTS FOR A 3-D SURVEY NETWORK

INNER CONSTRAINTS FOR A 3-D SURVEY NETWORK eospatial Science INNER CONSRAINS FOR A 3-D SURVEY NEWORK hese notes follow closely the developent of inner constraint equations by Dr Willie an, Departent of Building, School of Design and Environent,

More information

All Excuses must be taken to 233 Loomis before 4:15, Monday, April 30.

All Excuses must be taken to 233 Loomis before 4:15, Monday, April 30. Miscellaneous Notes he end is near don t get behind. All Excuses ust be taken to 233 Loois before 4:15, Monday, April 30. he PHYS 213 final exa ties are * 8-10 AM, Monday, May 7 * 8-10 AM, uesday, May

More information

Fairness via priority scheduling

Fairness via priority scheduling Fairness via priority scheduling Veeraruna Kavitha, N Heachandra and Debayan Das IEOR, IIT Bobay, Mubai, 400076, India vavitha,nh,debayan}@iitbacin Abstract In the context of ulti-agent resource allocation

More information

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation journal of coplexity 6, 459473 (2000) doi:0.006jco.2000.0544, available online at http:www.idealibrary.co on On the Counication Coplexity of Lipschitzian Optiization for the Coordinated Model of Coputation

More information

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes

More information

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering

More information

A Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science

A Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science A Better Algorith For an Ancient Scheduling Proble David R. Karger Steven J. Phillips Eric Torng Departent of Coputer Science Stanford University Stanford, CA 9435-4 Abstract One of the oldest and siplest

More information

CS Lecture 13. More Maximum Likelihood

CS Lecture 13. More Maximum Likelihood CS 6347 Lecture 13 More Maxiu Likelihood Recap Last tie: Introduction to axiu likelihood estiation MLE for Bayesian networks Optial CPTs correspond to epirical counts Today: MLE for CRFs 2 Maxiu Likelihood

More information

Chapter 6 1-D Continuous Groups

Chapter 6 1-D Continuous Groups Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:

More information

Physically Based Modeling CS Notes Spring 1997 Particle Collision and Contact

Physically Based Modeling CS Notes Spring 1997 Particle Collision and Contact Physically Based Modeling CS 15-863 Notes Spring 1997 Particle Collision and Contact 1 Collisions with Springs Suppose we wanted to ipleent a particle siulator with a floor : a solid horizontal plane which

More information

Physics 215 Winter The Density Matrix

Physics 215 Winter The Density Matrix Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it

More information

Controlled Flooding Search with Delay Constraints

Controlled Flooding Search with Delay Constraints Controlled Flooding Search with Delay Constraints Nicholas B. Chang and Mingyan Liu Departent of Electrical Engineering and Coputer Science University of Michigan, Ann Arbor, MI 4809-222 Eail: {changn,ingyan}@eecs.uich.edu

More information

Momentum. February 15, Table of Contents. Momentum Defined. Momentum Defined. p =mv. SI Unit for Momentum. Momentum is a Vector Quantity.

Momentum. February 15, Table of Contents. Momentum Defined. Momentum Defined. p =mv. SI Unit for Momentum. Momentum is a Vector Quantity. Table of Contents Click on the topic to go to that section Moentu Ipulse-Moentu Equation The Moentu of a Syste of Objects Conservation of Moentu Types of Collisions Collisions in Two Diensions Moentu Return

More information

Tactics Box 2.1 Interpreting Position-versus-Time Graphs

Tactics Box 2.1 Interpreting Position-versus-Time Graphs 1D kineatic Retake Assignent Due: 4:32p on Friday, October 31, 2014 You will receive no credit for ites you coplete after the assignent is due. Grading Policy Tactics Box 2.1 Interpreting Position-versus-Tie

More information

Chapter 1: Basics of Vibrations for Simple Mechanical Systems

Chapter 1: Basics of Vibrations for Simple Mechanical Systems Chapter 1: Basics of Vibrations for Siple Mechanical Systes Introduction: The fundaentals of Sound and Vibrations are part of the broader field of echanics, with strong connections to classical echanics,

More information

Chapter 10 Objectives

Chapter 10 Objectives Chapter 10 Engr8 Circuit Analysis Dr Curtis Nelson Chapter 10 Objectives Understand the following AC power concepts: Instantaneous power; Average power; Root Mean Squared (RMS) value; Reactive power; Coplex

More information

Topic 5a Introduction to Curve Fitting & Linear Regression

Topic 5a Introduction to Curve Fitting & Linear Regression /7/08 Course Instructor Dr. Rayond C. Rup Oice: A 337 Phone: (95) 747 6958 E ail: rcrup@utep.edu opic 5a Introduction to Curve Fitting & Linear Regression EE 4386/530 Coputational ethods in EE Outline

More information

Pattern Recognition and Machine Learning. Artificial Neural networks

Pattern Recognition and Machine Learning. Artificial Neural networks Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lessons 7 20 Dec 2017 Outline Artificial Neural networks Notation...2 Introduction...3 Key Equations... 3 Artificial

More information

Interactive Markov Models of Evolutionary Algorithms

Interactive Markov Models of Evolutionary Algorithms Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary

More information

Solutions of some selected problems of Homework 4

Solutions of some selected problems of Homework 4 Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next

More information

Optimal Jamming Over Additive Noise: Vector Source-Channel Case

Optimal Jamming Over Additive Noise: Vector Source-Channel Case Fifty-first Annual Allerton Conference Allerton House, UIUC, Illinois, USA October 2-3, 2013 Optial Jaing Over Additive Noise: Vector Source-Channel Case Erah Akyol and Kenneth Rose Abstract This paper

More information