...
首页> 外文期刊>Engineering Optimization >Fixed-point algorithms for optimal ascent trajectories of launch vehicles
【24h】

Fixed-point algorithms for optimal ascent trajectories of launch vehicles

机译:用于运载火箭最佳上升轨迹的定点算法

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

获取外文期刊封面封底 >>

       

摘要

A fixed-point formulation and the associated algorithms for rapid generation of optimal ascent trajectories of launch vehicles through the atmosphere are presented. The complete ascent trajectory is tacitly divided into an endo-atmospheric and an exo-atmospheric portion. Since the exo-atmospheric trajectory can be obtained reliably and rapidly, a special form of two-point boundary value problem (TPBVP) is formulated in the endo-atmospheric portion. This special TPBVP leads to a sequence of nested fixed-point problems. Several algorithmic options to solve these problems using modified fixed-point iterations are discussed. The main advantages of the fixed-point formulation and algorithm are software simplicity and more robust convergence. Numerical results, both in open-loop trajectory generation and closed-loop simulations, are presented to demonstrate the discussions. The algorithm is validated and verified by comparing the results with the results obtained from existing method.
机译:提出了定点公式和相关算法,用于快速生成运载火箭通过大气的最佳上升轨迹。完整的上升轨迹默认分为内层大气层和外层大气层。由于可以可靠且快速地获得大气外的轨迹,因此在大气内部分中制定了一种特殊形式的两点边值问题(TPBVP)。这种特殊的TPBVP会导致一系列嵌套的定点问题。讨论了使用修正的定点迭代来解决这些问题的几种算法选项。定点公式和算法的主要优点是软件简单和收敛性强。给出了开环轨迹生成和闭环仿真中的数值结果,以证明这些讨论。通过将结果与从现有方法获得的结果进行比较,对算法进行验证和验证。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号