检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《北京航空航天大学学报》2009年第8期950-952,961,共4页Journal of Beijing University of Aeronautics and Astronautics
摘 要:主要研究了椭圆轨道燃料消耗最优的多脉冲编队队形重构问题.首先,基于Lawden方程的解析解,推导了多脉冲机动的数学模型.然后构造燃料最优目标函数,将总脉冲写成关于各脉冲作用时间和前n-2次脉冲大小的函数.然后利用遗传算法对问题进行求解,将结果转换到时间域,确定最终各脉冲的大小、方向和作用时间.最后进行了数学仿真,验证了算法的正确性.Satellite formation flying (SFF) reconfiguration using multiple impulses was studied, which was mainly focusing on fuel efficiency. The elliptic reference orbit was considered. First the mathematical description of multiple-burn maneuver was established based on the analytical solution of the Lawden equation. Then object function was constructed as the total fuel which took the form as function of the imposing time and the magnitude of the previous n-2 burns, followed with the problem being solved utilizing the genetic algorithm. Finally the result was transferred into time domain to determine the magnitude, direction and imposing time of each of the impulse vectors. The simulation shows that the algorithm presented could lead to a more efficient method to implement the SFF reconfiguration.
分 类 号:V412.4[航空宇航科学与技术—航空宇航推进理论与工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.140.192.22