GUARANTEED INITIALIZATION OF DISTRIBUTED SPACECRAFT FORMATIONS
GUARANTEED INITIALIZATION OF DISTRIBUTED SPACECRAFT FORMATIONS
复制标题
保证分布式航天器编队的初始化
DOI：
10.2514/6.2003-5590
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
Linh Phan
中科院分区：
文献类型：
--
作者：
D. Scharf;S. Ploen;F. Hadaegh;J. Keim;Linh Phan
本文提出了一种解决N个深空分布式航天器的编队初始化问题的方法。文中给出了一个分析证明，证明了该算法保证了约束于单个平面的N个航天器的编队初始化。还提供了初始化平面编队的时间的上限。然后，我们以NASA的Ve航天器地球探测器任务为例，对我们的FI算法进行了仿真。
In this paper we present a solution to the formation initialization (FI) problem for N distributed spacecraft located in deep space. Our solution to the FI problem is based on a three-stage sky search procedure that reduces the FI problem for N spacecraft to the simpler problem of initializing a set of sub-formations. An analytical proof demonstrating that our algorithm guarantees formation initialization for N spacecraft constrained to a single plane is presented. An upper bound on the time to initialize a planar formation is also provided. We then demonstrate our FI algorithm in simulation using NASA’s v e-spacecraft Terrestrial Planet Finder mission as an example.