Optimization of multi-mode rendezvous trajectories with constraints

Approximate numerical methods of optimization of spacecraft rendezvous trajectories are presented that make use of interior point algorithms for problems of linear programming of high dimensionality (tens to hundreds of thousands of variables). The basis of the methods is discretization of a trajectory into small segments in which maneuvers are allowed to be executed; for all segments sets of pseudo-impulses are introduced that determine the possible directions of the spacecraft thrust vector. The terminal conditions are presented in the form of a linear matrix equation. A matrix inequality for the sums of characteristic velocities of pseudo-impulses on each segment is used to make a transformation to the linear programming form. Spacecraft rendezvous trajectories are considered in the neighborhood of circular orbits with the use of multi-mode propulsion systems (including those with low thrust) and existence of boundary conditions at interior points and constraints on the time of operation of the propulsion system at separate segments of the trajectory.