Interpolation-Enhanced Powered Descent Guidance for Onboard Nominal, Off-Nominal, and Multi-X Scenarios
Interpolation-Enhanced Powered Descent Guidance for Onboard Nominal, Off-Nominal, and Multi-X Scenarios
复制标题
DOI:
10.2514/6.2015-0850
复制
发表时间:
2015-01
期刊:
影响因子:
--
通讯作者:
D. Scharf;S. Ploen;Behçet Açikmese
中科院分区:
文献类型:
--
作者:
D. Scharf;S. Ploen;Behçet Açikmese
Next-generation soft-landing missions for interplanetary exploration can require large diverts during powered descent for precision/pinpoint landing or avoiding large hazards. However, Apollo-era polynomial powered descent guidance can incur prohibitive system-level mass penalties for large diverts. Recent advances in convexification of the fully constrained, fuel-optimal, powered-descent problem can remove these penalties and enable large diverts. To do so, the convexified problem must be solved in near-realtime onboard a lander using a radiation-hardened processor. The convexified powered descent problem requires a line-search to find the optimal time-of-flight, which can require solving for 10 or more divert trajectories. Here it is shown empirically that, over the engineering range of interest for landing on Mars, both the optimal time-of-flight and optimal propellant mass for powered descent can be accurately predicted via interpolation from a reasonably-sized grid of initial conditions. This engineering-level interpolability is significant. First, the time-of-flight line-search can be replaced with interpolation from a small table, immediately reducing the run-time by a factor of 10. Second, to trigger powered descent while a lander is descending on chute or a deorbit trajectory, the optimal propellant mass to reach the target can be looked-up over a finite horizon. If the propellant to reach the target starting a divert now is a local minimum and/or viable, then powered descent can be initiated. Third, for Multi-X, in which a lander selects from a list of safe targets, the optimal target can be selected quickly from hundreds of possibilities by simply looking up the propellant mass for each target and selecting the lowest. Fourth, if there is insufficient propellant to reach a target, the point closest to the target that can be reached can be approximated through a grid-based search using interpolated propellant mass. Fifth and finally, the farthest possible divert can also be approximated by finding the largest propellant-feasible distance over a grid of targets.