Notice of RetractionMulti-objective planning for orbital maneuver based on the improved Non-Dominated Sorting Genetic Algorithm

Notice of Retraction

After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

The improved Non-Dominated Sorting Genetic Algorithms (NSGA-II) based on the concept of Pareto optimization is applied in the orbital maneuver design of multi-objective optimization. Considering the situation that both the orbital transfer point of the chaser spacecraft and the intersection of the chaser spacecraft with the target spacecraft are undetermined, the problem of Lambert two-impulse orbital transfer with the optimizing of energy and time is studied. Using knowledge of orbital dynamics to establish a mathematical model of multi-objective orbital planning, the problem is solved by NSGA-II, and a number of Pareto solutions of orbital maneuver are obtained. In the end of the paper, two examples are given. One is the fuel optimal transfer between circular orbits, in which the computing results are compared with that of Hohmann transfer. The other is the fuel and time optimal transfer between elliptical orbits, in which the computing results are imported into STK for Verifying. The results show that this multi-objective planning method for orbital maneuver is reasonable and effective for solving the orbital transfer problem in which energy and time are optimized, and has a certain using value in engineering.