Interception time and uncertainty optimization for tangent-impulse orbit interception problem
Yang Hong, Li Xin-hong, Ding Wen-zhe
Defence Technology · 2022
doi:10.1016/j.dt.2021.02.006 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
The traditional tangent impulse interception problem does not consider the influence of actual deviation. However, by taking the actual state deviation of the interceptor into the orbit design process, an interception orbit that is more robust than the nominal orbit can be obtained. Therefore, we study the minimum time interception problem and the minimum terminal interception error problem under tangent impulse conditions and give an orbit optimization method that considers the interception time and the interception uncertainty. First, we express the interceptor's transfer time equation as a form of flight path angle, establish a global optimization model for solving the minimum time tangent impulse interception and give a hybrid optimization algorithm based on Augmented Lagrange Genetic Algorithm - Sequential Quadratic Programming (ALGA-SQP). Secondly, we use the universal time equation and Bootstrap resampling technology to calculate the interceptor's terminal error distribution and establish the relevant global optimization model by using the circumscribed cuboid volume of the interceptor's terminal position error ellipsoid as the optimization index. Finally, we combined the above two single-objective optimization models to establish a global multi-objective optimization model that considers interception time and interception uncertainty and gave a hybrid multi-objective optimization algorithm based on Non-dominated Sorting Genetic Algorithm II - Goal Achievement Method (NSGA2-GAM). The simulation example verifies the effectiveness of this method.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.