检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘育昊 张兵 方子今 LIU Yuhao;ZHANG Bing;FANG Zijin(CASIC Space Engineering Development Co.,Ltd.,Beijing 100854,China;Graduate School,The Second Research Academy of CASIC,Beijing 100854,China)
机构地区:[1]航天科工空间工程发展有限公司,北京100854 [2]航天科工第二研究院研究生院,北京100854
出 处:《现代防御技术》2024年第1期57-64,共8页Modern Defence Technology
摘 要:针对当前的天基空间观测任务中存在的观测效率低、燃料不足等问题,基于粒子群算法与空间多目标观测模型提出一种空间多目标掠飞观测的接近轨道设计方法以实现观测器在不变轨道的情况下实现对特定多目标的近距离掠飞观测。结合两轨道卫星的距离计算与天光地影条件建立空间多目标观测模型。利用粒子群算法对观测器轨道六根数优化,得到对特定多目标的综合最近距离观测的最优轨道,以轨道高度差产生的周期差抵消目标与交线处位置的相位差,以消耗时间为代价得到了最省燃料的方式。利用仿真说明了该轨道设计方法的有效性。Aiming at the problems of low observation efficiency and insufficient fuel in current space-based space observation tasks,this paper proposes a close orbit design method for space multi-target skimming observation based on particle swarm optimization algorithm and space multi-target observation model to achieve the close range skimming observation of specific multi-target under the condition of constant orbit.The space multi-target observation model is established by combining the distance calculation of two orbiting satellites with the conditions of sky light and earth shadow.The particle swarm optimization algorithm is used to optimize the number of six orbits of the observer to obtain the optimal orbit for the comprehensive closest distance observation of a specific multi-target.The periodic difference generated by the orbital height difference is used to offset the phase difference between the target and the position at the intersection in a way that consumes time to get the most fuel-efficient way,and the formula for the most fuel saving is obtained at the cost of time.Finally,the numerical method is used to illustrate the effectiveness of the orbit design method.
关 键 词:多目标观测 轨道设计 天光地影条件 粒子群算法 掠飞观测 燃料最优
分 类 号:TJ76[兵器科学与技术—武器系统与运用工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.117.189.91