引用本文: | 张润德,蔡伟伟,杨乐平,等.采用可达域覆盖的多航天器协同护卫策略.[J].国防科技大学学报,2024,46(3):12-20.[点击复制] |
ZHANG Runde,CAI Weiwei,YANG Leping,et al.Multi-spacecraft cooperative guard strategy based on reachable domain coverage[J].Journal of National University of Defense Technology,2024,46(3):12-20[点击复制] |
|
|
|
本文已被:浏览 2418次 下载 1360次 |
采用可达域覆盖的多航天器协同护卫策略 |
张润德,蔡伟伟,杨乐平,朱彦伟 |
(国防科技大学 空天科学学院, 湖南 长沙 410073)
|
摘要: |
针对高轨高价值目标护卫问题,提出了一种基于可达域覆盖的多航天器协同护卫策略。从相对运动视角对协同护卫任务进行了描述,并将威胁源多脉冲机动可达域问题建模为凸优化问题求解。在滚动优化框架下,根据动态更新的威胁源终端可达域,设计协同护卫平面及护卫点,以此为终端位置约束构建多航天器协同轨迹规划模型,生成相应护卫轨迹。仿真结果表明,所提出的可达域分析方法能够快速计算威胁源终端可达域,协同护卫策略在多个场景下均能有效阻止威胁源,且护卫成功率随护卫航天器机动能力增强而增大。 |
关键词: 协同护卫策略 凸优化 滚动优化 可达域 |
DOI:10.11887/j.cn.202403002 |
投稿日期:2023-03-16 |
基金项目: |
|
Multi-spacecraft cooperative guard strategy based on reachable domain coverage |
ZHANG Runde, CAI Weiwei, YANG Leping, ZHU Yanwei |
(College of Aerospace Science and Engineering, National University of Defense Technology, Changsha 410073, China)
|
Abstract: |
Aiming at guarding high-orbit high-value targets, a multi-spacecraft cooperative guard strategy based on reachable domain coverage was proposed. The cooperative guard mission was described from the perspective of relative motion, and the multi-pulse reachable domain of the threat was modeled as a convex optimization problem. In the framework of receding optimization, the guard planes and points were designed based on the dynamically updated terminal reachable domain of threat, and a multi-spacecraft cooperative trajectory planning model was constructed with the guard points as terminal position constraints, the corresponding guard trajectories were generated. Simulation results show that the proposed method can quickly calculate the terminal reachable domain of the threat. The cooperative guard strategy can effectively prevent the threat in multiple scenarios, and the guard success rate increases with the enhancement of the maneuvering ability of the guard spacecraft. |
Keywords: cooperative guard strategy convex optimization receding optimization reachable domain |
|
|
|
|
|