摘要
建立载人火星探测任务规划的数学模型,确定边界条件、过程约束及指标函数,然后通过自适应遗传算法求解非线性规划问题进行载人探火任务分析与设计。仿真表明,对规模为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.
出处
《导弹与航天运载技术》
北大核心
2013年第6期1-5,共5页
Missiles and Space Vehicles
关键词
载人探火
任务规划
自适应遗传算法
Manned Mars exploration
Mission planning
Adaptive genetic algorithm
