检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Huidong MA Gang ZHANG
机构地区:[1]Research Center of Satellite Technology,Harbin Institute of Technology,Harbin 150080,China
出 处:《Chinese Journal of Aeronautics》2023年第6期201-212,共12页中国航空学报(英文版)
基 金:supported in part by the National Natural Scientific Foundation of China(No.11772104);the Key Research and Development Plan of Heilongjiang Province,China(No.GZ20210120);the Fundamental Research Funds for the Central Universities,China.
摘 要:This paper proposes a fast calculation method to solve all mission opportunities for orbital interception and orbital rendezvous under the impulse-magnitude constraint.Different from the existing search methods,the proposed method does not need to solve Lambert's problem in the whole process.Three cases are considered for either departure time or transfer time being free,or both being free.For fixed departure time,the feasible windows of transfer time are obtained by solving a single-variable nonlinear equation only of terminal true anomaly.Similarly,for fixed interception(or rendezvous)time,the feasible windows of departure time are obtained.For free departure time and free transfer time,all mission opportunities are obtained by using a onedimensional search strategy.The hyperbolic-transfer and the multiple-revolution cases are also analyzed.Numerical results show that the proposed method is superior to the typical pork-chop plot method and the two-dimensional launch window method in computational time.
关 键 词:Mission opportunity Impulse-magnitude constraint Orbital interception Orbital rendezvous Pork-chop plot
分 类 号:V52[航空宇航科学与技术—人机与环境工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249