摘要
研究了在轨航天器快速转移区域的求解问题,针对目前研究缺少对相关区域进行系统的定义和算法复杂的问题,定义了追踪区和遭遇区的概念,研究了在时间和燃耗约束下求解追踪器和目标器交会时追踪区、遭遇区的一种简单可行方法,利用全局搜索算法实现了以上区域的确定,并进一步对比了在不同约束下,追踪区和遭遇区的分布特点,并利用遗传算法对上述区域优化求解。数值仿真结果表明提出的方法可以快速、准确地确定空间快速转移任务中追踪区、遭遇区,并可用于评估快速转移任务的可行性、执行时机、能量最大消耗等指标,为快速转移轨道选择和设计提供依据。
In present studies, an exact definition of fast - transfer area for on - orbit spacecraft is not established and the current algorithm is complex. The definition of tracing area and encountering area was presented in this pa- per. Also a simple and feasible method based on the overall - searching algorithm was given to determine the areas under the restrictions of time and fuel, and the difference of areas under different restrictions was further studied. In addition, a method was presented to optimize the solution and prove the validity using genetic algorithms. The numer- ical simulation results indicate that the method is reasonable and simple to determine the areas, which can be used to evaluate the feasibility, maneuver time and fuel consumption of fast transfer.
出处
《计算机仿真》
CSCD
北大核心
2013年第4期25-28,共4页
Computer Simulation
基金
国家863高技术研究发展计划(2011AA8012012D)
关键词
在轨航天器
快速转移
追踪区
遭遇区
数值仿真
On - orbit spacecraft
Fast transfer
Tracing area
Encountering area
Numerical simulation
