基于R-tree索引的卫星可见窗口快速算法

FAST ALGORITHM OF SATELLITE VISIBLE WINDOWS BASED ON R-TREE INDEXING

  • 摘要: 针对地球观测卫星多星多目标场景下可见窗口计算耗时过高问题提出一种快速计算方法。该方法将多对多观测问题分解为若干单对单子问题,依据星下点轨迹R-tree索引获取待观测目标周边星下点轨迹信息,结合二分法确定卫星对该目标可见时间窗口的起止时刻。对锥形、矩形两种视场类型的卫星观测仿真结果表明,可见时刻结果精确至1ms时,该算法得到的可见时刻与Satellite ToolKit(STK)的平均误差为-8.5×10^-4s,与跟踪传播法相比能够减少99%以上的计算冗余,平均耗时是以1ms为步长的跟踪传播法的0.01%,能够同时满足实际工程应用中对目标观测窗口计算精度和时效性要求。

     

    Abstract: A fast algorithm is proposed to alleviate the time-consuming problem of the visible window calculation in multi-satellite and multi-target observation scenarios. This method decomposed the many-to-many observation problem into several one-to-one sub-problems, obtaining the surrounding suborbital track of each satellite to the observation target by R-tree indexing. Combining with the bisection method, the starting and ending time of the visible time window of the satellite to the observing target was determined. The simulation results of satellite observations for conical and rectangular fields of views show that: for visible time results with 1ms accuracy, the proposed algorithm obtains an average error around -8.5×10^-4 s compared with the STK (Satellite ToolKit) results. Compared with the tracking and propagation algorithm, it can reduce the computational redundancy by more than 99%, and the average time-consuming is 0.01% of the tracking and propagation algorithm with a step size of 1ms. The proposed algorithm can meet the accuracy and efficiency requirements of target observation window calculation in practical engineering applications.

     

/

返回文章
返回