IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v11y2015i7p827987.html
   My bibliography  Save this article

Asteroids Exploration Trajectory Optimal Design with Differential Evolution Based on Mixed Coding

Author

Listed:
  • Maocai Wang
  • Zhiming Song
  • Guangming Dai
  • Lei Peng
  • Chang Zheng

Abstract

With the development of space technology, asteroid exploration will become a hotspot in the deep space exploration field. Space flight trajectory has the following requirements: needing a long time, having many engineering constraints, having a large number of targets, and having a series of feasible solutions. So how to find the global optimum flight program is the core issue of the deep space exploration trajectory design. This paper proposes a novel method to design the optimal trajectory by differential evolution (DE) algorithm for asteroid exploration based on mixed coding. In our method, the celestial sequence and the time sequence are coded together into the chromosomes of DE and optimized them simultaneously. The chromosomes are designed to include four parts: the celestial sequence, the exploration type, the time sequence, and the return time. The algorithm can make full use of the characteristics of the high efficiency and global optimization ability of differential evolution and can also avoid the problem of high complexity of the branch-and-bound algorithm and the problem of nonglobal optimal solution of the greedy algorithm. The algorithm is adopted to solve the Fourth Contest of National Space Orbit Design in China, and the result shows that both the computational efficiency and the performance of the algorithm are superior.

Suggested Citation

  • Maocai Wang & Zhiming Song & Guangming Dai & Lei Peng & Chang Zheng, 2015. "Asteroids Exploration Trajectory Optimal Design with Differential Evolution Based on Mixed Coding," International Journal of Distributed Sensor Networks, , vol. 11(7), pages 827987-8279, July.
  • Handle: RePEc:sae:intdis:v:11:y:2015:i:7:p:827987
    DOI: 10.1155/2015/827987
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/827987
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/827987?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:sae:intdis:v:11:y:2015:i:7:p:827987. 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: SAGE Publications (email available below). General contact details of provider: .

    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.