| Formation-Initialization Algorithm for N Spacecraft |
|
|
| May 01 2007 | |
|
A paper presents an algorithm to initialize a formation of N distributed spacecraft in deep space. Such formations will enable variable-baseline interferometers in future NASA missions designed to study the structure and origin of the universe. The algorithm described in the paper reflects some basic assumptions:
advertisement: The formation initialization algorithm proceeds by first dividing the spacecraft into two groups with antiparallel RPS sensor boresights. Next, the spacecraft perform a three-phase (in-plane, out-of-plane, and near-field) sky search involving synchronized maneuvers to ensure full sky coverage while maintaining front-to-front, simultaneous RPS sensor lock. During the sky search, the spacecraft are grouped into two classes of sub-formations. The initialization problem is then reduced to the simpler problem of joining the sub-formations.
The paper includes an analytical proof that the algorithm is guaranteed to initialize the formation as required. This work was done by Scott Ploen, Daniel Scharf, and Fred Hadaegh of Caltech for NASA’s Jet Propulsion Laboratory. For more information, download the Technical Support Package (free white paper) at www.techbriefs.com/tsp under the Mechanics/Machinery category. The software used in this innovation is available for commercial licensing. Please contact Karina Edmonds of the California Institute of Technology at (626) 395-2322. Refer to NPO-43040. This Brief includes a Technical Support Package (TSP).
Formation-Initialization Algorithm for N Spacecraft (reference NPO-43040) is currently available for download from the TSP library. Login first to download.
|
