DOCSLIB.ORG

Nonlinear Trajectory Optimization with Path Constraints Applied to Spacecraft Reconfiguration Maneuvers by Ian Miguel Garcia

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Nonlinear Trajectory Optimization with Path Constraints Applied to Spacecraft Reconfiguration Maneuvers by Ian Miguel Garcia Nonlinear Trajectory Optimization with Path Constraints Applied to Spacecraft Reconfiguration Maneuvers by Ian Miguel Garcia S.B. Aeronautics and Astronautics, Massachusetts Institute of Technology, 2003 S.B. Mathematics, Massachusetts Institute of Technology, 2003 Submitted to the Department of Aeronautics and Astronautics in partial fulfillment of the requirements for the degree oSCUSTSiS OF TECHNOLOGY Master of Science in Aeronautics and Astronautics JUN 2 3 2005 at the LIBRARI MASSACHUSETTS INSTITUTE OF TECHNOLOG June 2005 @ Massachusetts Institute of Technology 2005. All rights reserved. A uthor .......... ... .. ............... ............. Department of Aeronautics and Astronautics May 20, 2005 C ertified by ................... ......... Jonathan P. How 4ssociate Professor Jlhesis Supervisor Accepted by.............. Jaime Peraire Professor of Aeronautics and Astronautics Chair, Committee on Graduate Students AERO Nonlinear Trajectory Optimization with Path Constraints Applied to Spacecraft Reconfiguration Maneuvers by Ian Miguel Garcia Submitted to the Department of Aeronautics and Astronautics on May 20, 2005, in partial fulfillment of the requirements for the degree of Master of Science in Aeronautics and Astronautics Abstract Future space assembly and science missions (e.g., Terrestrial Planet Finder) will typ- ically require complex reconfiguration maneuvers involving well coordinated 6 DOF motions of the entire fleet of spacecraft. The motions must also satisfy constraints such as collision avoidance and pointing restrictions on some of the instruments. This problem is particularly difficult due to the nonlinearity of the attitude dynamics and the non-convexity of some of the constraints. The coupling of the positions and atti- tudes of the N spacecraft by some of the constraints adds a significant complication because it requires that the trajectory optimization be solved as a single 6N DOF problem. This thesis presents a method to solve this problem by first concentrating on finding a feasible solution, then developing improvements to it. The first step is posed as a path planning problem without differential constraints and solved using Rapidly-exploring Random Trees (RRT's). The improvement step is posed as a fea- sible nonlinear optimization problem and solved by an iterative optimization similar to a sequential linear programming method. The primary contribution of the thesis is an improvement to the basic RRT algorithm that replaces the connection step with a more complex function that takes into account local information about the con- straints. Two functions are proposed, one based on artificial potential functions, and another based on a random search. The results show that the new RRT with either of these connection functions is faster and more reliable for a difficult sample problem. The combination of an RRT with the new connection functions, and the improvement step, is also demonstrated on several challenging spacecraft reconfiguration problems with up to 16 spacecraft (96 DOF). The solution technique is shown to be robust and with computation times fast enough to embed in a real-time optimization algorithm as part of an autonomous onboard control system. Thesis Supervisor: Jonathan P. How Title: Associate Professor 3 4 Acknowledgments I would like to thank my advisor, Prof. Jonathan How, for sharing with me the questions and insight that made this work possible, and for going out of his way to help me complete it. I want to express my gratitude as well to the members of the research group who, I have to honestly say, are a bunch of funny, smart and helpful people with whom working has been real pleasure. I would also like to thank the MIT Department of Aeronautics and Astronautics for awarding me with a Departmental Fellowship which helped support part of this work. To Papd, Mami and Javi This work was funded under NASA Grant NAG5-10440 and Cooperative Agreement NCC5-729 through the NASA GSFC Formation Flying NASA Research Announce- ment. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Aeronautics and Space Administration. 5 6 Contents Abstract 3 Acknowledgements 5 Table of Contents 6 List of Figures 10 List of Tables 14 1 Introduction 17 1.1 Nonlinear Trajectory Optimization . ........ ......... 17 1.2 Spacecraft Formation Reconfiguration with Position and Attitude Con- straints . ........ ........ ........ ....... ... 20 1.3 Solution Approach to Hard Trajectory Optimization Problems ... 22 1.4 An Improved Planner ...... ............. 23 1.5 Trajectory Optimization with Discontinuous Constraints or Cost . 24 1.6 O verview ...... ....... ...... ...... ...... 25 2 Trajectory Optimization for Satellite Reconfiguration Maneuvers 27 2.1 The Spacecraft Reconfiguration Problem Formulation ...... 28 2.2 The Solution Approach ..... ...... ...... ...... ... 30 2.2.1 The Planner ....... ........ ....... 30 2.2.2 The Sm oother ... ..... ..... .... ..... ..... 32 2.3 Exam ples .... ...... ...... ..... ...... ...... 37 7 2.3.1 Example: Simple Maneuver ................... 39 2.3.2 Example: Coupled Maneuver .................. 39 2.3.3 Example: Four Vehicles ................. .... 44 2.4 Comparison with a Nonlinear Optimal Control Technique .... ... 44 2.4.1 Problem Formulation with DIDO .. ........... ... 44 2.4.2 Reconfiguration Problem for Different Initial Solutions and Prob- lem Sizes ....... ....... ....... ....... .. 45 2.5 Attitude Maneuver with 1 Spacecraft ..... ........ ..... 54 2.6 Sum m ary .. ........ ......... ........ ...... 55 3 The New Connection Functions 57 3.1 Introduction ................................ 57 3.2 The New Connection Functions ............ ......... 59 3.2.1 The Potential Connection Function ............... 60 3.2.2 The Random Connection Function .. ............. 62 3.3 Illustration of Connection Functions with Simple 2D Path Planning Exam ple .................................. 63 3.3.1 Comparison of Coverage ..................... 76 3.4 Simulation Results with the Spacecraft Reconfiguration Problem .. 78 3.4.1 Three Spacecraft ......................... 80 3.4.2 Change of Formation Shape ................... 80 3.4.3 Formation Rotation with 4 Spacecraft ............. 81 3.4.4 Formation Reflection with 4 Spacecraft ............. 81 3.4.5 Comparison of Computation Time ............... 81 3.4.6 New Results with Larger Configurations ............ 81 3.4.7 Crossing at the center .. ........ ........ .... 82 3.4.8 Rotation of Star Configuration ..... ....... ...... 82 3.4.9 Random Diagonal Configuration to Star Configuration ... 82 3.5 Sum m ary ....... ............. ............ 83 8 4 DIDO and NTG Applied to Trajectories with Discontinuous Con- straints 87 4.1 Introduction ....... ................................ 87 4.2 The Nonlinear Problem ................ 88 4.3 Problems with Known Path Discontinuities ............... 91 4.4 Multi-phase Problem in DIDO and NTG . ............... 94 4.5 The Sensor Problem ........................... 95 4.6 Simulation of the Sensor Problem .................... 98 4.7 The Weighted Shortest Path ....................... 99 4.8 Simulation of the Weighted Shortest Path Problem .......... 101 4.9 Sum m ary ............ ............. ........ 104 5 Conclusions and Future Work 107 5.1 C onclusions ....... ............ ........... .. 107 5.2 Future Work . ........................ ....... 109 A UAV 2D path planning with DIDO and NTG 111 A.1 The UAV Problem with Obstacles ............. ....... 111 A.2 Implementation with DIDO ....................... 112 A.3 Implementation with NTG ............ ............ 114 Bibliography 115 9 10 List of Figures 1.1 NASA Terrestrial Planet Finder mission . 19 1.2 NASA Stellar Imager mission ......... ............ 19 1.3 DARPA Orbital Express mission ............... ..... 20 1.4 The formation reconfiguration problem ....... .......... 21 1.5 The best trajectory minimizes the length over the high risk area .. 25 2.1 Example: Simple maneuver. Simple translation and rotation with sun avoidance constraint. ..... ............ .......... 38 2.2 Locus of "instrument" vector is tight against sun avoidance constraint 38 2.3 Cosine of angle between "instrument" vector and sun vector ..... 38 2.4 Example: Coupled maneuver ............ ........... 40 2.5 Same as Figure 2.4, solution before the smoothing ... ........ 40 2.6 Locus of instrument in spacecraft 2 with sun avoidance constraint . 41 2.7 Locus of vector pointing from spacecraft 1 to spacecraft 2 . ...... 41 2.8 Locus of vector pointing from spacecraft 2 to spacecraft 1 .... ... 41 2.9 Cosines of angles between ranging device vector and relative position of both spacecrafts ....... ............................ 42 2.10 Rotate tetrahedral configuration 90" degrees around Y axis. Pointing constraints remain as before. ................... .... 43 2.11 Plan and smoothed trajectories for Example A ............. 46 2.12 Plan and smoothed trajectories for Example B ... .......... 47 2.13 Performance of DIDO for Example A ............. ..... 49 2.14 Performance of DIDO for Example B ............. ..... 49 11 2.15 Performance of DIDO for Example C (with stay-inside constraint) 51 2.16 Performance of DIDO for Example D (with stay-outside constraint) 51 2.17 Performance of DIDO for Example E (with both stay-inside and stay- outside constraints) ... ..... ...... ..... ...... 52 2.18 Success ratio for DIDO for the examples shown here . ...... 53 2.19 Locus of Telescope
Load more

Recommended publications
  • An Optimal Control Theory for the Traveling Salesman Problem And
    An Optimal Control Theory for the Traveling Salesman Problem and Its Variants I. M. Ross1, R. J. Proulx2, M. Karpenko3 Naval Postgraduate School, Monterey, CA 93943 Abstract We show that the traveling salesman problem (TSP) and its many variants may be modeled as functional optimization problems over a graph. In this formu- lation, all vertices and arcs of the graph are functionals; i.e., a mapping from a space of measurable functions to the field of real numbers. Many variants of the TSP, such as those with neighborhoods, with forbidden neighborhoods, with time-windows and with profits, can all be framed under this construct. In sharp contrast to their discrete-optimization counterparts, the modeling constructs presented in this paper represent a fundamentally new domain of analysis and computation for TSPs and their variants. Beyond its apparent mathematical unification of a class of problems in graph theory, the main advantage of the new approach is that it facilitates the modeling of certain application-specific problems in their home space of measurable functions. Consequently, certain elements of economic system theory such as dynamical models and continuous- time cost/profit functionals can be directly incorporated in the new optimization problem formulation. Furthermore, subtour elimination constraints, prevalent in discrete optimization formulations, are naturally enforced through continu- ity requirements. The price for the new modeling framework is nonsmooth functionals. Although a number of theoretical issues remain open in the pro- posed mathematical framework, we demonstrate the computational viability of the new modeling constructs over a sample set of problems to illustrate the rapid production of end-to-end TSP solutions to extensively-constrained prac- tical problems.
    [Show full text]
  • Optimal Engine Selection and Trajectory Optimization Using Genetic Algorithms for Conceptual Design Optimization of Reusable Space Launch Vehicles
    Optimal Engine Selection and Trajectory Optimization using Genetic Algorithms for Conceptual Design Optimization of Reusable Space Launch Vehicles Steven Cory Wyatt Steele Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of the requirements of the degree of Master of Science in Mechanical Engineering Walter F. O’Brien, Chair Michael von Spakovsky Eugene Cliff February 19, 2015 Blacksburg, Virginia Keywords: Trajectory Optimization, Engine Selection, Reusable Launch Vehicle (RLV), Two Stage to Orbit (TSTO) Optimal Engine Selection and Trajectory Optimization using Genetic Algorithms for Conceptual Design Optimization of Reusable Space Launch Vehicles Steven Cory Wyatt Steele Abstract Proper engine selection for Reusable Launch Vehicles (RLVs) is a key factor in the design of low cost reusable launch systems for routine access to space. RLVs typically use combinations of different types of engines used in sequence over the duration of the flight. Also, in order to properly choose which engines are best for an RLV design concept and mission, the optimal trajectory that maximizes or minimizes the mission objective must be found for that engine configuration. Typically this is done by the designer iteratively choosing engine combinations based on his/her judgment and running each individual combination through a full trajectory optimization to find out how well the engine configuration performed on board the desired RLV design. This thesis presents a new method to reliably predict the optimal engine configuration and optimal trajectory for a fixed design of a conceptual RLV in an automated manner. This method is accomplished using the original code Steele-Flight.
    [Show full text]
  • Simulation and Application of GPOPS for Trajectory Optimization and Mission Planning Tool Danielle E
    Air Force Institute of Technology AFIT Scholar Theses and Dissertations Student Graduate Works 3-10-2010 Simulation and Application of GPOPS for Trajectory Optimization and Mission Planning Tool Danielle E. Yaple Follow this and additional works at: https://scholar.afit.edu/etd Part of the Systems Engineering and Multidisciplinary Design Optimization Commons Recommended Citation Yaple, Danielle E., "Simulation and Application of GPOPS for Trajectory Optimization and Mission Planning Tool" (2010). Theses and Dissertations. 2060. https://scholar.afit.edu/etd/2060 This Thesis is brought to you for free and open access by the Student Graduate Works at AFIT Scholar. It has been accepted for inclusion in Theses and Dissertations by an authorized administrator of AFIT Scholar. For more information, please contact [email protected]. SIMULATION AND APPLICATION OF GPOPS FOR A TRAJECTORY OPTIMIZATION AND MISSION PLANNING TOOL THESIS Danielle E. Yaple, 2nd Lieutenant, USAF AFIT/GAE/ENY/10-M29 DEPARTMENT OF THE AIR FORCE AIR UNIVERSITY AIR FORCE INSTITUTE OF TECHNOLOGY Wright-Patterson Air Force Base, Ohio APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED The views expressed in this thesis are those of the author and do not reflect the official policy or position of the United States Air Force, Department of Defense, or the United States Government. This material is declared a work of the U.S. Government and is not subject to copyright protection in the United States. AFIT/GAE/ENY/10-M29 SIMULATION AND APPLICATION OF GPOPS FOR A TRAJECTORY OPTIMIZATION AND MISSION PLANNING TOOL THESIS Presented to the Faculty Department of Aeronautics and Astronautics Graduate School of Engineering and Management Air Force Institute of Technology Air University Air Education and Training Command In Partial Fulfillment of the Requirements for the Degree of Master of Science in Aeronautical Engineering Danielle E.
    [Show full text]
  • Proquest Dissertations
    ROBUST MODEL PREDICTIVE CONTROL FOR PROCESS CONTROL AND SUPPLY CHAIN OPTIMIZATION By XIANG LI, B.Eng., M.Eng. A Thesis Submitted to the School of Graduate Studies in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy McMaster University © Copyright by Xiang Li, September 2009 Library and Archives Bibliotheque et 1*1 Canada Archives Canada Published Heritage Direction du Branch Patrimoine de I'edition 395 Wellington Street 395, rue Wellington OttawaONK1A0N4 Ottawa ON K1A 0N4 Canada Canada Your file Votre reference ISBN: 978-0-494-64703-5 Our file Notre reference ISBN: 978-0-494-64703-5 NOTICE: AVIS: The author has granted a non­ L'auteur a accorde une licence non exclusive exclusive license allowing Library and permettant a la Bibliotheque et Archives Archives Canada to reproduce, Canada de reproduire, publier, archiver, publish, archive, preserve, conserve, sauvegarder, conserver, transmettre au public communicate to the public by par telecommunication ou par Nnternet, preter, telecommunication or on the Internet, distribuer et vendre des theses partout dans le loan, distribute and sell theses monde, a des fins commerciales ou autres, sur worldwide, for commercial or non­ support microforme, papier, electronique et/ou commercial purposes, in microform, autres formats. paper, electronic and/or any other formats. The author retains copyright L'auteur conserve la propriete du droit d'auteur ownership and moral rights in this et des droits moraux qui protege cette these. Ni thesis. Neither the thesis nor la these ni des extraits substantiels de celle-ci substantial extracts from it may be ne doivent etre imprimes ou autrement printed or otherwise reproduced reproduits sans son autorisation.
    [Show full text]
  • Real-Time Trajectory Planning to Enable Safe and Performant Automated Vehicles Operating in Unknown Dynamic Environments
    Real-time Trajectory Planning to Enable Safe and Performant Automated Vehicles Operating in Unknown Dynamic Environments by Huckleberry Febbo A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Mechanical Engineering) at The University of Michigan 2019 Doctoral Committee: Associate Research Scientist Tulga Ersal, Co-Chair Professor Jeffrey L. Stein, Co-Chair Professor Brent Gillespie Professor Ilya Kolmanovsky Huckleberry Febbo [email protected] ORCID iD: 0000-0002-0268-3672 c Huckleberry Febbo 2019 All Rights Reserved For my mother and father ii ACKNOWLEDGEMENTS I want to thank my advisors, Prof. Jeffrey L. Stein and Dr. Tulga Ersal for their strong guidance during my graduate studies. Each of you has played pivotal and complementary roles in my life that have greatly enhanced my ability to communicate. I want to thank Prof. Peter Ifju for telling me to go to graduate school. Your confidence in me has pushed me farther than I knew I could go. I want to thank Prof. Elizabeth Hildinger for improving my ability to write well and providing me with the potential to assert myself on paper. I want to thank my friends, family, classmates, and colleges for their continual support. In particular, I would like to thank John Guittar and Srdjan Cvjeticanin for providing me feedback on my articulation of research questions and ideas. I will always look back upon the 2018 Summer that we spent together in the Rackham Reading Room with fondness. Rackham . oh Rackham . I want to thank Virgil Febbo for helping me through my last month in Michigan.
    [Show full text]
  • Connections Between the Covector Mapping Theorem and Convergence of Pseudospectral Methods for Optimal Control
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Calhoun, Institutional Archive of the Naval Postgraduate School Calhoun: The NPS Institutional Archive Faculty and Researcher Publications Faculty and Researcher Publications Collection 2008 Connections between the covector mapping theorem and convergence of pseudospectral methods for optimal control Gong, Qi Springer Science + Business Media, LLC Comput. Optim. Appl., 2008, v. 41, pp. 307-335 http://hdl.handle.net/10945/48182 Comput Optim Appl (2008) 41: 307–335 DOI 10.1007/s10589-007-9102-4 Connections between the covector mapping theorem and convergence of pseudospectral methods for optimal control Qi Gong · I. Michael Ross · Wei Kang · Fariba Fahroo Received: 15 June 2006 / Revised: 2 January 2007 / Published online: 31 October 2007 © Springer Science+Business Media, LLC 2007 Abstract In recent years, many practical nonlinear optimal control problems have been solved by pseudospectral (PS) methods. In particular, the Legendre PS method offers a Covector Mapping Theorem that blurs the distinction between traditional di- rect and indirect methods for optimal control. In an effort to better understand the PS approach for solving control problems, we present consistency results for nonlinear optimal control problems with mixed state and control constraints. A set of sufficient conditions is proved under which a solution of the discretized optimal control prob- lem converges to the continuous solution. Convergence of the primal variables does not necessarily imply the convergence of the duals. This leads to a clarification of the Covector Mapping Theorem in its relationship to the convergence properties of PS methods and its connections to constraint qualifications.
    [Show full text]
  • Unscented Optimal Control for Space Flight
    Unscented Optimal Control for Space Flight I. Michael Ross,∗ Ronald J. Proulx,† and Mark Karpenko‡ Unscented optimal control is based on combining the concept of the unscented transform with standard optimal control to produce a new approach to directly manage navigational and other uncertainties in an open-loop framework. The sigma points of the unscented transform are treated as controllable particles that are all driven by the same open-loop controller. A system-of-systems dynamical model is constructed where each system is a copy of the other. Pseudospectral optimal control techniques are applied to this system-of-systems to produce a computationally viable approach for solving the large-scale optimal control problem. The problem of slewing the Hubble Space Telescope (HST) is used as a running theme to illustrate the ideas. This problem is prescient because of the possibility of failure of all of the gyros on board HST. If the gyros fail, the HST mission will be over despite its science instruments functioning flawlessly. The unscented optimal control approach demonstrates that there is a way out to perform a zero-gyro operation. This zero-gyro mode is flight implementable and can be used to perform uninterrupted science should all gyros fail. I. Introduction Atypicalspacemissionconsistsofseveraltrajectorysegments:fromlaunchtoorbit,to orbital transfers and possible reentry. The guidance and control problems for the end-to-end mission can be framed as a hybrid optimal control problem;1 i.e., a graph-theoretic optimal control problem that involves real and categorial (integer) variables. Even when the end- to-end problem is segmented into simpler phases as a means to manage the technical and operational complexity, each phase may still involve a multi-point optimal control problem.1 The sequence of optimal control problems is dictated by mission requirements and many other practical constraints.
    [Show full text]
  • A Pseudospectral Approach to High Index DAE Optimal Control Problems
    A Pseudospectral Approach to High Index DAE Optimal Control Problems December 3, 2018 Harleigh C. Marsh,1 Department of Applied Mathematics & Statistics University of California, Santa Cruz Santa Cruz, CA 95064, USA Mark Karpenko,2 Department of Mechanical and Aerospace Engineering Naval Postgraduate School Monterey, CA 93943, USA and Qi Gong3 Department of Applied Mathematics & Statistics University of California, Santa Cruz Santa Cruz, CA 95064, USA Abstract Historically, solving optimal control problems with high index differential algebraic equations (DAEs) has been considered extremely hard. Computa- tional experience with Runge-Kutta (RK) methods confirms the difficulties. High index DAE problems occur quite naturally in many practical engineering applications. Over the last two decades, a vast number of real-world prob- lems have been solved routinely using pseudospectral (PS) optimal control arXiv:1811.12582v1 [math.OC] 30 Nov 2018 techniques. In view of this, we solve a \provably hard," index-three problem using the PS method implemented in DIDO c , a state-of-the-art MATLABr optimal control toolbox. In contrast to RK-type solution techniques, no la- borious index-reduction process was used to generate the PS solution. The PS solution is independently verified and validated using standard industry practices. It turns out that proper PS methods can indeed be used to \di- rectly" solve high index DAE optimal control problems. In view of this, it is proposed that a new theory of difficulty for DAEs be put forth. 1Ph.D. candidate. 2Research
    [Show full text]
  • Fast Mesh Refinement in Pseudospectral Optimal Control
    Fast Mesh Refinement in Pseudospectral Optimal Control N. Koeppen*, I. M. Ross†, L. C. Wilcox‡, R. J. Proulx§ Naval Postgraduate School, Monterey, CA 93943 Mesh refinement in pseudospectral (PS) optimal control is embarrassingly easy — simply increase the order N of the Lagrange interpolating polynomial and the mathematics of convergence automates the distribution of the grid points. Un- fortunately, as N increases, the condition number of the resulting linear alge- bra increases as N 2; hence, spectral efficiency and accuracy are lost in prac- tice. In this paper, we advance Birkhoff interpolation concepts over an arbi- trary grid to generate well-conditioned PS optimal control discretizations. We show that the condition number increases only as √N in general, but is inde- pendent of N for the special case of one of the boundary points being fixed. Hence, spectral accuracy and efficiency are maintained as N increases. The ef- fectiveness of the resulting fast mesh refinement strategy is demonstrated by using polynomials of over a thousandth order to solve a low-thrust, long-duration orbit transfer problem. I. Introduction In principle, mesh refinement in pseudospectral (PS) optimal control[1] is embarrassingly easy — simply increase the order N of the Lagrange interpolating polynomial. For instance, in a Cheby- shev PS method[2, 3, 4], the Chebyshev-Gauss-Lobatto (CGL) mesh points are given by[2], 1 iπ ti = (tf + t0) (tf t0) cos , i =0, 1,...,N (1) 2 − − N where, [t0, tf ] is the time interval. Grid points generated by (1) for N =5, 10 and 20 over a canon- ical time-interval of [0, 1] are shown in Fig.
    [Show full text]
  • Convex Optimization for Trajectory Generation Arxiv:2106.09125V1 [Math.OC] 16 Jun 2021
    Preprint Convex Optimization for Trajectory Generation A Tutorial On Generating Dynamically Feasible Trajectories Reliably And Efficiently Danylo Malyuta a,? , Taylor P. Reynolds a, Michael Szmuk a, Thomas Lew b, Riccardo Bonalli b, Marco Pavone b, and Behc¸et Ac¸ıkmes¸e a a William E. Boeing Department of Aeronautics and Astronautics, University of Washington, Seattle, WA 98195, USA b Department of Aeronautics and Astronautics, Stanford University, Stanford, CA 94305, USA Reliable and efficient trajectory generation methods are a fundamental need for autonomous dynamical systems of tomorrow. The goal of this article is to provide a comprehensive tutorial of three major con- vex optimization-based trajectory generation methods: lossless convexification (LCvx), and two sequential convex programming algorithms known as SCvx and GuSTO. In this article, trajectory generation is the computation of a dynamically feasible state and control signal that satisfies a set of constraints while opti- mizing key mission objectives. The trajectory generation problem is almost always nonconvex, which typ- ically means that it is not readily amenable to efficient and reliable solution onboard an autonomous ve- hicle. The three algorithms that we discuss use problem reformulation and a systematic algorithmic strat- egy to nonetheless solve nonconvex trajectory generation tasks through the use of a convex optimizer. The theoretical guarantees and computational speed offered by convex optimization have made the algo- rithms popular in both research and industry circles. To date, the list of applications include rocket land- ing, spacecraft hypersonic reentry, spacecraft rendezvous and docking, aerial motion planning for fixed- wing and quadrotor vehicles, robot motion planning, and more. Among these applications are high-profile rocket flights conducted by organizations like NASA, Masten Space Systems, SpaceX, and Blue Origin.
    [Show full text]
  • Opty: Software for Trajectory Optimization and Parameter Identification Using Direct Collocation
    opty: Software for trajectory optimization and parameter identification using direct collocation Jason K. Moore1 and Antonie van den Bogert2 DOI: 10.21105/joss.00300 1 University of California, Davis 2 Cleveland State University Software • Review Summary • Repository • Archive opty is a tool for describing and solving trajectory optimization and parameter identi- Submitted: 04 June 2017 fication problems based on symbolic descriptions of ordinary differential equations and Published: 30 January 2018 differential algebriac equations that describe a dynamical system. The motivation for its development resides in the need to solve optimal control problems of biomechanical Licence Authors of JOSS papers retain systems. The target audience is engineers and scientists interested in solving nonlinear copyright and release the work un- optimal control and parameter identification problems with minimal computational over- der a Creative Commons Attri- head. bution 4.0 International License A user of opty is responsible for specifying the system’s dynamics (the ODE/DAEs), the (CC-BY). cost or fitness function, bounds on the solution, and the initial guess for the solution. opty uses this problem specification to derive the constraints needed to solve the optimization problem using the direct collocation method (Betts 2010). This method maps the problem to a non-linear programming problem and the result is then solved numerically with an interior point optimizer IPOPT (Wächter and Biegler 2006) which is wrapped by cyipopt (cyipopt Developers 2017) for use in Python. The software allows the user to describe the dynamical system of interest at a high level in symbolic form without needing to concern themselves with the numerical computation details.
    [Show full text]
  • Pseudospectral Collocation Methods for the Direct Transcription of Optimal Control Problems by Jesse A
    RICE UNIVERSITY Pseudospectral Collocation Methods for the Direct Transcription of Optimal Control Problems by Jesse A. Pietz A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree Master of Arts Approved, Thesis Committee: Matthias Heinkenschloss, Chairman Associate Professor of Computational and Applied Mathematics William Symes Noah Harding Professor of Computational and Applied Mathematics Yin Zhang Professor of Computational and Applied Mathematics Nazareth Bedrossian Principal Member of Technical Staff, Charles Stark Draper Laboratory, Inc. Houston, Texas April, 2003 The views expressed in this thesis are those of the author and do not reflect the official policy or position of the United States Air Force, Department of Defense, or the United States Government. ABSTRACT Pseudospectral Collocation Methods for the Direct Transcription of Optimal Control Problems by Jesse A. Pietz This thesis is concerned with the study of pseudospectral discretizations of optimal control problems governed by ordinary differential equations and with their applica- tion to the solution of the International Space Station (ISS) momentum dumping problem. Pseudospectral methods are used to transcribe a given optimal control problem into a nonlinear programming problem. Adjoint estimates are presented and analyzed that provide approximations of the original adjoint variables using Lagrange multi- pliers corresponding to the discretized optimal control problem. These adjoint esti- mations are derived for a broad class of pseudospectral discretizations and generalize the previously known adjoint estimation procedure for the Legendre pseudospectral discretization. The error between the desired solution to the infinite dimensional opti- mal control problem and the solution computed using pseudospectral collocation and nonlinear programming is estimated for linear-quadratic optimal control problems.
    [Show full text]