IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v191y2021i2d10.1007_s10957-021-01884-1.html
   My bibliography  Save this article

Unconstrained Direct Optimization of Spacecraft Trajectories Using Many Embedded Lambert Problems

Author

Listed:
  • David Ottesen

    (The University of Texas at Austin)

  • Ryan P. Russell

    (The University of Texas at Austin)

Abstract

Direct optimization of many-revolution spacecraft trajectories is performed using an unconstrained formulation with many short-arc, embedded Lambert problems. Each Lambert problem shares its terminal positions with neighboring segments to implicitly enforce position continuity. Use of embedded boundary value problems (EBVPs) is not new to spacecraft trajectory optimization, including extensive use in primer vector theory, flyby tour design, and direct impulsive maneuver optimization. Several obstacles have prevented their use on problems with more than a few dozen segments, including computationally expensive solvers, lack of fast and accurate partial derivatives, unguaranteed convergence, and a non-smooth solution space. Here, these problems are overcome through the use of short-arc segments and a recently developed Lambert solver, complete with the necessary fast and accurate partial derivatives. These short arcs guarantee existence and uniqueness for the Lambert solutions when transfer angles are limited to less than a half revolution. Furthermore, the use of many short segments simultaneously approximates low-thrust and eliminates the need to specify impulsive maneuver quantity or location. For preliminary trajectory optimization, the EBVP technique is simple to implement, benefiting from an unconstrained formulation, the well-known Broyden–Fletcher–Goldfarb–Shanno line search direction, and Cartesian coordinates. Moreover, the technique is naturally parallelizable via the independence of each segment’s EBVP. This new, many-rev EBVP technique is scalable and reliable for trajectories with thousands of segments. Several minimum fuel and energy examples are demonstrated, including a problem with 6143 segments for 256 revolutions, found within 5.5 h on a single processor. Smaller problems with only hundreds of segments take minutes.

Suggested Citation

  • David Ottesen & Ryan P. Russell, 2021. "Unconstrained Direct Optimization of Spacecraft Trajectories Using Many Embedded Lambert Problems," Journal of Optimization Theory and Applications, Springer, vol. 191(2), pages 634-674, December.
  • Handle: RePEc:spr:joptap:v:191:y:2021:i:2:d:10.1007_s10957-021-01884-1
    DOI: 10.1007/s10957-021-01884-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-021-01884-1
    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-021-01884-1?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. Gregory Lantoine & Ryan P. Russell, 2012. "A Hybrid Differential Dynamic Programming Algorithm for Constrained Optimal Control Problems. Part 1: Theory," Journal of Optimization Theory and Applications, Springer, vol. 154(2), pages 382-417, August.
    2. Bruce A. Conway, 2012. "A Survey of Methods Available for the Numerical Optimization of Continuous Dynamic Systems," Journal of Optimization Theory and Applications, Springer, vol. 152(2), pages 271-306, February.
    3. Gregory Lantoine & Ryan P. Russell, 2012. "A Hybrid Differential Dynamic Programming Algorithm for Constrained Optimal Control Problems. Part 2: Application," Journal of Optimization Theory and Applications, Springer, vol. 154(2), pages 418-442, August.
    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. Joris T. Olympio, 2013. "A Continuous Implementation of a Second-Variation Optimal Control Method for Space Trajectory Problems," Journal of Optimization Theory and Applications, Springer, vol. 158(3), pages 687-716, September.
    2. Mauro Pontani, 2021. "Optimal Space Trajectories with Multiple Coast Arcs Using Modified Equinoctial Elements," Journal of Optimization Theory and Applications, Springer, vol. 191(2), pages 545-574, December.
    3. 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.
    4. Klaus Werner Schmidt & Öncü Hazır, 2019. "Formulation and solution of an optimal control problem for industrial project control," Annals of Operations Research, Springer, vol. 280(1), pages 337-350, September.
    5. Calvin Kielas-Jensen & Venanzio Cichella & David Casbeer & Satyanarayana Gupta Manyam & Isaac Weintraub, 2021. "Persistent Monitoring by Multiple Unmanned Aerial Vehicles Using Bernstein Polynomials," Journal of Optimization Theory and Applications, Springer, vol. 191(2), pages 899-916, December.
    6. Alena Vagaská & Miroslav Gombár & Ľuboslav Straka, 2022. "Selected Mathematical Optimization Methods for Solving Problems of Engineering Practice," Energies, MDPI, vol. 15(6), pages 1-22, March.
    7. Miguel G. Villarreal-Cervantes, 2017. "Approximate and Widespread Pareto Solutions in the Structure-Control Design of Mechatronic Systems," Journal of Optimization Theory and Applications, Springer, vol. 173(2), pages 628-657, May.
    8. N. Koeppen & I. M. Ross & L. C. Wilcox & R. J. Proulx, 2019. "Fast Mesh Refinement in Pseudospectral Optimal Control," Papers 1904.12992, arXiv.org.
    9. Sheng Zhang & En-Mi Yong & Wei-Qi Qian & Kai-Feng He, 2019. "A Variation Evolving Method for Optimal Control Computation," Journal of Optimization Theory and Applications, Springer, vol. 183(1), pages 246-270, October.

    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:191:y:2021:i:2:d:10.1007_s10957-021-01884-1. 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.