首页> 外文期刊>Journal of guidance, control, and dynamics >Using Polynomial Optimization to Solve the Fuel-Optimal Linear Impulsive Rendezvous Problem
【24h】

Using Polynomial Optimization to Solve the Fuel-Optimal Linear Impulsive Rendezvous Problem

机译:使用多项式优化解决燃料最优的线性脉冲交会问题

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

摘要

THE first space missions involving more than one vehicle (Gemini, Apollo, and Vostok) have highlighted the fact that the space rendezvous between two spacecraft is a technology that raises relevant open control issues. Strictly speaking, the space rendezvous maneuver is an orbital transfer between a passive target and an actuated spacecraft, called the chaser, within a fixed or floating time period. Since the rendezvous maneuver can only be performed within a certain period of time while using as little fuel as possible to extend the chaser lifetime, we mainly focus on the so-called time-fixed fuel-optimal rendezvous problem [1,2].
机译:涉及多个运载工具(双子座,阿波罗和沃斯托克)的首次太空飞行任务突显了一个事实,即两个航天器之间的太空交会是一项引发相关开放控制问题的技术。严格来说,空间交会动作是在固定或浮动时间段内,被动目标与被称为追赶者的被驱动航天器之间的轨道转移。由于交会机动只能在一定时间内完成,同时使用尽可能少的燃料来延长追赶者的寿命,因此我们主要关注所谓的固定燃料最优交会问题[1,2]。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号