A Pattern Search Method to Optimize Mars Exploration Trajectories

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 38
  • Download : 0
The Korean National Space Council recently released "Mars Exploration 2045" as part of its future strategic plan. The operations for a Mars explorer can be defined based on domestically available capabilities, such as ground operations, launch, in-space transport and deep space link. Accordingly, all of our exploration scenarios start from the Naro space center, and the pathway to Mars is optimized using an objective function that minimizes the required increment V. In addition, the entire phase of Mars orbit insertion should remain in contact with our deep space antennas, a measure that is imposed as an operational constraint. In this study, a pattern search method is adopted, as it can handle a nonlinear problem without relying on the derivatives of the objective function, and optimal trajectories are generated on a daily basis for a 15-day launch period. The robustness of this direct search method is confirmed by consistently converged solutions showing, in particular, that the ascending departure requires slightly less increment V than the descending departure on the order of 10 m/s. Subsequently, mass estimates are made for a Mars orbiter and a kick stage to determine if the desired increment V is achievable with our eco-friendly in-space propulsion system when launched from our indigenous launch vehicle, KSLV-II.
Publisher
MDPI
Issue Date
2023-10
Language
English
Article Type
Article
Citation

AEROSPACE, v.10, no.10

ISSN
2226-4310
DOI
10.3390/aerospace10100827
URI
http://hdl.handle.net/10203/315227
Appears in Collection
AE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0