Trajectory optimization of space vehicle in rendezvous proximity operation with evolutionary feasibility conserving techniques
MetadatosMostrar el registro completo del ítem
In this paper, a direct approach is developed for discovering optimal transfer trajectories of close-range rendezvous of satellites considering disturbances in elliptical orbits. The control vector representing the inputs is parameterized via different interpolation methods, and an Estimation of Distribution Algorithm (EDA) that implements mixtures of probability models is presented. To satisfy the terminal conditions, which are represented as non-linear inequality constraints, several feasibility conserving mechanisms associated with learning and sampling methods of the EDAs are proposed, which guarantee the feasibility of the explored solutions. They include a particular implementation of a clustering algorithm, outlier detection, and several heuristic mapping methods. The combination of the proposed operators guides the optimization process in achieving the optimal solution by surfing the regions of the search domain associated with feasible solutions. Numerical simulations confirm that space transfer trajectories with minimum-fuel consumption for the chaser spacecraft can be obtained with terminal condition satisfaction in rendezvous proximity operation.