为低推力卫星设计了实时碰撞避让的最晚启动时间计算方法。
Time-Optimal Collision Avoidance Via a Greedy Polynomial Backward Sweep
- 从最近距离时刻反向迭代，每步选择最小化风险的推力方向。
- 在大量碰撞场景中验证，结果接近最优控制基准，仅略损失性能。
- 适合需要快速决策的星上系统，计算效率高可实时运行。
低推力卫星的轨道碰撞避让不仅需确定如何机动，还需判断最晚何时启动才能确保安全。本文提出一种贪心时间最优（GTO）反向传播方法，从最近距离的名义时刻开始，逐步逆向推进，每一步选择使选定危险度量最小的推力方向。采用微分代数技术高效传播状态敏感性，并在线更新最近距离时刻。该方法在大规模碰撞事件数据集上测试，分别以最小距离和碰撞概率作为安全指标。结果表明，该方法精度高，相对于最优控制基准仅有小幅性能损失，同时保持适合星载实现的计算速度。
原文摘要 · Abstract (English)
Spacecraft collision avoidance for low-thrust satellites often requires determining not only how to maneuver, but also how late a maneuver can begin while still ensuring safety. This paper presents a greedy time-optimal (GTO) backward-sweep method to find the latest maneuver initiation time. The method starts from the nominal time of closest approach and iteratively propagates the maneuver backward in time, selecting at each step the thrust direction that locally minimizes the chosen danger metric. Differential algebra is used to efficiently propagate state sensitivities and update the time of closest approach online. The method is tested on a large dataset of conjunctions, using both miss distance and probability of collision as safety metrics. The approach achieves accurate results and only a small loss of optimality relative to an optimal-control benchmark, while retaining runtimes suitable for on-board implementation.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。