A Pattern Search Method to Optimize Mars Exploration Trajectories

被引:3
作者
Choi, Su-Jin [1 ]
Kang, Hongjae [2 ]
Lee, Keejoo [1 ]
Kwon, Sejin [3 ]
机构
[1] Korea Aerosp Res Inst, Daejeon 34133, South Korea
[2] Korea Inst Machinery & Mat, Daejeon 34103, South Korea
[3] Korea Adv Inst Sci & Technol, Daejeon 34141, South Korea
关键词
Mars exploration; eco-friendly propulsion system; optimal trajectory design; velocity increment ( increment V); pattern search method; 15-day launch period; COMPUTATION; MISSION; FUEL;
D O I
10.3390/aerospace10100827
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
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.
引用
收藏
页数:23
相关论文
共 50 条
  • [1] A parallel chaotic search optimization algorithm combined with pattern search method
    Liu, He
    Tian, Yu
    Huang, Dao
    Information, Management and Algorithms, Vol II, 2007, : 173 - 176
  • [2] Partial beanstalks for Mars exploration
    Parkinson, B
    JBIS-JOURNAL OF THE BRITISH INTERPLANETARY SOCIETY, 2005, 58 (5-6): : 197 - 200
  • [3] Swarm Exploration and Navigation on Mars
    Sand, S.
    Zhang, S.
    Muehlegg, M.
    Falconi, G.
    Zhu, C.
    Krueger, T.
    Nowak, S.
    2013 INTERNATIONAL CONFERENCE ON LOCALIZATION AND GNSS (ICL-GNSS), 2013,
  • [4] Mars Exploration Using Sailplanes
    Bouskela, Adrien
    Kling, Alexandre
    Schuler, Tristan
    Shkarayev, Sergey
    Kalita, Himangshu
    Thangavelautham, Jekan
    AEROSPACE, 2022, 9 (06)
  • [5] A Solution to Space Resection Based on Pattern Search Method
    Zeng, Huaien
    Yi, Qinglin
    2010 18TH INTERNATIONAL CONFERENCE ON GEOINFORMATICS, 2010,
  • [6] Solving Inverse Problem in Magnetocardiography by Pattern Search Method
    Swain, Pragyna Parimita
    Sengottuvel, S.
    Patel, Rajesh
    Mani, Awadhesh
    Selvaraj, Raja J.
    Satheesh, Santhosh
    IETE JOURNAL OF RESEARCH, 2023, 69 (07) : 4001 - 4011
  • [7] Evolutionary scenarios for the human exploration of Mars
    Parkinson, B
    JBIS-JOURNAL OF THE BRITISH INTERPLANETARY SOCIETY, 2005, 58 (5-6): : 201 - 205
  • [8] Technology development for human exploration of Mars
    Moore, Christopher L.
    ACTA ASTRONAUTICA, 2010, 67 (9-10) : 1170 - 1175
  • [9] Exploration of Mars Using Augmented Reality
    Arya, Manan
    Hassan, Saad
    Binjola, Swastik
    Verma, Poonam
    INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND APPLICATIONS, ICICA 2016, 2018, 632 : 1 - 10
  • [10] Artificial target location on Mars exploration
    Li, Ying
    Peng, Jing
    Du, Ying
    2014 SEVENTH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID 2014), VOL 2, 2014,