IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v156y2013i3d10.1007_s10957-012-0130-6.html
   My bibliography  Save this article

Multiple Space Debris Collecting Mission—Debris Selection and Trajectory Optimization

Author

Listed:
  • M. Cerf

    (EADS Astrium Space Transportation)

Abstract

This paper investigates the cost requirement for a space debris collecting mission aimed at removing heavy debris from low Earth orbits. The problem mixes combinatorial optimization to select the debris among a list of candidates and functional optimization to define the orbital manoeuvres. The solving methodology proceeds in two steps: Firstly, a specific transfer strategy with impulsive manoeuvres is defined so that the problem becomes of finite dimension; secondly the problem is linearized around an initial reference solution. A Branch and Bound algorithm is then applied iteratively to optimize simultaneously the debris selection and the orbital manoeuvres, yielding a new reference solution. The optimal solutions found are close to the initial guess despite a very complicated design space. The method is exemplified on a representative application case.

Suggested Citation

  • M. Cerf, 2013. "Multiple Space Debris Collecting Mission—Debris Selection and Trajectory Optimization," Journal of Optimization Theory and Applications, Springer, vol. 156(3), pages 761-796, March.
    • Handle: RePEc:spr:joptap:v:156:y:2013:i:3:d:10.1007_s10957-012-0130-6
    DOI: 10.1007/s10957-012-0130-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-012-0130-6
    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-012-0130-6?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. Sedeño-Noda, Antonio & González-Martín, Carlos, 2010. "On the K shortest path trees problem," European Journal of Operational Research, Elsevier, vol. 202(3), pages 628-635, May.
    2. H. J. Oberle & K. Taubert, 1997. "Existence and Multiple Solutions of the Minimum-Fuel Orbit Transfer Problem," Journal of Optimization Theory and Applications, Springer, vol. 95(2), pages 243-262, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Max Cerf, 2015. "Multiple Space Debris Collecting Mission: Optimal Mission Planning," Journal of Optimization Theory and Applications, Springer, vol. 167(1), pages 195-218, October.

    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. H. Baumann & H. J. Oberle, 2000. "Numerical Computation of Optimal Trajectories for Coplanar, Aeroassisted Orbital Transfer," Journal of Optimization Theory and Applications, Springer, vol. 107(3), pages 457-479, December.
    2. J.B. Caillau & J. Gergaud & J. Noailles, 2003. "3D Geosynchronous Transfer of a Satellite: Continuation on the Thrust," Journal of Optimization Theory and Applications, Springer, vol. 118(3), pages 541-565, September.
    3. Fliege, Jörg & Kaparis, Konstantinos & Khosravi, Banafsheh, 2012. "Operations research in the space industry," European Journal of Operational Research, Elsevier, vol. 217(2), pages 233-240.

    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:156:y:2013:i:3:d:10.1007_s10957-012-0130-6. 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.