Optimal Design Method of Gradient Segmentation Interval for Spacecraft Pulse Rendezvous Trajectories

Abstract

An optimization and design Method For gradient division of intervals of a spacecraft pulse rendezvous trajectory belongs to orbit design and optimization technologies in the field of spacecraft orbit dynamics and control, and in particular, to a rendezvous trajectory design technology in which a global optimization solution to a spacecraft rendezvous trajectory is obtained through calculation based on an interval arithmetic mathematical model. For the global problem of the method, a gradient optimization result is only used for determining an interval segmentation point and updating a value of an upper bound of a target function, thereby preserving overall importance of an interval optimization algorithm. For the problem of a large computation amount in the interval optimization algorithm, a gradient optimization method is introduced, so as to update the value of the upper bound of the target function quickly and use a gradient segmentation method; and in combination with a symbol segmentation method and an interval optimization strategy, intervals that do not comprise an optimal solution are effectively separated and removed, thereby improving operational efficiency. To resolve the problem of high storage requirements of the interval optimization algorithm, only a limited number of intervals are selected for processing in each iteration, thereby ensuring that a storage space overflowing phenomenon does not occur in an operation.

Description

technical field [0001] The invention belongs to the orbit design and optimization technology in the field of spacecraft orbit dynamics and control, and relates to a spacecraft using the thrust generated by a jet thrust device such as a rocket engine carried by it to interact with a predetermined natural celestial body or another spacecraft at the same time. The design technology of the rendezvous orbit that reaches the same position at the same speed at the same time, especially the rendezvous orbit design technology based on the global optimal solution of the spacecraft rendezvous trajectory calculated by using the interval arithmetic mathematical model. Background technique [0002] In mission analysis of a spacecraft, orbit design plays an important role. In orbit design tasks, the design of a rendezvous orbit that exerts force on a spacecraft so that it reaches the same position at the same time with the same speed as a predetermined natural celestial body or another spa...

AI Technical Summary

Problems solved by technology

In 2013, Tong Chen et al. published a paper named "Optimization of time-open constrained Lambertrendez vous using interval analysis" on "Journal of Guidance, Control and Dynamics", pointing out the shortcomings of the interval optimization method, such as excessive storage requirements and easy memory overflow during operation, and disclosed a method for spacecraft The method of combining the interval optimization method and the gradient optimization method for the optimal design of the pulse intersection trajectory. This method first uses the interval optimization method to obtain some intervals containing the global optimal value whose interval width does not meet the predetermined requirements, and then uses the gradient optimization method instead. The method performs local optimization calculations, which improves the optimization efficiency, but the price is that the global optimality of the optimization results cannot be guaranteed.

[0007] In summary, although there are many existing methods available for the optimal design of spacecraft pulse rendezvous trajectories, each has its own shortcomings, and generally cannot guarantee the global optimality of the optimization results

Theoretically, the disadvantages of the existing interval optimization methods that can guarantee to obtain the global optimal solution are mainly the large amount of computation and high storage requirements when applied to practical problems. The existing methods for solving these two problems often use at the cost of breaking the guarantee of global optimality

Images