基于改进蚁群算法的航天器再入轨迹优化  

Spacecraft Reentry Trajectory Optimization Based on Improved Ant Colony Algorithm

作　　者：王银[1] 王斌 WANG Yin;WANG Bin(School of Electronic Information Engineering,Taiyuan University of Science and Technology,Taiyuan 030024,China)

机构地区：[1]太原科技大学电子信息工程学院,太原030024

出　　处：《太原科技大学学报》2020年第4期270-274,共5页Journal of Taiyuan University of Science and Technology

基　　金：山西省自然科学基金资助项目(2015021089)。

摘　　要：基于十进制蚁群算法对航天器再入轨迹进行了优化设计。给出了过载约束下的航天器再入轨迹优化的数学模型,对模型进行归一化及离散化处理,采用罚函数法对约束进行处理,将连续、高度非线性的优化问题转化为无约束的离散最优问题。针对传统蚁群算法易陷入局部最小值的问题,将增加了局部搜索策略的十进制蚁群算法应用于轨迹优化中,在满足过载约束的条件下实现总吸热量最小的目标。仿真结果表明十进制蚁群算法与传统蚁群算法相比能跳出局部最优值并快速地搜索得到航天器最优再入轨迹。The decimal ant colony algorithm is introduced to optimize the spacecraft skip reentry trajectory.Firstly,the mathematical model of spacecraft reentry trajectory optimization under overload constraints is given,and the mathematical model is normalized and discretized,the penalty function method is used to deal with constraints,the continuous and highly nonlinear optimization problem is converted into unconstrained discrete optimal problem.In order to avoid the problems in traditional ant colony algorithm to be easily trapped in the local minimum,the decimal ant colony algorithm with local search strategy is presented.The simulation results show that the optimal reentry trajectory can be quickly obtained and local optimum can be effectively jumped out by using decimal ant colony algorithm compared with the traditional ant colony algorithm.

关 键 词：十进制蚁群算法 罚函数法 再入轨迹优化 

分 类 号：V412.44[航空宇航科学与技术—航空宇航推进理论与工程]