首页 | 本学科首页   官方微博 | 高级检索  
     检索      

序列凸优化的小天体附着轨迹优化
引用本文:刘延杰,朱圣英,崔平远.序列凸优化的小天体附着轨迹优化[J].宇航学报,2018,39(2):177-183.
作者姓名:刘延杰  朱圣英  崔平远
作者单位:1. 北京理工大学宇航学院,北京 100081;2.深空自主导航与控制工信部重点实验室,北京 100081; 3.飞行器动力学与控制教育部重点实验室,北京 100081
基金项目:国家重点基础研究发展计划(973计划)(2012CB720000);国家自然科学基金(61374216, 61304248, 61304226);基础科研计划(JCKY2016602C018);民用航天项目
摘    要:针对小天体附着多约束轨迹优化问题,提出一种基于序列凸优化的轨迹优化方法。首先采用内球谐引力场模型对目标小天体附近的不规则引力场进行精确建模,内球谐引力场模型是对经典球谐系数法的改进,形式简单,计算量小,并且克服了经典球谐系数模型在形状不规则的小天体附近不收敛的问题。对于小天体附着多约束轨迹优化问题,通过约束松弛、线性化、离散化过程,转化为一个可以迭代求解的二阶锥规划问题(SOCP),进而采用内点法进行解算。数学仿真结果显示,优化结果符合各项约束条件,以零速度到达了目标着陆点,且符合燃耗最优的优化目标。利用序列凸优化算法进行小天体附着燃耗最优轨迹设计,推导简便,计算速度快,精度高,具有应用价值。

关 键 词:小天体附着  轨迹优化  内球谐引力场  二阶锥规划  内点法  
收稿时间:2017-04-25

Soft Landing Trajectory Optimization on Asteroids by Convex Programming
LIU Yan jie,ZHU Sheng ying,CUI Ping yuan.Soft Landing Trajectory Optimization on Asteroids by Convex Programming[J].Journal of Astronautics,2018,39(2):177-183.
Authors:LIU Yan jie  ZHU Sheng ying  CUI Ping yuan
Institution:1. School of Aerospace Engineering, Beijing Institute of Technology, Beijing 100081, China;  2.Key Laboratory of Autonomous Navigation and Control for Deep Space Exploration, Ministry of Industry and Information Technology, Beijing 100081, China;  3.Key Laboratory of Dynamics and Control of Flight Vehicle, Ministry of Education, Beijing 100081, China
Abstract:This paper presents a strategy for the soft landing trajectory optimization on an asteroid. The interior gravity field model, a counterpart of the classical spherical harmonic model, is used to estimate the gravity acceleration near the target asteroid. This model has an advantage in computational efficiency and its convergence properties can be guaranteed within the constructed interior Brillouin sphere. The soft-landing optimization problem on an asteroid is converted into a successive second-order convex programming (SOCP) through constraints slack, linearization of dynamics and discretization which can be solved by the primal-dual interior-point methods. The numerical simulations shows that the lander arrives at the target site with zero velocity and all the constraints are satisfied. The fuel consumption is also optimal. Solving soft-landing optimization problem on an asteroid with convex programming has an advantage in computational effectiveness and can potentially be implemented in the future asteroid mission.
Keywords:Soft landing  Trajectory optimization  Interior gravity field  Second order convex programming  Primal dual interior points    
本文献已被 CNKI 等数据库收录!
点击此处可从《宇航学报》浏览原始摘要信息
点击此处可从《宇航学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号