检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:韩威华[1,2,3] 杨新[1] 姜萌哲
机构地区:[1]中国科学院光电研究院,北京100094 [2]中国科学院大学,北京100049 [3]北京航天飞行控制中心,北京100094
出 处:《系统工程与电子技术》2013年第12期2566-2571,共6页Systems Engineering and Electronics
基 金:中国科学院光电研究院自主部署研究生创新基金"雏鹰计划"(Y30B02A18Y)资助课题
摘 要:在实效性要求高的空间操控任务中,脉冲轨道的优化设计必不可少。针对脉冲轨道转移和交会的优化设计问题,基于hp自适应伪谱法设计一种通用方法,以直接法计算为主,综合使用间接法主矢量理论交互式规划出最优N脉冲轨道的机动方案。该方法以hp自适应伪谱法直接求解首末端双脉冲机动,依据间接法最优脉冲机动满足的主矢量必要条件进行检验,通过增加脉冲或者首末端漂移进行交互式规划,逐步确定出最优脉冲数目N的值,再采用hp自适应伪谱法求解出各脉冲速度增量的矢量与施加时刻,获得脉冲轨道的优化设计。提供2个仿真场景算例,求解过程和结果表明,该方法对初值敏感度小、鲁棒性强、收敛快、实用有效,可以便捷处理脉冲轨道的优化设计问题。The optimal design of impulse trajectories is essential in space-assembly and space-succor. A no-vel algorithm for solving general minimum-fuel N impulsive orbit maneuver,e, g. orbit transfer and rendezvous, is proposed. The developed algorithm combines a primer vector obtained through the use of a Yamanaka-Ank-ersen state transition matrix and an interactive optimization approach based on an hp-adaptive pseudospctral method to calculate the N-impulse velocities directly. The approach starts from two-impulse calculated by the hp-adaptive pseudospctral method at initial and terminal points, and is checked by satisfying the necessary condi-tions for the primer vector. By the reference of the obtained primer vector magnitude information, adding initial coast, final coast or a new mid-impulse is tried. Provided the number of multiple-impulse N is fixed, its numeri-cal result of the N-impulse velocities and the time can be calculated by the hp-adaptive pseudospctral method. Through the interactive procedure, the optimal N-impulsive orbit maneuvers are designed. The simulation and outcomes demonstrate that the algorithm is fairly robust, quickly converged and able to deal with the optimal design of N-impulse trajectories efficiently and practically.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30