Planning algorithm for multiple satellite clusters

A generalized planning methodology for satellite clusters is proposed. The methodology utilizes Hamilton-Jacobi-Bellman optimality (minimum time or minimum fuel) to generate quickly a set of maneuvers from an initial stable formation to a final stable formation. Maneuvers are selected from the original set based on the maneuver time, fuel, and collision proximity. The final maneuvers are calculated by optimizing the switch times using a realistic set of orbital dynamics. The algorithm is developed to be distributed and scales well as the number of satellites increases. A minimal level of communication is used because only switch times and collision proximity information are distributed from the planner. An example with four satellites maneuvering in an eccentric orbit (e = 0.2) is presented. Results show that optimal cluster maneuvers (minimum time or minimum fuel) can be generated within minutes, and most of the computational implementation can be accomplished in parallel.