IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i6p1419-d1097942.html
   My bibliography  Save this article

Active Debris Removal Mission Planning Method Based on Machine Learning

Author

Listed:
  • Yingjie Xu

    (College of System Engineering, National University of Defense Technology, Changsha 410073, China)

  • Xiaolu Liu

    (College of System Engineering, National University of Defense Technology, Changsha 410073, China)

  • Renjie He

    (College of System Engineering, National University of Defense Technology, Changsha 410073, China)

  • Yuehe Zhu

    (College of Aerospace Science and Engineering, National University of Defense Technology, Changsha 410073, China)

  • Yahui Zuo

    (College of System Engineering, National University of Defense Technology, Changsha 410073, China)

  • Lei He

    (College of System Engineering, National University of Defense Technology, Changsha 410073, China)

Abstract

To prevent the proliferation of space debris and stabilize the space environment, active debris removal (ADR) has increasingly gained public concern. Considering the complexity of space operations and the viability of ADR missions, it would be necessary to schedule the ADR process in order to remove as much debris as possible. This paper presents an active debris removal mission planning problem, devoted to generate an optimal debris removal plan to guide the mission process. According to the problem characteristics, a two-layer time-dependent traveling salesman problem(TSP) mathematical model is established, involving the debris removal sequence planning and the transfer trajectory planning. Subsequently, two main novel methods based on machine learning are proposed for the ADR mission planning problem, including a deep neural networks(DNN)-based estimation method for approximating the optimal velocity increments of perturbed multiple-impulse rendezvous and an reinforcement learning(RL)-based method for optimizing the sequence of debris removal and rendezvous time. Experimental results of different simulation scenarios have verified the effectiveness and superiority of the proposed method, indicating the good performance for solving the active debris removal mission planning problem.

Suggested Citation

  • Yingjie Xu & Xiaolu Liu & Renjie He & Yuehe Zhu & Yahui Zuo & Lei He, 2023. "Active Debris Removal Mission Planning Method Based on Machine Learning," Mathematics, MDPI, vol. 11(6), pages 1-24, March.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:6:p:1419-:d:1097942
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/6/1419/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/6/1419/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:11:y:2023:i:6:p:1419-:d:1097942. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.