摘要
文章研究了在时间和燃料约束下实现空间两异面椭圆轨道间远程交会的可交会区、初始目标区和追踪窗口集的确定方法。首先定义了远程交会中可交会区、初始目标区和追踪窗口集的概念。基于双脉冲Lambert交会理论,提出了两异面椭圆轨道间远程交会的可交会区等区域的确定方法;设计了基于Newton-Raphson方法的全局迭代搜索算法,实现了对不同交会时间条件下满足总脉冲约束的以上区域的确定。通过算例仿真,分析了以上区域大小和分布与约束条件之间的关系。结果表明该方法可以快速准确地确定远程交会任务中的可交会区和追踪窗口集,可用于评估交会任务的可行性、执行时机以及交会时间和能耗等,为航天器任务选择和设计提供参考依据。
Subsection 1.1 of the full paper defines and explains the long-range orbital rendezvous section and initial target section. Subsection 1.2 defines and explains the chase window. Subsection 2. 2 derives eqs. (13) and (16) and, with the help of Fig. 3, which is the flow chart of an algorithm, explains how to determine the initial target section and the long-range orbital rendezvous section, which is needed for long-range orbital rendezvous between two non-coplanar elliptic orbits under the constraints of time and total fuel consumption. Subsection 2. 3, with the help of Fig. 4, which is the flow chart of another algorithm, explains how to determine the chase window. Section 3 simulates the long-range orbital rendezvous section, the initial target section and the chase window as related to the rendezvous time and maneuver impulse. The simulation results, shown in Figs. 5 through 9 and Table 2, demonstrate preliminarily that the method thus designed can Dreciselv determine the rendezvous section and the chase window.
出处
《西北工业大学学报》
EI
CAS
CSCD
北大核心
2010年第1期7-12,共6页
Journal of Northwestern Polytechnical University
基金
国家自然科学基金(10802064)资助
关键词
远程交会
可交会区
初始目标区
追踪窗口集
orbits, algorithms, long-range orbital rendezvous, rendezvous section, initial target section, chase window