CAJ | 학술논문

建立载人火星探测任务规划的数学模型，确定边界条件、过程约束及指标函数，然后通过自适应遗传算法求解非线性规划问题进行载人探火任务分析与设计。仿真表明，对规模为100，变异率0.05的初始种群，基于归一化的优先选择策略仅需10~20代进化就可以给出较理想的载人探火方案。通过对比，该载人登火方案总速度脉冲需求明显小于Mars DRA 5.0的乘员转移方案。
건립재인화성탐측임무규화적수학모형，학정변계조건、과정약속급지표함수，연후통과자괄응유전산법구해비선성규화문제진행재인탐화임무분석여설계。방진표명，대규모위100，변이솔0.05적초시충군，기우귀일화적우선선택책략부수10~20대진화취가이급출교이상적재인탐화방안。통과대비，해재인등화방안총속도맥충수구명현소우Mars DRA 5.0적승원전이방안。
A mathematic model of manned Mars exploration scheduling was built. The boundary conditions, constraints and index function are determined. The manned Mars exploration mission was analyzed by solving nonlinear programming problem with adaptive genetic algorithm (AGA). Simulation showed that an ideal scheme can be found out by the selecting optimization strategy for the AGA population with a scale of 100 and a mutation rate of 0.05. The total velocity impulse required by the presented scheme was evidently lower than that of Mars DRA 5.0.