The Nereus asteroid rendezvous mission design with multi-objective hybrid optimization

Qiao Dong*, Cui Pingyuan, Cui Hutao

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

As one of the potential candidates of the Asteroid Exploration Mission to be launched around 2010, we investigated the feasible mission scenarios. Firstly, according to goal and constraints of the mission, the opportunity for asteroid exploration mission is analyzed. The 4660 Nereus is selected as the candidate. We searched and presented the optimal rendezvous opportunity for 4660 Nereus from 2009 to 2010. Through analyzing the direct transfer trajectory, unexpected result that the trajectory would pass the 12866 asteroid and 7080 asteroid is found. Then, we calculated and optimized the new profile with multiple flybys by using the hybrid search algorithm combing the genetic algorithm with Sequential Quadratic Programming method. Finally, we analyzed the trajectory characteristics and gave some key parameters, which would have a direct impact on communication system, power system, thermal control system of spacecraft, and so on.

Original languageEnglish
Title of host publication1st International Symposium on Systems and Control in Aerospace and Astronautics
Pages587-592
Number of pages6
Publication statusPublished - 2006
Externally publishedYes
Event1st International Symposium on Systems and Control in Aerospace and Astronautics - Harbin, China
Duration: 19 Jan 200621 Jan 2006

Publication series

Name1st International Symposium on Systems and Control in Aerospace and Astronautics
Volume2006

Conference

Conference1st International Symposium on Systems and Control in Aerospace and Astronautics
Country/TerritoryChina
CityHarbin
Period19/01/0621/01/06

Fingerprint

Dive into the research topics of 'The Nereus asteroid rendezvous mission design with multi-objective hybrid optimization'. Together they form a unique fingerprint.

Cite this