期刊文献+

一种多约束条件下的三脉冲交会优化设计方法 被引量:4

Optimization method for three-impulse rendezvous under multi-constraints
下载PDF
导出
摘要 针对空间快速接近定点观测任务,研究了具有交会时间和转移路径约束的多约束条件下的共面圆轨道间远距离三脉冲最优交会问题,将Hill制导方法与粒子群算法相结合求解转移路径点以及转移时机的最优解。在求解过程中,提出一种等价变换的方法,将原始待求量转化为一组新的相互独立的待求变量,将原始的各约束项转化为易描述和处理的搜索空间边界条件,为完成算法的初始化过程带来了便利,使得算法设计过程更为简洁。最后,给出了两组三脉冲最优交会仿真实验,仿真结果不仅验证了所提算法的有效性,而且表明,相对于常规的设置惩罚项处理约束的方法,采用本文所提出的等价变换方法处理约束项后,算法表现出更强大的搜索能力及更好的稳定性。 The optimal three-impulse remote rendezvous between coplanar circles under multi-constraints including rendezvous time constraint and transfer path constraint is studied for the fast approaching and fixed-point observation mission in space. The Hill guidance and particle swarm optimization are combined to solve the optimal solution of transfer path point and transfer time. An equivalent transformation is proposed to transform the original variables to be solved into a new set of variables which are independent of each other. By applying this transformation algorithm, the original constraints are converted into the searching space boundaries which are easy to describe and cope with, such that it is convenient to perform the initialization and conduct the algorithm design. Finally, two simulation experiments of optimal three-impulse rendezvous are given. The results not only verify effectiveness of the proposed algorithm, but also indicate that compared with the conventional penalization method used to deal with constraints, the algorithm adopting the proposed equivalent transformation shows more powerful search ability and stronger stability.
作者 李君龙 李松洲 周荻 LI Junlong;LI Songzhou;ZHOU Di(Beijing Institute of Electronic System Engineering,Beijing 100854,China;School of Astronautics,Harbin Institute of Technology,Harbin 150001,China)
出处 《系统工程与电子技术》 EI CSCD 北大核心 2022年第8期2612-2620,共9页 Systems Engineering and Electronics
基金 国家自然科学基金(61773142)资助课题。
关键词 三脉冲交会 Hill制导 粒子群优化 多约束 等价变换 three-impulse rendezvous Hill guidance particle swarm optimization multi-constraint equivalent transformation
  • 相关文献

参考文献5

二级参考文献32

  • 1Edward T W L, Ho Y C. Universal alignment probabilities and subset selection for ordinal optimization [ J ]. Journal of Optimization Theory and Applications, 1997, 93 (3) : 455 - 489.
  • 2Ho Y C. An explanation of ordinal optimization : soft computing for hard problems [ J ]. Information Sciences, 1999, 113 ( 3 ) : 169 - 192.
  • 3Lin S Y, Ho Y C. Universal alignment probability revisited[ J]. Journal of Optimization Theory and Application, 2002, 113 (2) : 399 - 407.
  • 4林来兴.空间交会对接技术[M].北京:国防工业出版社,1999.
  • 5Robert W, Farquhar R W. NEAR mission overview and trajectory design [C]//AAS/AIAA Astrodynamics Conference. Halifax, Nova Scotia: AAS, 1995: 8-14.
  • 6Dunham D W. NEAR mission design[R]. Johns Hopkins APL Teehieal Digest, 2002,23(1) : 18-32.
  • 7Sims J A. Delta-V gravity-assist trajectory design: theory and practice[D]. West Lafayette, US: Purdue University, 1996.
  • 8艾利斯哥尔兹.变分法[M].苏联国立技术理论出版社,1956.
  • 9Carl G. Optimization of interplaneary trajectories with unpowered planetary swingbys [J]. AAS, 1987,65(1):253- 272.
  • 10Damario L A, Sackett L L, Stanford R H, et al. Optimization of multiple flyby trajectories [J]. AAS, 1979,40 (1) :459-494.

共引文献56

同被引文献22

引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部