一种空间飞行器编队重组的轨道优化方法  

Trajectory Planning Algorithm for Spacecraft Formation Reconfiguration

作　　者：王抒雁[1,2] 郑昌文[1] 王宇心[1] 胡晓惠[1] 

机构地区：[1]中国科学院软件所综合信息系统技术国家级重点实验室,北京100080 [2]中国科学院研究生院,北京100049

出　　处：《系统仿真学报》2008年第21期5947-5952,共6页Journal of System Simulation

基　　金：国家自然科学基金(10577021)

摘　　要：现有的空间飞行器编队重组的轨道规划方法在求解能量最优策略时,都预先给定了变轨花费的时间,但没有说明给定的时间是怎么选择的。将空间飞行器主从编队重组的轨道规划视为一个多目标优化问题,提出了一种小生境进化算法。该方法通过使用特定的染色体表示方法和进化算子,能有效的搜索到飞行器编队重组轨道规划问题的时间-能量前沿,并引入等值分享法保证优秀个体具有较大的选中概率和前沿的多样性。该方法能同时提供多种变轨方案,编队飞行的任务制定者从而可以根据实际应用情况选择最合适的方案。仿真结果表明了该方法的正确性。In exist algorithms of spacecraft formation reconfiguration, the end-time of maneuver is always given, but it is not clear how it is chosen. The trajectory planning for spacecraft formation reconfiguration was modeled as a Multi-objective Optimization Problem and a niched evolutionary algorithm was proposed to find the Time-Fuel Pareto optimal frontier With a problem specific real-value representation of candidate solutions and evolutionary operators, the approach could generate multiple solutions simultaneously. Higher selected probability of better individuals and the diversity of the frontier were guaranteed by equivalence class sharing. From these solutions, one could choose the best one based on actual application. The simulation results demonstrate the feasibility of the approach.

关 键 词：空间飞行器 编队重组 轨道规划 进化算法 PARETO前沿 

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