Heuristic optimization of satellite reorientation maneuvers

The minimum-time spacecraft reorientation problem has a relatively short history, and consists in finding the optimal torque that ensures fulfillment of the desired final attitude conditions. Path constraints related to the existence of exclusion cones, corresponding to bright sources that the satellite sensor must avoid, are taken into account. This work investigates the problem using different heuristic techniques, including the particle swarm and the firework algorithm with inverse dynamics, the covariance matrix adaptationevolutionary strategy, and an indirect heuristic method. Moreover, the analytical conditions for the existence of optimal finite-length constrained arcs in the presence of exclusion cones are derived.