Jin Zhang

Jin Zhang


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2011 in Science China Technological Sciences
Verified
Journal Article
Closed access
PDF file
JZJin Zhang
Jin Zhang
YLYaZhong Luo
YaZhong Luo
GTGuoJin Tang
GuoJin Tang

21 September 2021 in Aerospace
Verified
Journal Article
Open access
PDF file
CPChenyuan Peng
Chenyuan Peng
JZJin Zhang
Jin Zhang
BYBing Yan
Bing Yan
YLYazhong Luo
Yazhong Luo
With the rapid development of on-orbit services and space situational awareness, there is an urgent demand for multisatellite flyby inspection (MSFI) that can obtain information about a large number of space targets with little fuel consumption in a short time. There are two kinds of constraints, namely inspection constraints (ICs) at each flyby point and transfer process constraints (TPCs) in the actual mission. Further considering the influence of discrete and continuous variables such as inspection sequence, time, and maneuver scheme, it is complex and difficult to solve MSFI. To optimize it efficiently, the task flow and the problem model are defined firstly. Then, the algorithm framework based on constraint repairing is given, which contains repair methods of the ICs and the TPCs. Finally, the proposed method is compared with the nonrepair optimization method in two numerical examples. The results indicate that when the constraints are hard to meet, it is better and more efficient than the nonrepair method.

28 December 2020 in Astrodynamics
Verified
Journal Article
Closed access
PDF file
SGShuai Guo
Shuai Guo
WZWanmeng Zhou
Wanmeng Zhou
JZJin Zhang
Jin Zhang
FSFuyu Sun
Fuyu Sun
DYDateng Yu
Dateng Yu

1 January 2015 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
YZYuehe Zhu
Yuehe Zhu
HWHua Wang
Hua Wang
JZJin Zhang
Jin Zhang
Since most spacecraft multiple-impulse trajectory optimization problems are complex multimodal problems with boundary constraint, finding the global optimal solution based on the traditional differential evolution (DE) algorithms becomes so difficult due to the deception of many local optima and the probable existence of a bias towards suboptimal solution. In order to overcome this issue and enhance the global searching ability, an improved DE algorithm with combined mutation strategies and boundary-handling schemes is proposed. In the first stage, multiple mutation strategies are utilized, and each strategy creates a mutant vector. In the second stage, multiple boundary-handling schemes are used to simultaneously address the same infeasible trial vector. Two typical spacecraft multiple-impulse trajectory optimization problems are studied and optimized using the proposed DE method. The experimental results demonstrate that the proposed DE method efficiently overcomes the problem created by the convergence to a local optimum and obtains the global optimum with a higher reliability and convergence rate compared with some other popular evolutionary methods.

12 February 2016 in Engineering Optimization
Verified
Journal Article
Closed access
HBHui-Jiao Bu
Hui-Jiao Bu
JZJin Zhang
Jin Zhang
YLYa-Zhong Luo
Ya-Zhong Luo
This article studies the optimization of space station short-term mission planning (STMP) problems. The domain knowledge including description and the concept definitions of the STMP problem are presented, an STMP constraint satisfaction model is developed, and then an iterative conflict-repair method with the resolving strategies is proposed to satisfy complicated constraints. A genetic algorithm (GA) is adopted to optimize the STMP problem. The proposed approach is evaluated using a test case with 15 missions, 13 devices and three astronauts. The results show that the established STMP constraint satisfaction model is effective, and the iterative conflict-repair method can make the plan satisfy all constraints considered and can effectively improve the optimization performance of the GA.

9 January 2021 in International Journal of Aerospace Engineering
Verified
Journal Article
Open access
PDF file
LYLuyi Yang
Luyi Yang
HLHaiyang Li
Haiyang Li
JZJin Zhang
Jin Zhang
YLYazhong Luo
Yazhong Luo
Lunar exploration architecture can be made more flexible and reliable with the support of a low-Earth orbit (LEO) space station. This study therefore evaluated a proposed hybrid optimization scheme to design the entire trajectory of a reusable spacecraft starting from trans-Earth injection (EI) at the perilune and ending at an LEO space station. As such a trajectory has multiple constraints and multiple dynamical models, it is divided into the trans-Earth phase, aerocapture phase, and postatmospheric phase. The optimization scheme is performed at two levels: sublevel and top level. At the sublevel, two novel pseudo rules are proposed to optimize the trans-Earth trajectory so that it satisfies the coplanar constraints of the space station. Then, in the aerocapture phase, the bank angle is optimized to satisfy the mission constraints, and in the atmospheric phase, the one-impulsive maneuver is performed and optimized to insert the spacecraft into the target space station orbit. The multiple phases are connected to each other by boundary conditions where the terminal state of the previous phase is transformed into the initial state of the following phase. At the top level, the vacuum perigee height is selected as the mission design variable based on problem characteristics analysis and a hybrid optimization scheme is conducted to minimize the total velocity increment. The simulation results demonstrate that the proposed hybrid optimization method is effective for the design of an entire trajectory with acceptable velocity cost which is less than that in the previous study. The coplanar constraints of the space station and other mission constraints in each phase are also satisfied. Furthermore, the proposed trajectory design method is shown to be applicable to a reusable spacecraft returning to an LEO space station parked in any arbitrary orbital plane.