The Implicit Function Theorem with Applications in Dynamics and Control
|
|
- Kerrie Page
- 5 years ago
- Views:
Transcription
1 48th AIAA Aerospace Sciences Meeting Including the New Horizons Forum and Aerospace Exposition 4-7 January 2010, Orlando, Florida AIAA The Implicit Function Theorem with Applications in Dynamics and Control Matthew Harris and John Valasek Texas A&M University, College Station, TX The implicit function theorem is a statement of the existence, continuity, and differentiability of a function or set of functions. The theorem is closely related to the convergence of Newton s method for nonlinear equations, the existence and uniqueness of solutions to nonlinear differential equations, and the sensitivity of solutions to these nonlinear problems. The implicit function theorem is presented, and high order sensitivity equations are generated using implicit differentiation. Once a nominal solution is known, these sensitivities are used to construct a family of neighboring solutions. Based on results presented in the paper, the implicit function approach shows great promise compared with current methods in generating families of neighboring solutions to problems in dynamics and control. Nomenclature a b C D E e H J M O p q R r s S y t u V x y y z Open-loop plant Control coefficient Class of continuous functions Horizontal displacement Eccentric anomaly Orbit eccentricity Hamiltonian Performance index or cost function Mean anomaly Error function Independent parameter State weighting coefficient Set of all real numbers Control weighting coefficient Scalar solution to Riccati equation Final state weight Time Control variable Horizontal velocity State variable State variable State vector Vector of states and costates Graduate Research Assistant, Vehicle Systems and Control Laboratory, Texas A&M University, Aerospace Engineering Department, Student Member AIAA. m harris@tamu.edu. Associate Professor and Director, Vehicle Systems and Control Laboratory, Texas A&M University, Aerospace Engineering Department, Associate Fellow AIAA. valasek@tamu.edu. 1 of 11 Copyright 2010 by Matthew Harris. Published by the American American Institute Institute of Aeronautics of Aeronautics and Astronautics, andinc., Astronautics with permission.
2 Greek Finite difference δ Differential neighborhood η Differential neighborhood Θ Constraint vector function θ Constraint function Λ Costate vector λ Costate variable Φ State transition matrix ψ Constraint function Subscript 0 Nominal solution, initial time 1 First variable 2 Second variable f Final time Superscript k Index n Index Nominal solution I. Introduction The implicit function theorem has many uses in theory, applied mathematics, and engineering. It is related to the convergence of Newton s method for nonlinear equations and the theoretical foundations of nearly all algorithms for solving nonlinear differential equations. 1 3 More important to the purpose here, the theorem is related to methods of implicit differentiation. 4, 5 Engineers at Texas A&M University have recognized that this concept can be generalized to arrive at high order sensitivity equations for algebraic and differential equations. 1 Once a nominal solution is known, these sensitivities allow the construction of a family of neighboring solutions. This has great potential in orbital mechanics and trajectory design where optimal control simulations may take 12 hours or more. As opposed to current methods where each neighboring solution must be recalculated, the implicit function approach can generate numerous solutions in a fraction of the time. The generalizations made at Texas A&M University yield new results and algorithms in the fields of dynamics and control. 1 There are, however, important results in the literature today closely related to the implicit function theorem. The Classical Davidenko Homotopy Method uses the theorem to solve nonlinear optimization problems and multi-dimensional root solving problems. 6, 7 Neighboring optimal control problems using perturbation guidance schemes also invoke results of the implicit function theorem. 8, 9 Malanowski and Maurer used the theorem to investigate parameter variations in constrained optimal control problems, 10, 11 and Pinho and Rosenblueth utilized the theorem to transform a constrained optimal control problem into an unconstrained optimal control problem. 12 In light of these theoretical and computational advances, it is important to place these methods in a common theoretical framework, investigate the high order sensitivities, and to develop more general methods which enable computation of extremal field maps for neighboring optimal trajectories. 1 A basic form of the implicit function theorem is presented to illuminate the necessary conditions under which further analysis is carried out and to concisely present the results of the theorem. Generalized implicit differentiation is performed to arrive at the high order sensitivities, which help form a Taylor series approximation of neighboring solutions. Three examples of increasing complexity are worked in detail to illustrate the theory, method, and effectiveness of the implicit function approach. The first example is a nonlinear algebraic root solving problem. This is followed with applications to the nonlinear Riccati differential equation and an optimal control problem. 2 of 11
3 II. The Implicit Function Theorem The implicit function theorem is a statement of the existence, continuity, and differentiability of a function or set of functions. The original theorem, now known as the Lagrange inversion theorem, was used to solve Kepler s Equation, E = M + esin(e), (1) 7, 13 where M is the mean anomaly, E is the eccentric anomaly, and e is the eccentricity of the orbit. The theorem gave a formula for the correction that must be made when, for some function ψ( ), ψ(m) is replaced by ψ(e). Lagrange s proof of his theorem followed the formal power series argument, and Cauchy was the first to write the theorem in a form that is known today as the implicit function theorem. 7 More recently, others such as Dini, 7 Goursat, 4 Young, 5 and Widder 14 have given proofs of the implicit function theorem rooted in differential calculus. That is, the proofs rely on Rolle s theorem, the law of the mean, and small neighborhoods of continuity around a nominal solution. The theorem can apply to vector functions of any number of independent and dependent variables. In fact, the theorem has been generalized to many different forms involving different spaces, mappings, hypotheses, 7, and conclusions. A very sophisticated version of the theorem is the late John Nash s claim to fame. For simplicity, the theorem is presented here without proof for a single scalar function in one independent variable and one dependent variable. The presentation is basically that given by Widder. 14 Clear expositions of the more general cases are given by Goursat 4 and Young. 5 The hypotheses of the theorem are enumerated by 1, 2, and 3, and the conclusions by A, B, and C. Theorem 1 (Implicit Function Theorem). Let ψ(p, x) be a function with continuous first derivatives in a δ- neighborhood of a known solution (p 0, x 0 ) where ψ(p 0, x 0 ) = 0. Furthermore, let the Jacobian ψ x (p 0, x 0 ) ψ(p, x) C 1, p p 0 δ, x x 0 δ 2. ψ(p 0, x 0 ) = 0 3. ψ x (p 0, x 0 ) 0 Then, there exists a continuous function x(p) and a positive number η such that A. x 0 = x(p 0 ) B. ψ(p, x(p)) = 0, p p 0 < η C. x(p) C 1, p p 0 < η. Because of the existence, continuity, and differentiability of the function x(p), implicit differentiation can be carried out on ψ treating p as the independent variable and x as the dependent variable. The first k derivatives are below. dψ dp = ψ p + ψ x d 2 ψ dp 2 d k ψ dp k = = 2 ψ p p ψ x p. ( p + dx dp ( ) dx = 0 (2a) dp ( ) dx + 2 ψ dp x x ( ) 2 dx + ψ dp x ( d 2 ) x dp 2 = 0 (2b) ) k ψ = 0 (2c) x In Eq. (2c), algebraic notation has been used to simplify the differentiation process. Goursat 4 and Young 5 both introduce this notation. Basically, the derivative terms in parenthesis are treated as algebraic quantities that can be expanded to higher powers as if expanding to a higher order polynomial. One can then rearrange 3 of 11
4 Eqs. (2a)-(2c) to obtain dx dp = d 2 x dp 2 = ( ) 1 ψ ψ x p ( ) [ 1 ψ x 2 ψ p p ψ x p ( ) dx + 2 ψ dp x x ( ) ] 2 dx dp (3a) (3b). d k x dp k = ( ) 1 [ ψ k ψ x p k +... ]. (3c) These equations represent the sensitivity of the dependent variable, x, with respect to the independent parameter, p. Thus, for small variations in p, denoted by p, a Taylor series can be used to generate neighboring solutions to ψ(p 0, x 0 ) = 0. The Taylor series is given by x(p) = x(p 0 ) + k d n x dp n n=1 (p0,x 0 ) p n n! + O ( p k+1). (4) III. Numerical Examples Three examples are given in detail to illustrate the theory, method, and effectiveness of the implicit function theorem approach. The first example is a scalar algebraic root solving problem in a single variable. It uses the exact equations derived above. The second example examines the Riccati differential equation, shows how to compute derivatives from a differential equation, and computes sensitivities and approximations with respect to the open-loop plant, a. The final example is an optimal control problem with free-final-state and final-state weighting terms in the cost function. Again, the nominal solution is given, and the derivatives, sensitivities, and Taylor series approximations are derived. A. Nonlinear Algebraic Root Solving Problem Consider the nonlinear equation ψ(p, x) = x 3 cos(px) = 0. (5) Setting p 0 = 1, one can find a nominal solution to the root solving problem by Newton s Method. 19 (p 0, x 0 ) = (1, ) (6) Now that a nominal solution is known, the interest shifts to studying how the solution changes with respect to small changes in p. As stated before, the Taylor series approximation contains sensitivities calculated through implicit differentiation guaranteed by the implicit function theorem. Clearly, the three hypothesis of the theorem hold for this problem. The first and second order sensitivities evaluated at the nominal solution are calculated below. d 2 x dp 2 = dx dp = ( ) 1 ψ ψ x p ( ) [ 1 ψ 2 ψ x p p ψ x p (7a) = (7b) ( ) dx + 2 ψ dp x x ( ) ] 2 dx dp (8a) = (8b) If p increases to p 1 = 1.1 such that p = p 1 p 0 =.1, (9) 4 of 11
5 then a neighboring solution computed via Newton s method is (p 1, x 1 ) = (1.1, ). (10) The point here, however, is that numerous iterations with Newton s method are unnecessary. A first order Taylor series approximation gives x 1 (p = 1.1) = x(p 0 ) + dx dp p + O ( p 2) (11a) (p0,x 0 ) A second order approximation is indeed a better approximation. x 1 (p = 1.1) = x(p 0 ) + dx p + d2 x dp dp 2 = (11b) (p0,x 0 ) (p0,x 0 ) p O ( p 3) (12a) = (12b) The absolute error associated with the first-order approximation is less than 3 (10 4 ). The absolute error associated with the second-order approximation is less than 4.5 (10 5 ). B. Scalar Riccati Differential Equation One of the most important equations in linear control systems is the Riccati differential equation. The equation arises in linear quadratic regulator problems with a free-final-state. The problem investigated here is inspired by Junkins. 1 In the scalar case, the cost function is min J = 1 2 s f x 2 (t f ) tf t 0 qx 2 + ru 2 dt, (13) where s f is the final state weighting term (and solution to the Riccati equation at the final time), t 0 is the initial time, t f is the final time, x is the state variable, u is the control variable, and q and r are the state and control weighting terms. The additional boundary condition arising from the free-final-state 9 relates the final costate, λ, and final state, and takes the form λ(t f ) = s f x(t f ). (14) Assuming a linear relationship like above and using the sweep method, one can arrive at a differential equation in s and t that must be solved backward in time. ṡ = 2as + b2 r s2 q, s(t f ) = s f (15) In this particular case, an analytical solution for s(t) can be found using the separation of variables technique. 9 Nonetheless, the differential equation and its matrix counterpart are frequently solved numerically. If there are small variations in system parameters, e.g., the plant, a, then the equation must be solved again. As an example, such a change may occur if the system mass changes. Using the implicit function approach, the differential equation must only be solved once; and, as long as the variations in the parameters are small, a Taylor series can approximate the neighboring solutions. If a is considered as the only independent parameter, then ṡ = f(a, s, t), (16) and a nominal solution is s(a 0, t). The sensitivities that make up the Taylor series approximation will be of the form ds/da, d 2 s/da 2, etc. Differentiating Eq. (16) with respect to a gives [ ] d ds = d [ ] f(a, s(a), t) (17a) da dt da = d dt = f a + f s [ ] ds = 2s + da ds da ( 2a + 2 b2 r s (17b) ) ( ) ds, (17c) da 5 of 11
6 where all of the derivatives are evaluated at the nominal solution. Also, the fact that cross derivatives are equal when f C 2 has been employed to move from (a) to (c). 14 It is clear from Eq. (17c) that when applying the implicit function theorem to a differential equation, the sensitivities are themselves differential equations. In this case, the first order sensitivity given by Eq. (17c) must be solved backward in time with the boundary condition ds da (t f ) = 0. (18) The first-order Taylor series approximation is s(a, t) = s(a 0, t) + ds da a + O ( a 2), (19) (a0,s 0 ) where, again, each term in the series is a numeric solution to a differential equation. In this example, the nominal parameters are a 0 = 1, b = 1, r = 2, q = 10, (20) t f = 5, s f = 15, (21) and the plant is varied between.5 and 1.5. Using Euler s method to perform the integration, the nominal solution and neighboring solutions were generated in MATLAB. Results appear in Figure 1. The nominal solution is given by a solid blue line, the recomputed neighboring solutions by dashed lines, and neighboring solutions derived from the implicit function theorem by circles Nominal Solution Exact Neighboring Solution Approximate Neighboring Solution s(a,t) Time Figure 1. The nominal and neighboring solutions to the scalar Riccati differential equation. Figure 2 shows the absolute error of s(t 0 ) with respect to variations in the parameter a. The graph shows the expected radial divergence that is associated with Taylor series. 6 of 11
7 Error in s(t 0 ) Parameter Variation Figure 2. Absolute error in s(t 0 ) associated with the implicit approximation. C. Optimal Control Problem with Final State Weighting This example is significantly more challenging than the previous problems since it treats the vector case. Consider a simple rendezvous/intercept problem. A pursuit vehicle, S 1, has relative vertical position, y 1, and vertical velocity, y 2, with respect to a target vehicle, S t. Initially, the target vehicle is a distance D downrange, and the pursuit vehicle moves with constant relative velocity, V, toward to the target vehicle in the x-direction. Figure 3 illustrates this scenario. Figure 3. The pursuit and target relative positions in the x-y 1 plane. Because the relative velocity in the x-direction is constant, the final time is fixed. t f = t 0 + D V (22) The states capture the vertical dynamics of the problem, 1 = y 2, y 1 (t 0 ) = y 10, (23) 2 = u, y 2 (t 0 ) = y 20, (24) 7 of 11
8 where u is the vertical control input acceleration. A performance index which minimizes the control energy is min J = 1 2 p 1S y1 y p 2S y2 y tf t 0 u 2 dt, (25) where S y1 and S y2 are final state weighting terms, and p 1 and p 2 are the independent parameters attached to these weights. Once a nominal solution is known, neighboring solutions can be generated for small variations in p, and hence S y. For an intercept problem, S y1 is made large and S y2 is set to zero. In other words, there is no preference toward velocity at the final time. For a rendezvous problem, both S y1 and S y2 are made large. Lewis and Syrmos provide a more rigorous exposition of the problem statement and nominal solution. 9 The requirement of the controller, u, is to minimize the cost function, J, while satisfying the dynamic constraints. The state variables are y 1 and y 2, the initial time is t 0, the fixed final time is t f, and the parameters p 1 and p 2 are fixed but can be chosen by the engineer. In the nominal case, p 1 = p 2 = 1. A numerical solution involves a shooting method where one has to use optimizers to solve for the initial costate vector. 8, 9 In such a situation, even if there are small variations in any of the parameters, the optimization problem must be solved all over again. The purpose here is to employ the implicit function theorem so that once a nominal solution is known, neighboring solutions can be easily generated without re-solving the optimal control problem. The Hamiltonian for this system is and the necessary conditions for minimization are H 1 2 u2 + λ 1 y 2 + λ 2 u, (26) 1 = H = y 2, λ 1 2 = H = u, λ 2 λ 1 = H y 1 = 0, (27) λ 2 = H y 2 = λ 1, (28) 0 = H u = u + λ 2. (29) Furthermore, an additional free-final-state condition must be satisfied. 9 Θ(t f ) Θ 1(t f ) = λ 1(t f ) p 1 S y1 y 1 (t f ) = 0 (30) Θ 2 (t f ) λ 2 (t f ) p 2 S y2 y 2 (t f ) Solving for the control and substituting into the state and costate equations yields the homogeneous Hamiltonian system = λ λ 2 The coefficient matrix is called the continuous Hamiltonian matrix, and solution of this matrix differential equation via the matrix exponential function gives y 1 y 2 λ 1 λ 2 (31) z(t) = Φz(t 0 ), (32) where Φ is the state transition matrix. The column vector of states and costates is denoted by z. Solution of this system depends on the initial costates, which, in turn, are functions of the parameters p 1 and p 2. Thus, the purpose of the implicit function theorem is to determine how the initial costates depend on these parameters. Once this is done and a nominal solution is known, the implicit function approach can generate neighboring solutions without re-solving the optimal control problem. 8 of 11
9 The desired Taylor series should take the form Λ(p, t 0 ) = Λ(p, t 0 ) + dλ(t 0) dp 1 p p 1 + dλ(t 0) dp 2 where the vector quantities have been introduced to simplify notation. p 2 + O ( p 2), (33) p Λ = [λ 1 λ 2 ] T p = [p 1 p 2 ] T (34) The first task is to compute the sensitivities dλ/dp 1 and dλ/dp 2. Because the number of dependent variables is two, i.e., Λ R 2, two functions are required to use the implicit function theorem. The free-final-state condition, Θ(t f ), provides both. Employing the multi-variable form of the implicit function theorem gives dλ(t 0 ) dp 1 dλ(t 0 ) dp 2 [ ] 1 Θ(tf ) Θ(t f ) =, (35) Λ(t 0 ) p 1 [ ] 1 Θ(tf ) Θ(t f ) =. (36) Λ(t 0 ) p 2 The only necessary condition is that the Jacobian, Θ(t f )/ Λ(t 0 ), be full rank. In this case, the Jacobian is a 2x2 matrix. The requisite derivatives are below, Θ 1 (t f ) y(t f ) y(t f ) Λ(t 0 ) + Θ 1(t f ) Λ(t f ) Θ 1 (t f ) Λ(t f ) Λ(t 0 ) y(t f ) Φ 12 + Θ 1(t f ) Λ(t f ) Φ 22 dθ(t f ) dλ(t 0 ) = =, (37) Θ 2 (t f ) y(t f ) y(t f ) Λ(t 0 ) + Θ 2(t f ) Λ(t f ) Θ 2 (t f ) Λ(t f ) Λ(t 0 ) y(t f ) Φ 12 + Θ 2(t f ) Λ(t f ) Φ 22 dθ(t f ) dp 1 = S y 1 (t f )y 1 (t f ), 0 dθ(t f ) dp 2 = 0, (38) S y2 (t f )y 2 (t f ) where Φ 12 and Φ 22 are the upper right and lower right square partitions of the state transition matrix Φ. Using MATLAB, an optimal solution for the nominal conditions was generated. y 10 = 500 m, y 20 = 50 m/s, D = 500 m, V = 100 m/s, t 0 = 0 s, (39) S y1 = 250, S y2 = 250 (40) Neighboring solutions with p 1 [.9 1.1] and p 2 = 1 were also generated with MATLAB and by implicit approximation. This corresponds to variations in S y1 [ ]. The results appear in Figures 4 and 5. The complete nominal solution appears in Figure 4 as a solid blue curve. Figure 5 shows only the final moments of the trajectory. The nominal solution appears as a blue curve, the re-computed neighboring solutions appear as red curves, and the circle markers denote the implicitly approximated neighboring solutions. For larger values of S y1, the state is driven closer to zero. The absolute error on Λ(t 0 ) associated with the implicit approximation is less that 6 (10 3 ). 9 of 11
10 Relative Altitude, y 1 (m) Time (s) Figure 4. Nominal solution to the optimal control problem with final-state weighting Nominal Solution Exact Neighboring Solutions Approximate Neighboring Solutions Relative Altitude, y1 (m) Time (s) Figure 5. Nominal and neighboring solutions near final time for the optimal control problem with final-state weighting. 10 of 11
11 IV. Summary and Future Work A basic version of the implicit function theorem rooted in differential calculus was presented, and implicit differentiation led to high order sensitivity equations with respect to independent parameters. These sensitivities allowed construction of a family of neighboring solutions once a nominal solution was known. This implicit function method was applied to three representative problems: a scalar nonlinear root solving problem, the nonlinear Riccati differential equation, and an optimal control problem (two point boundary value problem). All results obtained by the implicit function method agree to plotting accuracy with recomputed solutions. For the simple algebraic root solving problem, a first-order implicit function approach approximates a neighboring root with less than 3 (10 4 ) absolute error. The nonlinear Riccati differential equation and optimal control examples illustrated the flexibility and accuracy of the method, and error plots demonstrated the radial divergence associated with the Taylor series approximations. The results presented here are promising, and it is expected that generalizations of the implicit function theorem are likely to have a favorable impact on a wide class of trajectory generation and optimal control problems. This paper presents merely a starting place. Future work includes generalizations to higher dimensions, more complex optimal control problems, and trajectory design and optimization. Of particular interest are applications to the lunar ascent and descent phases of lunar trajectory design and mission planning. Acknowledgments The authors wish to acknowledge the support of NASA Johnson Space Center under award no. C The technical monitor is Lee Bryant. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Aeronautics and Space Administration. References 1 Junkins, J., Majji, M., and Turner, J., Generalizations and Applications of the Lagrange Implicit Function Theorem, AAS Hubbard, J. and Hubbard, B., Vector Analysis, Linear Algebra, and Differential Forms: A Unified Approach, Matrix Editions, Bellman, R. and Cooke, K., Modern Elementary and Differential Equations, Dover Publications, Inc., Goursat, E., A Course in Mathematical Analysis, Ginn and Company, Young, W., The Fundamental Theorems of Differential Calculus, Cambridge University Press, Dunyak, J., Junkins, J., and Watson, L., Robust Nonlinear Least Squares Estimation Using the Chow-Yorke Homotopy Method, Journal of Guidance, Control and Dynamics, Krantz, S. and Parks, H., The Implicit Function Theorem: History, Theory and Applications, Birkhauser, Bryson, A. and Ho, Y., Applied Optimal Control: Optimization, Estimation, and Control, Hemisphere Publishing Corp., Lewis, F. and Syrmos, V., Optimal Control, John Wiley and Sons, Inc., Malanowski, K. and Maurer, H., Sensitivity Analysis for Parametric Control Problems with Control State Constraints, Computational Optimization and Applications, Malanowski, K. and Maurer, H., Sensitivity Analysis for Optimal Control Problems Subject to Higher Order State Constraints, Annals of Operations Research, Pinho, M. D. and Rosenblueth, J., Mixed Constraints in Optimal Control: An Implicit Function Theorem Approach, IMA Journal of Mathematical Control and Information, Bate, R., Mueller, D., and White, J., Fundamentals of Astrodynamics, Dover Publications, Inc., Widder, D., Advanced Calculus, Dover Publications, Inc., Hamilton, R., The Inverse Function Theorem of Nash and Mosher, Bulletin of the American Mathematical Society, Hormander, L., Implicit Function Theorems, Lectures at Stanford University. 17 Jittorntrum, K., Technical Note: An Implicit Function Theorem, Journal of Optimization Theory and Applications, Kumagai, S., Technical Comment: An Implicit Function Theorem, Journal of Optimization Theory and Applications, Stewart, J., Calculus Early Vectors, Thomson Brooks/Cole Publishing Co., of 11
HIGH-ORDER STATE FEEDBACK GAIN SENSITIVITY CALCULATIONS USING COMPUTATIONAL DIFFERENTIATION
(Preprint) AAS 12-637 HIGH-ORDER STATE FEEDBACK GAIN SENSITIVITY CALCULATIONS USING COMPUTATIONAL DIFFERENTIATION Ahmad Bani Younes, James Turner, Manoranjan Majji, and John Junkins INTRODUCTION A nonlinear
More informationFeedback Optimal Control of Low-thrust Orbit Transfer in Central Gravity Field
Vol. 4, No. 4, 23 Feedback Optimal Control of Low-thrust Orbit Transfer in Central Gravity Field Ashraf H. Owis Department of Astronomy, Space and Meteorology, Faculty of Science, Cairo University Department
More informationBézier Description of Space Trajectories
Bézier Description of Space Trajectories Francesco de Dilectis, Daniele Mortari, Texas A&M University, College Station, Texas and Renato Zanetti NASA Jonhson Space Center, Houston, Texas I. Introduction
More informationExtending the Patched-Conic Approximation to the Restricted Four-Body Problem
Monografías de la Real Academia de Ciencias de Zaragoza 3, 133 146, (6). Extending the Patched-Conic Approximation to the Restricted Four-Body Problem Thomas R. Reppert Department of Aerospace and Ocean
More informationOPTIMIZING PERIAPSIS-RAISE MANEUVERS USING LOW-THRUST PROPULSION
AAS 8-298 OPTIMIZING PERIAPSIS-RAISE MANEUVERS USING LOW-THRUST PROPULSION Brenton J. Duffy and David F. Chichka This study considers the optimal control problem of maximizing the raise in the periapsis
More informationTwo-Point Boundary Value Problem and Optimal Feedback Control based on Differential Algebra
Two-Point Boundary Value Problem and Optimal Feedback Control based on Differential Algebra Politecnico di Milano Department of Aerospace Engineering Milan, Italy Taylor Methods and Computer Assisted Proofs
More informationKeywords: Kinematics; Principal planes; Special orthogonal matrices; Trajectory optimization
Editorial Manager(tm) for Nonlinear Dynamics Manuscript Draft Manuscript Number: Title: Minimum Distance and Optimal Transformations on SO(N) Article Type: Original research Section/Category: Keywords:
More informationStatic and Dynamic Optimization (42111)
Static and Dynamic Optimization (421) Niels Kjølstad Poulsen Build. 0b, room 01 Section for Dynamical Systems Dept. of Applied Mathematics and Computer Science The Technical University of Denmark Email:
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 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 informationAP Calculus BC Syllabus
AP Calculus BC Syllabus Course Overview and Philosophy This course is designed to be the equivalent of a college-level course in single variable calculus. The primary textbook is Calculus, 7 th edition,
More informationActive Flutter Control using an Adjoint Method
44th AIAA Aerospace Sciences Meeting and Exhibit 9-12 January 26, Reno, Nevada AIAA 26-844 44th AIAA Aerospace Sciences Meeting and Exhibit, Reno, Nevada, 9 12 Jan, 26. Active Flutter Control using an
More informationAdaptive Dynamic Inversion Control of a Linear Scalar Plant with Constrained Control Inputs
5 American Control Conference June 8-, 5. Portland, OR, USA ThA. Adaptive Dynamic Inversion Control of a Linear Scalar Plant with Constrained Control Inputs Monish D. Tandale and John Valasek Abstract
More informationEffect of Coordinate Switching on Translunar Trajectory Simulation Accuracy
Effect of Coordinate Switching on Translunar Trajectory Simulation Accuracy Mana P. Vautier Auburn University, Auburn, AL, 36849, USA This paper focuses on the affect of round-off error in the accurate
More informationA Robust Controller for Scalar Autonomous Optimal Control Problems
A Robust Controller for Scalar Autonomous Optimal Control Problems S. H. Lam 1 Department of Mechanical and Aerospace Engineering Princeton University, Princeton, NJ 08544 lam@princeton.edu Abstract Is
More information13 th AAS/AIAA Space Flight Mechanics Meeting
Paper AAS 3-117 Minimum-Time Orbital Phasing Maneuvers Christopher D. Hall and Victor Collazo Perez Aerospace and Ocean Engineering Virginia Polytechnic Institute and State University Blacksburg, Virginia
More informationLYAPUNOV-BASED ELLIPTICAL TO CIRCULAR PLANAR ORBIT TRANSFERS IN LEVI-CIVITA COORDINATES
(Preprint) AAS 2-66 LYAPUNOV-BASED ELLIPTICAL TO CIRCULAR PLANAR ORBIT TRANSFERS IN LEVI-CIVITA COORDINATES Sonia Hernandez, Maruthi R. Akella, and Cesar A. Ocampo INTRODUCTION We consider planar orbit
More informationGENERALIZATIONS AND APPLICATIONS OF THE LAGRANGE IMPLICIT FUNCTION THEOREM
AAS 8-3 GENERALIZATIONS AND APPLICATIONS OF THE LAGRANGE IMPLICIT FUNCTION THEOREM John L. Junkins *, James D. Turner, Manoranjan Majji Dedicated to F. Landis Markley INTRODUCTION The Implicit unction
More informationAnalytical Mechanics. of Space Systems. tfa AA. Hanspeter Schaub. College Station, Texas. University of Colorado Boulder, Colorado.
Analytical Mechanics of Space Systems Third Edition Hanspeter Schaub University of Colorado Boulder, Colorado John L. Junkins Texas A&M University College Station, Texas AIM EDUCATION SERIES Joseph A.
More informationMath 234. What you should know on day one. August 28, You should be able to use general principles like. x = cos t, y = sin t, 0 t π.
Math 234 What you should know on day one August 28, 2001 1 You should be able to use general principles like Length = ds, Area = da, Volume = dv For example the length of the semi circle x = cos t, y =
More informationMULTIVARIABLE CALCULUS, LINEAR ALGEBRA, AND DIFFERENTIAL EQUATIONS
T H I R D E D I T I O N MULTIVARIABLE CALCULUS, LINEAR ALGEBRA, AND DIFFERENTIAL EQUATIONS STANLEY I. GROSSMAN University of Montana and University College London SAUNDERS COLLEGE PUBLISHING HARCOURT BRACE
More informationSuppose that we have a specific single stage dynamic system governed by the following equation:
Dynamic Optimisation Discrete Dynamic Systems A single stage example Suppose that we have a specific single stage dynamic system governed by the following equation: x 1 = ax 0 + bu 0, x 0 = x i (1) where
More informationNEAR-OPTIMAL FEEDBACK GUIDANCE FOR AN ACCURATE LUNAR LANDING JOSEPH PARSLEY RAJNISH SHARMA, COMMITTEE CHAIR MICHAEL FREEMAN KEITH WILLIAMS A THESIS
NEAR-OPTIMAL FEEDBACK GUIDANCE FOR AN ACCURATE LUNAR LANDING by JOSEPH PARSLEY RAJNISH SHARMA, COMMITTEE CHAIR MICHAEL FREEMAN KEITH WILLIAMS A THESIS Submitted in partial fulfillment of the requirements
More informationOPTIMAL SPACECRAF1 ROTATIONAL MANEUVERS
STUDIES IN ASTRONAUTICS 3 OPTIMAL SPACECRAF1 ROTATIONAL MANEUVERS JOHNL.JUNKINS Texas A&M University, College Station, Texas, U.S.A. and JAMES D.TURNER Cambridge Research, Division of PRA, Inc., Cambridge,
More informationSpace Surveillance with Star Trackers. Part II: Orbit Estimation
AAS -3 Space Surveillance with Star Trackers. Part II: Orbit Estimation Ossama Abdelkhalik, Daniele Mortari, and John L. Junkins Texas A&M University, College Station, Texas 7783-3 Abstract The problem
More informationACM/CMS 107 Linear Analysis & Applications Fall 2016 Assignment 4: Linear ODEs and Control Theory Due: 5th December 2016
ACM/CMS 17 Linear Analysis & Applications Fall 216 Assignment 4: Linear ODEs and Control Theory Due: 5th December 216 Introduction Systems of ordinary differential equations (ODEs) can be used to describe
More informationECE 516: System Control Engineering
ECE 516: System Control Engineering This course focuses on the analysis and design of systems control. This course will introduce time-domain systems dynamic control fundamentals and their design issues
More informationOptimization of Orbital Transfer of Electrodynamic Tether Satellite by Nonlinear Programming
Optimization of Orbital Transfer of Electrodynamic Tether Satellite by Nonlinear Programming IEPC-2015-299 /ISTS-2015-b-299 Presented at Joint Conference of 30th International Symposium on Space Technology
More informationCourse Outline. 2. Vectors in V 3.
1. Vectors in V 2. Course Outline a. Vectors and scalars. The magnitude and direction of a vector. The zero vector. b. Graphical vector algebra. c. Vectors in component form. Vector algebra with components.
More informationSubject: Optimal Control Assignment-1 (Related to Lecture notes 1-10)
Subject: Optimal Control Assignment- (Related to Lecture notes -). Design a oil mug, shown in fig., to hold as much oil possible. The height and radius of the mug should not be more than 6cm. The mug must
More informationOptimal Control. Quadratic Functions. Single variable quadratic function: Multi-variable quadratic function:
Optimal Control Control design based on pole-placement has non unique solutions Best locations for eigenvalues are sometimes difficult to determine Linear Quadratic LQ) Optimal control minimizes a quadratic
More informationOptimal Control. Lecture 18. Hamilton-Jacobi-Bellman Equation, Cont. John T. Wen. March 29, Ref: Bryson & Ho Chapter 4.
Optimal Control Lecture 18 Hamilton-Jacobi-Bellman Equation, Cont. John T. Wen Ref: Bryson & Ho Chapter 4. March 29, 2004 Outline Hamilton-Jacobi-Bellman (HJB) Equation Iterative solution of HJB Equation
More informationAN ANALYTICAL SOLUTION TO QUICK-RESPONSE COLLISION AVOIDANCE MANEUVERS IN LOW EARTH ORBIT
AAS 16-366 AN ANALYTICAL SOLUTION TO QUICK-RESPONSE COLLISION AVOIDANCE MANEUVERS IN LOW EARTH ORBIT Jason A. Reiter * and David B. Spencer INTRODUCTION Collision avoidance maneuvers to prevent orbital
More informationOptimal control problems with PDE constraints
Optimal control problems with PDE constraints Maya Neytcheva CIM, October 2017 General framework Unconstrained optimization problems min f (q) q x R n (real vector) and f : R n R is a smooth function.
More informationECE: Special Topics in Systems and Control. Optimal Control: Theory and Applications
ECE: Special Topics in Systems and Control Optimal Control: Theory and Applications Course #: 18879C/96840SV Semester: Fall 2012 Breadth Area: Artificial Intelligence, Robotics and Control Instructors:
More informationClassical Numerical Methods to Solve Optimal Control Problems
Lecture 26 Classical Numerical Methods to Solve Optimal Control Problems Dr. Radhakant Padhi Asst. Professor Dept. of Aerospace Engineering Indian Institute of Science - Bangalore Necessary Conditions
More informationSOLVING DIFFERENTIAL EQUATIONS
SOLVING DIFFERENTIAL EQUATIONS ARICK SHAO 1. Solving Ordinary Differential Equations Consider first basic algebraic equations with an unknown, e.g., 3(x + 2) = 18, 3x 2 = cos x. Such equations model some
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 informationTrajectory Optimization for Ascent and Glide Phases Using Gauss Pseudospectral Method
Trajectory Optimization for Ascent and Glide Phases Using Gauss Pseudospectral Method Abdel Mageed Mahmoud, Chen Wanchun, Zhou Hao, and Liang Yang Abstract The trajectory optimization method for ascent
More informationSpacecraft Trajectory Optimization. Edited. Bruce A. Conway. Published by Cambridge University Press 2010
Spacecraft Trajectory Optimization Edited by Bruce A. Conway Published by Cambridge University Press 2010 Cambridge University Press 2010 ISBN 978-0-521-51850-5 2 Primer Vector Theory and Applications
More informationOptimal Control. Lecture 3. Optimal Control of Discrete Time Dynamical Systems. John T. Wen. January 22, 2004
Optimal Control Lecture 3 Optimal Control of Discrete Time Dynamical Systems John T. Wen January, 004 Outline optimization of a general multi-stage discrete time dynamical systems special case: discrete
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 informationDesign and modelling of an airship station holding controller for low cost satellite operations
AIAA Guidance, Navigation, and Control Conference and Exhibit 15-18 August 25, San Francisco, California AIAA 25-62 Design and modelling of an airship station holding controller for low cost satellite
More informationLinear Quadratic Regulator (LQR) Design I
Lecture 7 Linear Quadratic Regulator LQR) Design I Dr. Radhakant Padhi Asst. Proessor Dept. o Aerospace Engineering Indian Institute o Science - Bangalore LQR Design: Problem Objective o drive the state
More informationAM 205: lecture 18. Last time: optimization methods Today: conditions for optimality
AM 205: lecture 18 Last time: optimization methods Today: conditions for optimality Existence of Global Minimum For example: f (x, y) = x 2 + y 2 is coercive on R 2 (global min. at (0, 0)) f (x) = x 3
More informationTime-Invariant Linear Quadratic Regulators!
Time-Invariant Linear Quadratic Regulators Robert Stengel Optimal Control and Estimation MAE 546 Princeton University, 17 Asymptotic approach from time-varying to constant gains Elimination of cross weighting
More informationDevelopment of a Discretized Model for the Restricted Three-Body Problem THESIS
Development of a Discretized Model for the Restricted Three-Body Problem THESIS Presented in Partial Fulfillment of the Requirements for the Degree Master of Science in the Graduate School of The Ohio
More informationBenefits of Preview Wind Information for Region 2 Wind Turbine Control
Benefits of Preview Wind Information for Region 2 Wind Turbine Control Ahmet Arda Ozdemir, Peter Seiler and Gary J Balas Department of Aerospace Engineering & Mechanics, University of Minnesota, Minneapolis,
More informationV Control Distance with Dynamics Parameter Uncertainty
V Control Distance with Dynamics Parameter Uncertainty Marcus J. Holzinger Increasing quantities of active spacecraft and debris in the space environment pose substantial risk to the continued safety of
More informationSolving Optimal Continuous Thrust Rendezvous Problems with Generating Functions
JOURNAL OF GUIDANCE, CONTROL, AND DYNAMICS Vol. 29, No. 2, March April 2006 Solving Optimal Continuous Thrust Rendezvous Problems with Generating Functions Chandeok Park, Vincent Guibout, and Daniel J.
More informationCS 450 Numerical Analysis. Chapter 9: Initial Value Problems for Ordinary Differential Equations
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationLecture Notes: Geometric Considerations in Unconstrained Optimization
Lecture Notes: Geometric Considerations in Unconstrained Optimization James T. Allison February 15, 2006 The primary objectives of this lecture on unconstrained optimization are to: Establish connections
More informationLecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 9
Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T. Heath Chapter 9 Initial Value Problems for Ordinary Differential Equations Copyright c 2001. Reproduction
More informationA SYMPLECTIC KEPLERIAN MAP FOR PERTURBED TWO-BODY DYNAMICS. Oier Peñagaricano Muñoa 1, Daniel J. Scheeres 2
AIAA/AAS Astrodynamics Specialist Conference and Exhibit 8 - August 008, Honolulu, Hawaii AIAA 008-7068 AIAA 008-7068 A SYMPLECTIC KEPLERIAN MAP FOR PERTURBED TWO-BODY DYNAMICS Oier Peñagaricano Muñoa,
More informationRADIALLY ADAPTIVE EVALUATION OF THE SPHERICAL HARMONIC GRAVITY SERIES FOR NUMERICAL ORBITAL PROPAGATION
AAS 15-440 RADIALLY ADAPTIVE EVALUATION OF THE SPHERICAL HARMONIC GRAVITY SERIES FOR NUMERICAL ORBITAL PROPAGATION Austin B. Probe, * Brent Macomber,* Julie I. Read,* Robyn M. Woollands,* and John L. Junkins
More informationRELATIVE NAVIGATION FOR SATELLITES IN CLOSE PROXIMITY USING ANGLES-ONLY OBSERVATIONS
(Preprint) AAS 12-202 RELATIVE NAVIGATION FOR SATELLITES IN CLOSE PROXIMITY USING ANGLES-ONLY OBSERVATIONS Hemanshu Patel 1, T. Alan Lovell 2, Ryan Russell 3, Andrew Sinclair 4 "Relative navigation using
More informationAsteroid Rendezvous Missions
Asteroid Rendezvous Missions An Application of Optimal Control G. Patterson, G. Picot, and S. Brelsford University of Hawai`i at Manoa 25 June, 215 1/5 G. Patterson, G. Picot, and S. Brelsford Asteroid
More informationMinimization with Equality Constraints
Path Constraints and Numerical Optimization Robert Stengel Optimal Control and Estimation, MAE 546, Princeton University, 2015 State and Control Equality Constraints Pseudoinverse State and Control Inequality
More informationThe Accelerator Hamiltonian in a Straight Coordinate System
Hamiltoninan Dynamics for Particle Accelerators, Lecture 2 The Accelerator Hamiltonian in a Straight Coordinate System Andy Wolski University of Liverpool, and the Cockcroft Institute, Daresbury, UK. Given
More informationCalculus from Graphical, Numerical, and Symbolic Points of View, 2e Arnold Ostebee & Paul Zorn
Calculus from Graphical, Numerical, and Symbolic Points of View, 2e Arnold Ostebee & Paul Zorn Chapter 1: Functions and Derivatives: The Graphical View 1. Functions, Calculus Style 2. Graphs 3. A Field
More informationAstrodynamics (AERO0024)
Astrodynamics (AERO0024) 5. Numerical Methods Gaëtan Kerschen Space Structures & Systems Lab (S3L) Why Different Propagators? Analytic propagation: Better understanding of the perturbing forces. Useful
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 9 Initial Value Problems for Ordinary Differential Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign
More informationNumerical Methods for Differential Equations Mathematical and Computational Tools
Numerical Methods for Differential Equations Mathematical and Computational Tools Gustaf Söderlind Numerical Analysis, Lund University Contents V4.16 Part 1. Vector norms, matrix norms and logarithmic
More informationEN Applied Optimal Control Lecture 8: Dynamic Programming October 10, 2018
EN530.603 Applied Optimal Control Lecture 8: Dynamic Programming October 0, 08 Lecturer: Marin Kobilarov Dynamic Programming (DP) is conerned with the computation of an optimal policy, i.e. an optimal
More informationDynamics and Control Preliminary Examination Topics
Dynamics and Control Preliminary Examination Topics 1. Particle and Rigid Body Dynamics Meirovitch, Leonard; Methods of Analytical Dynamics, McGraw-Hill, Inc New York, NY, 1970 Chapters 1-5 2. Atmospheric
More informationOptimization Tutorial 1. Basic Gradient Descent
E0 270 Machine Learning Jan 16, 2015 Optimization Tutorial 1 Basic Gradient Descent Lecture by Harikrishna Narasimhan Note: This tutorial shall assume background in elementary calculus and linear algebra.
More informationMINIMUM IMPULSE TRANSFERS TO ROTATE THE LINE OF APSIDES
AAS 05-373 MINIMUM IMPULSE TRANSFERS TO ROTATE THE LINE OF APSIDES Connie Phong and Theodore H. Sweetser While an optimal scenario for the general two-impulse transfer between coplanar orbits is not known,
More informationSecond-order optimality conditions for state-constrained optimal control problems
Second-order optimality conditions for state-constrained optimal control problems J. Frédéric Bonnans INRIA-Saclay & CMAP, Ecole Polytechnique, France Joint work with Audrey Hermant, INRIA-Saclay & CMAP
More informationChapter 3 Numerical Methods
Chapter 3 Numerical Methods Part 2 3.2 Systems of Equations 3.3 Nonlinear and Constrained Optimization 1 Outline 3.2 Systems of Equations 3.3 Nonlinear and Constrained Optimization Summary 2 Outline 3.2
More informationSyllabus For II nd Semester Courses in MATHEMATICS
St. Xavier s College Autonomous Mumbai Syllabus For II nd Semester Courses in MATHEMATICS Contents: (November 2016 onwards) Theory Syllabus for Courses: S.MAT.2.01 : Calculus II. S.MAT.2.02 : Linear Algebra.
More informationResearch Article Approximate Solutions to Nonlinear Optimal Control Problems in Astrodynamics
ISRN Aerospace Engineering Volume 213, Article ID 95912, 7 pages http://dx.doi.org/1.1155/213/95912 Research Article Approximate Solutions to Nonlinear Optimal Control Problems in Astrodynamics Francesco
More informationAlberto Bressan. Department of Mathematics, Penn State University
Non-cooperative Differential Games A Homotopy Approach Alberto Bressan Department of Mathematics, Penn State University 1 Differential Games d dt x(t) = G(x(t), u 1(t), u 2 (t)), x(0) = y, u i (t) U i
More informationChapter One. Introduction
Chapter One Introduction A system is a combination of components or parts that is perceived as a single entity. The parts making up the system may be clearly or vaguely defined. These parts are related
More informationStability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games
Stability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games Alberto Bressan ) and Khai T. Nguyen ) *) Department of Mathematics, Penn State University **) Department of Mathematics,
More informationNUMERICAL INTEGRATION OF CONSTRAINED MULTI-BODY DYNAMICAL SYSTEMS USING 5 T H ORDER EXACT ANALYTIC CONTINUATION ALGORITHM
(Preprint) AAS 12-638 NUMERICAL INTEGRATION OF CONSTRAINED MULTI-BODY DYNAMICAL SYSTEMS USING 5 T H ORDER EXACT ANALYTIC CONTINUATION ALGORITHM Ahmad Bani Younes, and James Turner Many numerical integration
More informationORBITAL CHARACTERISTICS DUE TO THE THREE DIMENSIONAL SWING-BY IN THE SUN-JUPITER SYSTEM
ORBITAL CHARACTERISTICS DUE TO THE THREE DIMENSIONAL SWING-BY IN THE SUN-JUPITER SYSTEM JORGE K. S. FORMIGA 1,2 and ANTONIO F B A PRADO 2 National Institute for Space Research -INPE 1 Technology Faculty-FATEC-SJC
More informationLinear Quadratic Regulator (LQR) I
Optimal Control, Guidance and Estimation Lecture Linear Quadratic Regulator (LQR) I Pro. Radhakant Padhi Dept. o Aerospace Engineering Indian Institute o Science - Bangalore Generic Optimal Control Problem
More informationApplications of Artificial Potential Function Methods to Autonomous Space Flight
Applications of Artificial Potential Function Methods to Autonomous Space Flight Sara K. Scarritt and Belinda G. Marchand AAS/AIAA Astrodynamics Specialist Conference July 31 - Aug. 4 2011 Girdwood, Alaska
More informationDifferentiation of Parametric Space Curves. Goals: Velocity in parametric curves Acceleration in parametric curves
Block #2: Differentiation of Parametric Space Curves Goals: Velocity in parametric curves Acceleration in parametric curves 1 Displacement in Parametric Curves - 1 Displacement in Parametric Curves Using
More informationANALYSIS OF VARIOUS TWO SYNODIC PERIOD EARTH-MARS CYCLER TRAJECTORIES
AIAA/AAS Astrodynamics Specialist Conference and Exhibit 5-8 August 2002, Monterey, California AIAA 2002-4423 ANALYSIS OF VARIOUS TWO SYNODIC PERIOD EARTH-MARS CYCLER TRAJECTORIES Dennis V. Byrnes Jet
More informationSyllabus for BC Calculus
Syllabus for BC Calculus Course Overview My students enter BC Calculus form an Honors Precalculus course which is extremely rigorous and we have 90 minutes per day for 180 days, so our calculus course
More informationORBITAL DECAY PREDICTION AND SPACE DEBRIS IMPACT ON NANO-SATELLITES
Journal of Science and Arts Year 16, No. 1(34), pp. 67-76, 2016 ORIGINAL PAPER ORBITAL DECAY PREDICTION AND SPACE DEBRIS IMPACT ON NANO-SATELLITES MOHAMMED CHESSAB MAHDI 1 Manuscript received: 22.02.2016;
More informationLinear Feedback Control Using Quasi Velocities
Linear Feedback Control Using Quasi Velocities Andrew J Sinclair Auburn University, Auburn, Alabama 36849 John E Hurtado and John L Junkins Texas A&M University, College Station, Texas 77843 A novel approach
More informationOPTIMAL CONTROL AND ESTIMATION
OPTIMAL CONTROL AND ESTIMATION Robert F. Stengel Department of Mechanical and Aerospace Engineering Princeton University, Princeton, New Jersey DOVER PUBLICATIONS, INC. New York CONTENTS 1. INTRODUCTION
More information1 Lyapunov theory of stability
M.Kawski, APM 581 Diff Equns Intro to Lyapunov theory. November 15, 29 1 1 Lyapunov theory of stability Introduction. Lyapunov s second (or direct) method provides tools for studying (asymptotic) stability
More informationCalculus. reparation for Calculus, Limits and Their Properties, and Differentiation. Gorman Learning Center (052344) Basic Course Information
Calculus Gorman Learning Center (052344) Basic Course Information Title: Calculus Transcript abbreviations: calcag / calc Length of course: Full Year Subject area: Mathematics ("c") / Calculus UC honors
More informationAP Calculus BC Syllabus Course Overview
AP Calculus BC Syllabus Course Overview Textbook Anton, Bivens, and Davis. Calculus: Early Transcendentals, Combined version with Wiley PLUS. 9 th edition. Hoboken, NJ: John Wiley & Sons, Inc. 2009. Course
More information6.241 Dynamic Systems and Control
6.41 Dynamic Systems and Control Lecture 5: H Synthesis Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology May 11, 011 E. Frazzoli (MIT) Lecture 5: H Synthesis May 11, 011
More information9TH EDITION. George B. Thomas, Jr. Massachusetts Institute of Technology. Ross L. Finney. With the collaboration of Maurice D.
9TH EDITION Calculus and Analytic Geometry George B. Thomas, Jr. Massachusetts Institute of Technology Ross L. Finney With the collaboration of Maurice D. Weir Naval Postgraduate School ^ Addison-Wesley
More informationNonlinear Optimal Tracking Using Finite-Horizon State Dependent Riccati Equation (SDRE)
Nonlinear Optimal Tracking Using Finite-Horizon State Dependent Riccati Equation (SDRE) AHMED KHAMIS Idaho State University Department of Electrical Engineering Pocatello, Idaho USA khamahme@isu.edu D.
More informationENGINEERING MATHEMATICS I. CODE: 10 MAT 11 IA Marks: 25 Hrs/Week: 04 Exam Hrs: 03 PART-A
ENGINEERING MATHEMATICS I CODE: 10 MAT 11 IA Marks: 25 Hrs/Week: 04 Exam Hrs: 03 Total Hrs: 52 Exam Marks:100 PART-A Unit-I: DIFFERENTIAL CALCULUS - 1 Determination of n th derivative of standard functions-illustrative
More informationLMI Methods in Optimal and Robust Control
LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 15: Nonlinear Systems and Lyapunov Functions Overview Our next goal is to extend LMI s and optimization to nonlinear
More informationExtremal Trajectories for Bounded Velocity Differential Drive Robots
Extremal Trajectories for Bounded Velocity Differential Drive Robots Devin J. Balkcom Matthew T. Mason Robotics Institute and Computer Science Department Carnegie Mellon University Pittsburgh PA 523 Abstract
More informationDEVELOPMENT OF A MULTIPURPOSE LOW THRUST INTERPLANETARY TRAJECTORY CALCULATION CODE
AAS 03-667 DEVELOPMENT OF A MULTIPURPOSE LOW THRUST INTERPLANETARY TRAJECTORY CALCULATION CODE Tadashi Sakai 1 and John R. Olds 2 A multipurpose low thrust interplanetary trajectory calculation code has
More informationfor changing independent variables. Most simply for a function f(x) the Legendre transformation f(x) B(s) takes the form B(s) = xs f(x) with s = df
Physics 106a, Caltech 1 November, 2018 Lecture 10: Hamiltonian Mechanics I The Hamiltonian In the Hamiltonian formulation of dynamics each second order ODE given by the Euler- Lagrange equation in terms
More informationAP Calculus AB Syllabus
AP Calculus AB Syllabus Course Overview and Philosophy This course is designed to be the equivalent of a college-level course in single variable calculus. The primary textbook is Calculus of a Single Variable,
More informationWhen Does the Uncertainty Become Non-Gaussian. Kyle T. Alfriend 1 Texas A&M University Inkwan Park 2 Texas A&M University
When Does the Uncertainty Become Non-Gaussian Kyle T. Alfriend Texas A&M University Inkwan Park 2 Texas A&M University ABSTRACT The orbit state covariance is used in the conjunction assessment/probability
More informationINTRODUCTION TO CENTRAL FORCE FIELDS
INTRODUCTION TO CENTRAL FORCE FIELDS AND CONIC SECTIONS Puneet Singla Celestial Mechanics AERO-624 Department of Aerospace Engineering Texas A&M University http://people.tamu.edu/ puneet/aero624 20th January
More informationGame Theory Extra Lecture 1 (BoB)
Game Theory 2014 Extra Lecture 1 (BoB) Differential games Tools from optimal control Dynamic programming Hamilton-Jacobi-Bellman-Isaacs equation Zerosum linear quadratic games and H control Baser/Olsder,
More informationConvergence of a Gauss Pseudospectral Method for Optimal Control
Convergence of a Gauss Pseudospectral Method for Optimal Control Hongyan Hou William W. Hager Anil V. Rao A convergence theory is presented for approximations of continuous-time optimal control problems
More information