论文标题
有效搜索最佳花星
Efficient search of optimal Flower Constellations
论文作者
论文摘要
我们得出一个分析闭合表达式，以计算位于同一高度和圆形轨道上的任何两个卫星之间的最小距离（通过从地球中心测得的分离角度定量）。我们还利用了花星（FC）的几种特性，这些特性与我们的距离公式相结合，提供了一种有效的方法来计算卫星之间的最小角度距离，所有可能的FC具有多达给定数量的卫星的所有可能的FC。
We derive an analytical closed expression to compute the minimum distance (quantified by the angle of separation measured from the center of the Earth) between any two satellites located at the same altitude and in circular orbits. We also exploit several properties of Flower Constellations (FCs) that, combined with our formula for the distance, give an efficient method to compute the minimum angular distance between satellites, for all possible FCs with up to a given number of satellites.
