Spacecraft rendezvous and docking trajectory planning event constraint convexity method

Abstract

The invention discloses a spacecraft rendezvous and docking trajectory planning event constraint convexity method, and belongs to the technical field of aerospace. The implementation method comprises the following steps of: discretizing an event constraint solution space to obtain a series of spatially discrete grids; calculating a constraint function value at each discrete grid boundary point, and performing interpolation on constraint function data to obtain a linear expression form of a constraint function; constructing an event detection function, and performing relaxation and convex grid judgment constraint on an event constraint function to obtain a convex event constraint function form; constructing a switching function, describing an original event trigger function, and obtaining a convex expression form of the event trigger function; and solving the convex expression form to obtain an optimal spacecraft rendezvous and docking trajectory, thereby improving convergence and efficiency of spacecraft rendezvous and docking trajectory planning with event constraints on the premise of not changing an original problem solution space.

Description

technical field [0001] The invention relates to a convexization method constrained by a trajectory planning event of a spacecraft, and is especially suitable for convexization of a trajectory planning event constraint of a spacecraft rendezvous and docking, and belongs to the technical field of aerospace. Background technique [0002] Spacecraft trajectory planning is a key technology to realize deep space exploration and near-Earth space missions, and has important application value in spacecraft rendezvous and docking missions. Due to the docking events in the spacecraft rendezvous and docking mission, the rendezvous and docking trajectory of the spacecraft is discontinuous, and there are discontinuous event constraints in the planning of the rendezvous and docking trajectory. On the one hand, how to overcome discontinuity, deal with event constraints, and obtain a constraint form that is convenient for trajectory planning is a difficult point that needs to be solved. On ...

AI Technical Summary

Problems solved by technology

[0005] In order to solve the problems of low calculation efficiency and poor convergence that often occur when the existing method is used to perform convexization of trajectory planning event constraints, the technical problems to be solved by a convexization method of spacecraft rendezvous and docking trajectory planning event constraints disclosed by the present invention are: On the premise of not using the sequence approximation method, the event constraint is converted into a convex form equivalently, and the event constraint function is non-destructively convexized using real variables, and then the solution space with event constraints is improved without changing the solution space of the original problem. Convergence and Efficiency of Spacecraft Rendezvous and Docking Trajectory Planning

Images