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

编队卫星队形重构防碰撞最优轨迹规划
引用本文:黄海滨,马广富,庄宇飞.编队卫星队形重构防碰撞最优轨迹规划[J].航空学报,2010,31(9):1818-1823.
作者姓名:黄海滨  马广富  庄宇飞
作者单位:哈尔滨工业大学,航天学院,黑龙江,哈尔滨,150001
摘    要: 针对编队卫星队形重构的轨迹规划问题,提出了直接配置混合整数线性规划(DCMILP)方法。首先将卫星编队飞行问题进行简化,整个过程使用线性化描述;继而将三阶Simpson方法扩展至编队卫星的队形重构过程中,将各卫星的状态量和控制量在各节点处离散化;然后根据目标函数及碰撞规避问题等各种约束条件,将整个过程转化为混合整数线性规划问题,从而可以找到该非凸问题的全局最优解。最后,通过对三维和二维两组编队卫星队形重构进行仿真,由结果可以看出,与传统方法相比该方法快速有效,能够满足实时性的要求,使得卫星编队的自主运行成为可能。

关 键 词:队形重构  碰撞规避  直接配置法  混合整数线性规划  非凸优化  

Optimal Trajectory Planning for Reconfiguration of Satellite Formation with Collision Avoidance
Huang Haibin,Ma Guangfu,Zhuang Yufei.Optimal Trajectory Planning for Reconfiguration of Satellite Formation with Collision Avoidance[J].Acta Aeronautica et Astronautica Sinica,2010,31(9):1818-1823.
Authors:Huang Haibin  Ma Guangfu  Zhuang Yufei
Institution:School of Astronautics, Harbin Institute of Technology
Abstract:This article presents a direct collocation mixed integer linear programming (DCMILP) method for energy-optimal trajectory planning of satellite formation reconfiguration. First, the formation flying problem is simplified to that of linear formulation. Second, the three-order Simpson method is extended to the formation reconfiguration problem, and the state and control variables are discretized at the nodes. Then, by means of the objective function, collision avoidance and other constraints, the formation reconfiguration problem is transformed into a problem of mixed integer linear programming so as to find a global optimal solution to this non-convex optimization problem. Finally, the three-dimension and two-dimension simulation results demonstrate that this method is able to solve the problem in a short time and that it can be used as an on-line algorithm of trajectory planning for formation reconfiguration.
Keywords:formation reconfiguration  collision avoidance  direct collocation method  mixed integer linear programming  non-convex optimization
本文献已被 万方数据 等数据库收录!
点击此处可从《航空学报》浏览原始摘要信息
点击此处可从《航空学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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