首页> 外文期刊>IEEE Transactions on Aerospace and Electronic Systems >Violation Learning Differential Evolution-Based hp-Adaptive Pseudospectral Method for Trajectory Optimization of Space Maneuver Vehicle
【24h】

Violation Learning Differential Evolution-Based hp-Adaptive Pseudospectral Method for Trajectory Optimization of Space Maneuver Vehicle

机译:基于差分学习的基于差分进化的hp自适应伪谱方法在空间机动飞行器弹道优化中的应用

获取原文
获取原文并翻译 | 示例
           

摘要

The sensitivity of the initial guess in terms of optimizer based on an hp-adaptive pseudospectral method for solving a space maneuver vehicle's (SMV) trajectory optimization problem has long been recognized as a difficult problem. Because of the sensitivity with regard to the initial guess, it may cost the solver a large amount of time to do the Newton iteration and get the optimal solution or even the local optimal solution. In this paper, to provide the optimizer a better initial guess and solve the SMV trajectory optimization problem, an initial guess generator using a violation learning differential evolution algorithm is introduced. A new constraint-handling strategy without using penalty function is presented to modify the fitness values so that the performance of each candidate can be generalized. In addition, a learning strategy is designed to add diversity for the population in order to improve the convergency speed and avoid local optima. Several simulation results are conducted by using the combination algorithm; simulation results indicated that using limited computational efforts, the method proposed to generate initial guess can have better performance in terms of convergence ability and convergence speed compared with other approaches. By using the initial guess, the combinational method can also enhance the quality of the solution and reduce the number of Newton iteration and computational time. Therefore, the method is potentially feasible for solving the SMV trajectory optimization problem.
机译:长期以来,人们已经认识到,基于基于hp自适应伪谱方法的优化器来解决空间机动飞行器(SMV)轨迹优化问题的初始猜测的敏感性是一个难题。由于对初始猜测的敏感性,求解器可能会花费大量时间进行牛顿迭代并获得最优解甚至局部最优解。为了给优化器提供更好的初始猜测并解决SMV轨迹优化问题,本文介绍了一种采用违背学习差分进化算法的初始猜测生成器。提出了一种不使用惩罚函数的新约束处理策略来修改适应度值,从而可以概括每个候选者的表现。此外,还设计了一种学习策略,以增加总体的多样性,以提高收敛速度并避免局部最优。使用组合算法进行了一些仿真结果。仿真结果表明,采用有限的计算量,与其他方法相比,提出的初始猜测方法在收敛能力和收敛速度方面具有更好的性能。通过使用初始猜测,组合方法还可以提高解的质量,并减少牛顿迭代的次数和计算时间。因此,该方法对于解决SMV轨迹优化问题可能是可行的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号