IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v136y2008i3d10.1007_s10957-008-9351-0.html
   My bibliography  Save this article

Convergence Acceleration of Direct Trajectory Optimization Using Novel Hessian Calculation Methods

Author

Listed:
  • N. Yokoyama

    (National Defence Academy of Japan)

  • S. Suzuki

    (University of Tokyo)

  • T. Tsuchiya

    (University of Tokyo)

Abstract

Sparse sequential quadratic programming (SQP) has offered fast and robust convergence of trajectory optimization based on direct collocation. However, the conventional approach of calculating the Hessian of the Lagrangian is sometimes inefficient in view of the computational time. Therefore, this paper proposes two novel Hessian calculation methods that exploit the doubly-bordered block diagonal structure of the Hessian. Through applications to the constrained brachistochrone problem and the space shuttle reentry problem, the proposed methods were demonstrated to show faster convergence speeds as compared with the conventional methods.

Suggested Citation

  • N. Yokoyama & S. Suzuki & T. Tsuchiya, 2008. "Convergence Acceleration of Direct Trajectory Optimization Using Novel Hessian Calculation Methods," Journal of Optimization Theory and Applications, Springer, vol. 136(3), pages 297-319, March.
    • Handle: RePEc:spr:joptap:v:136:y:2008:i:3:d:10.1007_s10957-008-9351-0
    DOI: 10.1007/s10957-008-9351-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-008-9351-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-008-9351-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. A. Miele & T. Wang, 2003. "Multiple-Subarc Gradient-Restoration Algorithm, Part 1: Algorithm Structure," Journal of Optimization Theory and Applications, Springer, vol. 116(1), pages 1-17, January.
    2. A. Miele & T. Wang, 2003. "Multiple-Subarc Gradient-Restoration Algorithm, Part 2: Application to a Multistage Launch Vehicle Design," Journal of Optimization Theory and Applications, Springer, vol. 116(1), pages 19-39, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. A. Miele & T. Wang, 2005. "Maximin Approach to the Ship Collision Avoidance Problem via Multiple-Subarc Sequential Gradient-Restoration Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 124(1), pages 29-53, January.
    2. Mauro Pontani & Bruce Conway, 2014. "Optimal Low-Thrust Orbital Maneuvers via Indirect Swarming Method," Journal of Optimization Theory and Applications, Springer, vol. 162(1), pages 272-292, July.
    3. A. Miele & M. W. Weeks & M. Ciarcià, 2007. "Optimal Trajectories for Spacecraft Rendezvous," Journal of Optimization Theory and Applications, Springer, vol. 132(3), pages 353-376, March.
    4. A. Miele & T. Wang & J. A. Mathwig & M. Ciarcià, 2010. "Collision Avoidance for an Aircraft in Abort Landing: Trajectory Optimization and Guidance," Journal of Optimization Theory and Applications, Springer, vol. 146(2), pages 233-254, August.
    5. A. Miele & T. Wang, 2006. "Optimal Trajectories and Guidance Schemes for Ship Collision Avoidance," Journal of Optimization Theory and Applications, Springer, vol. 129(1), pages 1-21, April.
    6. A. Miele & M. Ciarcià & M. W. Weeks, 2007. "Guidance Trajectories for Spacecraft Rendezvous," Journal of Optimization Theory and Applications, Springer, vol. 132(3), pages 377-400, March.
    7. A. Miele & M. Ciarcià, 2008. "Optimal Starting Conditions for the Rendezvous Maneuver, Part 1: Optimal Control Approach," Journal of Optimization Theory and Applications, Springer, vol. 137(3), pages 593-624, June.
    8. A. Miele & T. Wang, 2003. "Multiple-Subarc Gradient-Restoration Algorithm, Part 1: Algorithm Structure," Journal of Optimization Theory and Applications, Springer, vol. 116(1), pages 1-17, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:136:y:2008:i:3:d:10.1007_s10957-008-9351-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.