Particle Swarm Optimization for Time-Optimal Spacecraft Reorientation with Keep-Out Cones

Abstract

This paper deals with the problem of spacecraft time-optimal reorientation maneuvers under boundaries and path\ud constraints. The minimum time solution with keep-out constraints is proposed using the particle swarm optimization\ud technique. A novel method based on the evolution of the kinematics and the successive obtainment of the control law is\ud presented and named as inverse dynamics particle swarm optimization. It is established that the computation of the\ud minimum time maneuver with the proposed technique leads to near-optimal solutions, which fully satisfy all the\ud boundaries and path constraints

Minimum-Fuel Control Strategy for Spacecraft Formation Reconfiguration via Finite-Time Maneuvers

“…Therefore, Eqs (44-49) can be expressed in a matricial form as required in Eq. (34). This exercise is left to the reader.…”

“…The particles move through the set of acceptable and meaningful solutions, referred to as the feasible search space, modifying their position (i.e., the values of the M optimization parameters associated with it) through an appropriate perturbation named velocity. During the evolution, the generic ith particle is evaluated at the step k through the performance index J k i , which takes into account the goal of the optimization and the imposed constraints [34]. To obtain the impulsive control scheme, the PSO developed by the authors and presented in [15] is employed in this work.…”

“…More explicitly, they indicate the dimension of matrix H in Eq. (34). Here, a full reconfiguration maneuver lasting 16 chief orbital periods is considered, assuming the initial and desired relative configuration summarized in Table 1 (i.e., a c Δδα des 0; −5.115x10 3 ; 329.5; −272.2; 734; 624.7 T m).…”

Optimal Continuous Maneuvers for Satellite Formation Reconfiguration in J2-perturbed Orbits

“…where * is a user-defined parameter, 0 and are the initial and final values, respectively. It is worth remarking that the particles can move only within the FSS since the velocity and the displacement are constrained to lie inside the hyper-parallelepiped with lower limits and and upper limits and , respectively 18 , i.e.…”

Spacecraft Attitude Motion Planning Using Gradient-Based Optimization

“…Performing motion planning on SO(3) carries benefits over representations such as Euler angles [1,2] and quaternions [3][4][5][6]. Euler angles are defined only locally and exhibit kinematic singularities which can limit the width of the maneuvers.…”