检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王访寒 周如好 余薛浩 黄飞 陈海朋 WANG Fanghan;ZHOU Ruhao;YU Xuehao;HUANG Fei;CHEN Haipeng(Shanghai Institute of Spaceflight Control Technology,Shanghai 201109,China)
出 处:《上海航天(中英文)》2022年第2期45-52,共8页Aerospace Shanghai(Chinese&English)
摘 要:针对末端时间自由的上面级远程交会问题,提出一种基于序列凸优化的上面级远程交会轨迹优化方法。首先建立了末端时间自由的上面级远程交会模型,通过约束松弛和线性化等方法将该模型转化为一组可以迭代求解的凸优化问题。其次结合上面级发动机推力较大的特点,采用双脉冲变轨的计算结果作为迭代初值,进而减少迭代次数。最后用对偶内点法求出远程交会轨迹与推力控制序列。仿真结果表明:该方法计算速度快,实时性好,可为上面级远程交会任务提供参考。A trajectory optimization method of remote rendezvous for upper stage based on sequential convex optimization is proposed for solving the problem of remote rendezvous for upper stage with free terminal time. First,the remote rendezvous model for upper stage with free terminal time is established. The problem is transformed into a series of iterative convex optimization problems by means of constraint relaxation and linearization. Second,considering the characteristics of large thrust of the upper stage engine,the result of Lambert two-pulse orbit transfer is adopted as the initial iteration value in order to reduce the iteration times. Finally,the remote rendezvous trajectory and thrust sequence are achieved by using the primal-dual interior-point algorithm. The numerical simulation results show that the proposed method has a fast calculation speed and real-time performance,and can provide reference for remote rendezvous task of upper stage.
关 键 词:上面级 序列凸优化 远程交会 轨迹优化 有限推力
分 类 号:V412.4[航空宇航科学与技术—航空宇航推进理论与工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:160.79.109.31