论文信息 - GUARANTEED INITIALIZATION OF DISTRIBUTED SPACECRAFT FORMATIONS

GUARANTEED INITIALIZATION OF DISTRIBUTED SPACECRAFT FORMATIONS

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.

[1] F. Y. Hadaegh,et al. On the validity of the double integrator approximation in deep space formation flying , 2002 .

[2] Fred Y. Hadaegh,et al. Initialization of distributed spacecraft for precision formation flying , 2003, Proceedings of 2003 IEEE Conference on Control Applications, 2003. CCA 2003..

[3] Steven R. Lay. Analysis: An Introduction to Proof , 1986 .

[4] Sien-Chong Wu,et al. Positioning with Autonomous Formation Flyer (AFF) on Space-Technology 3 , 1999 .

[5] S. Ploen,et al. A survey of spacecraft formation flying guidance and control (part 1): guidance , 2003, Proceedings of the 2003 American Control Conference, 2003..

[6] F.Y. Hadaegh,et al. A survey of spacecraft formation flying guidance and control. Part II: control , 2004, Proceedings of the 2004 American Control Conference.

[7] R. Smith,et al. Multi-spacecraft trajectory optimization and control using genetic algorithm techniques , 2000, 2000 IEEE Aerospace Conference. Proceedings (Cat. No.00TH8484).

[8] F. Y. Hadaegh,et al. COLLISION AVOIDANCE GUIDANCE FOR FORMATION-FLYING APPLICATIONS , 2001 .