首页 >

基于热力图的低轨大规模星座任务—资源统一网格化表征与规划方法

尹谦1,唐伟2,顾轶1,伍国华3   

  1. 1. 中南大学
    2. 西北工业大学航空学院
    3. 中南大学,复杂系统智能决策研究中心
  • 收稿日期:2025-12-25 修回日期:2026-03-11 出版日期:2026-03-16 发布日期:2026-03-16
  • 通讯作者: 伍国华
  • 基金资助:
    融合学习策略的多车辆多无人机协同物流优化调度方法

Heatmap-Based Unified Grid Characterization and Planning Method for Task–Resource Scheduling in Large-Scale LEO Constellations

Qian YIN Yi GU2,   

  • Received:2025-12-25 Revised:2026-03-11 Online:2026-03-16 Published:2026-03-16

摘要: 低轨大规模星座凭借其资源数量多、全球覆盖以及搭载载荷类型多样等特点,在卫星资源对地观测等领域展现出巨大潜力。然而,现有的方法在任务与资源的统一表征与规划等方面仍存在不足,缺乏统一的描述模型,难以实现对多类型任务与卫星资源的有效整合与调度,尤其在大规模星座场景下,难以及时响应动态任务请求。为此,本文提出了一种基于H3网格的任务—资源统一表征框架:为实现对点目标、区域目标与移动目标的一致化表达与融合,将多类型任务统一转换为热力图,并设计了基于H3网格的点目标聚类算法、区域目标与移动目标分解算法,以实现对各类任务的高效处理。同时基于H3网格对卫星覆盖能力进行动态网格映射,形成包含“时间—侧摆角—网格”的资源能力编码,完成了资源能力的标准化与结构化表征。在此基础上,进一步提出了一种约束引导的任务规划算法(CGH-TS),算法以热力图网格任务与资源能力编码为输入,将传统“卫星—时间窗”约束显式转化为网格层面的可执行模式约束,并通过动态约束紧度评估与候选集更新实现快速分配,以提升任务分配的效率与质量。最后,通过仿真软件构建了包含240颗卫星的Walker星座进行实验验证。结果表明,本文所提出的基于H3网格的统一表征方法,可实现十万级网格的秒级生成,并在面积一致性和纬度稳定性方面优于GeoSOT网格表征方法;CGH-TS算法在任务完成率、资源均衡性和时间效率上均优于传统贪心算法与遗传算法。

关键词: 任务规划, 全球离散网格系统, 低轨大规模星座, 热力图

Abstract: Large-scale low Earth orbit (LEO) constellations, featuring abundant resources, global coverage, and diverse onboard pay-loads, show great potential for Earth observation applications. However, existing task planning methods still lack a unified representation of tasks and resources, making it difficult to effectively integrate and schedule multi-type tasks with re-sources—especially in large-scale constellations where timely responses to dynamic task requests are required. To address this issue, this paper proposes an H3-grid-based unified task–resource representation framework. To achieve consistent ex-pression and fusion of point targets, area targets, and moving targets, multi-type tasks are uniformly transformed into heatmaps, and H3-grid-based point-target clustering as well as decomposition algorithms for area and moving targets are designed to enable efficient processing of different task types. Meanwhile, satellite coverage capability is dynamically mapped onto the H3 grid to form a standardized and structured resource capability encoding that contains “time–off-nadir angle–grid cell” information. Building on this unified grid-based model, we further propose a constraint-guided task planning algorithm (CGH-TS). Taking grid tasks and the resource capability encoding as inputs, the algorithm explicitly transforms conventional “satellite–time-window” constraints into grid-level feasible execution-mode constraints, and achieves rapid assignment through dynamic constraint tightness evaluation and candidate-set updates, thereby improving both efficiency and solution quality. Finally, experiments are conducted using a simulation platform with a 240-satellite Walker constellation. Results show that the proposed H3-based unified representation can generate grids at the 10^5 scale within seconds and out-performs the GeoSOT grid representation in terms of areal consistency and latitudinal stability; moreover, CGH-TS outper-forms the conventional greedy algorithm and the genetic algorithm in task completion rate, resource balance, and computa-tional efficiency.

Key words: Task planning, Discrete Global Grid System (DGGS), Large-scale constellation, Heatmap

中图分类号: