基于四叉树网格的卫星可见性快速获取方法
DOI:
CSTR:
作者:
作者单位:

1.天津职业技术师范大学 自动化与电气工程学院 天津;2.中国电子科技集团有限公司第五十四研究所 航天系统与应用专业部 石家庄

作者简介:

通讯作者:

中图分类号:

TP391.9

基金项目:

天津市教委科研计划项目 (2021KJ049);


Fast satellite visibility retrieval method based on quad-tree grid
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    卫星对地面目标的可见性计算是卫星任务规划的基础环节。随着在轨卫星数量的急剧增加和任务需求的日益复杂化,传统的卫星可见性计算方法已难以满足实时计算的需求。针对这一问题,本研究提出了一种基于多级网格的卫星可见性快速获取方法。该方法首先将地球二维表面划分为基于空间四叉树结构的多级网格,随后设计了一种基于区域空间变换的卫星覆盖区域计算方法,并将计算结果以自底向上的方式递归填充至多级网格中。最终,通过构建完成的四叉树可见性网格,实现了在工程应用中实时获取卫星与目标可见性的目的。为验证本方法的有效性,研究中将所提出的可见性计算方法与传统的基于STK的可见性计算方法进行了对比。实验结果表明,在计算100个卫星对10000个目标的可见性时,本方法仅用时14.79 s,显著优于STK的23.08 h。这一对比结果充分证明了本文算法在计算效率上的优越性,为大规模卫星任务规划提供了有效的技术支持。

    Abstract:

    Satellite visibility calculation for ground targets is a fundamental aspect of satellite mission planning. With the rapid increase in the number of on-orbit satellites and the growing complexity of mission requirements, traditional satellite visibility calculation methods have struggled to meet the demands of real-time computation. To address this issue, this study proposes a fast satellite visibility acquisition method based on a multi-level grid. This method first divides the two-dimensional surface of the Earth into a multi-level grid based on a spatial quadtree structure. Subsequently, a satellite coverage area calculation method based on regional spatial transformation is designed, and the calculation results are recursively filled into the multi-level grid in a bottom-up manner. Finally, by constructing the completed quadtree visibility grid, the study achieves the goal of real-time acquisition of satellite-to-target visibility in engineering applications. To validate the effectiveness of the proposed method, the study compares the proposed visibility calculation method with the traditional STK-based visibility calculation method. Experimental results show that when calculating the visibility of 100 satellites to 10,000 targets, the proposed method takes only 14.793 seconds, significantly outperforming STK"s 23.083 hours. This comparison fully demonstrates the superior computational efficiency of the proposed algorithm, providing effective technical support for large-scale satellite mission planning.

    参考文献
    相似文献
    引证文献
引用本文

曾凡琳,宋庆龙,王港,朱光熙,张超,王萍,侯谨毅.基于四叉树网格的卫星可见性快速获取方法计算机测量与控制[J].,2026,34(6):223-228.

复制
分享
相关视频

文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2025-07-15
  • 最后修改日期:2025-08-03
  • 录用日期:2025-08-04
  • 在线发布日期: 2026-06-25
  • 出版日期:
文章二维码