首页> 外文会议>AIAA SciTech forum and exposition >Cut-Off Insensitive Guidance Algorithm for Instantaneous Impact Point (IIP) Change of Rocket
【24h】

Cut-Off Insensitive Guidance Algorithm for Instantaneous Impact Point (IIP) Change of Rocket

机译:火箭瞬时冲击点(IIP)变化的非敏感截止控制算法

获取原文

摘要

This paper proposes a feedback guidance algorithm for a rocket to change its instantaneous impact point (IIP) to a desired location under the uncertainty on the engine cutoff time. The proposed guidance law consists of three phases: 1) IIP change phase, 2) mode switching phase, and 3) IIP maintaining phase. The IIP change phase moves the IIP toward the desired IIP to minimize the fuel consumption. Analytic expressions describing the change in IIP due to the external acceleration (e.g., thrust) is derived and used for this phase. Solely using this phase can cause the miss targeting under the uncertainty on engine cut-off time (e.g., delay in engine cut-off). This issue can be dealt with by introducing the IIP maintaining guidance that keeps the IIP in the current position in the presence of the thrust. The acceleration command for maintaining the IIP is about 90 degree tilted relative to the command obtained in the IIP change phase. The mode switching phase makes the necessary transition between the two acceleration commands associated with the two different objectives (i.e., IIP change and the IIP maintaining) while taking the angular rate limitation of the rocket into account. The developed algorithm is demonstrated by implementing the algorithm in the first stage of a reusable launch vehicle and comparing the results with the open-loop optimal solution.
机译:本文提出了一种在发动机截止时间不确定的情况下,将火箭的瞬时冲击点(IIP)更改为所需位置的火箭的反馈制导算法。拟议的指导法包括三个阶段:1)IIP更改阶段,2)模式切换阶段和3)IIP维护阶段。 IIP更改阶段将IIP移向所需的IIP,以最大程度地减少燃油消耗。得出描述由于外部加速度(例如,推力)引起的IIP变化的解析表达式,并将其用于该阶段。仅在发动机关闭时间不确定的情况下(例如,发动机关闭延迟),单独使用此阶段可能会导致未命中目标。可以通过引入IIP维护指导来解决此问题,该指导可在存在推力的情况下将IIP保持在当前位置。用于维持IIP的加速命令相对于在IIP更改阶段中获得的命令倾斜大约90度。模式切换阶段在考虑到火箭的角速率限制的同时,在与两个不同目标关联的两个加速命令之间进行必要的转换(即,IIP更改和IIP保持)。通过在可重复使用的运载火箭的第一阶段实施该算法并将结果与​​开环最优解进行比较,证明了所开发的算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号