摘要
主要研究了时间最优多脉冲交会问题中最优交会时间和最优脉冲数随各因素的变化规律.建立了考虑路径约束的数学模型,并利用遗传算法对问题进行了求解.在此基础上通过大量的数值计算研究了共面圆轨道间交会问题中各因素(包括轨道半径比、初始相位差、燃料以及路径约束)对最优交会时间和最优脉冲次数的影响,并总结出了最优交会时间和最优脉冲数随各因素的变化规律.根据最优交会时间随各因素变化的曲线较为"平缓"(均为单调或只有一个极值)的事实,指出可以利用较少的特征点通过插值的方法来快速求解最优交会策略.结论对于空间营救和在轨规避等实际任务的轨道设计具有一定的参考价值.
Minimum-time, impulsive, fuel-fixed orbital rendezvous problem with path constraints was modeled and saluted with genetic algorithms. For several initial phase angles of the target relative to the vehicle, optimal solutions were obtained for a range of fixed-fuel consumptions and terminal radius, besides the influences of path constraints on the solutions were also considered. Finally, the rules how optimal numbers of impulses changing with these factors were determined. The results obtained can be used in missions with fuel and path constraints, such as space rescue operations and avoidance maneuvers.
出处
《北京航空航天大学学报》
EI
CAS
CSCD
北大核心
2009年第4期476-479,共4页
Journal of Beijing University of Aeronautics and Astronautics
关键词
轨道交会
时间最优
遗传算法
路径约束
orbital rendezvous
time-optimal
genetic algorithms
path constraints
