Asteroids Exploration Trajectory Optimal Design with Differential Evolution Based on Mixed Coding
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 feasibl...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi - SAGE Publishing
2015-07-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2015/827987 |
| _version_ | 1797723825184440320 |
|---|---|
| author | Maocai Wang Zhiming Song Guangming Dai Lei Peng Chang Zheng |
| author_facet | Maocai Wang Zhiming Song Guangming Dai Lei Peng Chang Zheng |
| author_sort | Maocai Wang |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-03-12T10:08:12Z |
| format | Article |
| id | doaj.art-284fb4dff35d439583e8810bf57574e7 |
| institution | Directory Open Access Journal |
| issn | 1550-1477 |
| language | English |
| last_indexed | 2024-03-12T10:08:12Z |
| publishDate | 2015-07-01 |
| publisher | Hindawi - SAGE Publishing |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj.art-284fb4dff35d439583e8810bf57574e72023-09-02T11:05:27ZengHindawi - SAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772015-07-011110.1155/2015/827987827987Asteroids Exploration Trajectory Optimal Design with Differential Evolution Based on Mixed CodingMaocai Wang0Zhiming Song1Guangming Dai2Lei Peng3Chang Zheng4 Department of Mechanical & Aerospace Engineering, University of Strathclyde, Glasgow G1 1XJ, UK Hubei Key Laboratory of Intelligent Geo-Information Processing, China University of Geosciences, Wuhan 430074, China Hubei Key Laboratory of Intelligent Geo-Information Processing, China University of Geosciences, Wuhan 430074, China Department of Mechanical & Aerospace Engineering, University of Strathclyde, Glasgow G1 1XJ, UK Hubei Key Laboratory of Intelligent Geo-Information Processing, China University of Geosciences, Wuhan 430074, ChinaWith 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.https://doi.org/10.1155/2015/827987 |
| spellingShingle | Maocai Wang Zhiming Song Guangming Dai Lei Peng Chang Zheng Asteroids Exploration Trajectory Optimal Design with Differential Evolution Based on Mixed Coding International Journal of Distributed Sensor Networks |
| title | Asteroids Exploration Trajectory Optimal Design with Differential Evolution Based on Mixed Coding |
| title_full | Asteroids Exploration Trajectory Optimal Design with Differential Evolution Based on Mixed Coding |
| title_fullStr | Asteroids Exploration Trajectory Optimal Design with Differential Evolution Based on Mixed Coding |
| title_full_unstemmed | Asteroids Exploration Trajectory Optimal Design with Differential Evolution Based on Mixed Coding |
| title_short | Asteroids Exploration Trajectory Optimal Design with Differential Evolution Based on Mixed Coding |
| title_sort | asteroids exploration trajectory optimal design with differential evolution based on mixed coding |
| url | https://doi.org/10.1155/2015/827987 |
| work_keys_str_mv | AT maocaiwang asteroidsexplorationtrajectoryoptimaldesignwithdifferentialevolutionbasedonmixedcoding AT zhimingsong asteroidsexplorationtrajectoryoptimaldesignwithdifferentialevolutionbasedonmixedcoding AT guangmingdai asteroidsexplorationtrajectoryoptimaldesignwithdifferentialevolutionbasedonmixedcoding AT leipeng asteroidsexplorationtrajectoryoptimaldesignwithdifferentialevolutionbasedonmixedcoding AT changzheng asteroidsexplorationtrajectoryoptimaldesignwithdifferentialevolutionbasedonmixedcoding |