Yue-He Zhu

Yue-He Zhu

Auto-generated profile, based on publicly available information

Yue-He Zhu

College of Aerospace Science and Engineering, National University of Defense Technology, Changsha, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
20 September 2023 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
JLJun Liang
Jun Liang
JLJian-Ping Liu
Jian-Ping Liu
QSQing Sun
Qing Sun
YZYue-He Zhu
Yue-He Zhu
YZYi-Chuan Zhang
Yi-Chuan Zhang
BHBo-Yong He
Bo-Yong He
Real-time emergency event processing for mega-constellation management requires an approach that can quickly obtain a satisfactory satellite range rescheduling scheme. In this paper, a deep reinforcement learning (DRL) approach is proposed for rapid rescheduling on the basis of established satellite range scheduling schemes. Three rescheduling principles with different impacts on established scheduling schemes are first analyzed. A mathematical model for both maximizing the completion profits of dynamic missions and minimizing their impacts on scheduled missions is formulated. An efficient DRL-based approach to satellite range rescheduling is then developed. A mask processing mechanism is integrated into the reinforcement learning framework to effectively eliminate the conflicts accurately expressed by the conflict space, and a modified pointer network (Ptr-Net) based on the mask processing mechanism is employed to approximate the action-value function for optimal decision-making. Experimental results show that the proposed approach significantly outperforms the rule-based heuristic and another DRL-based method in terms of computational efficiency and optimization performance, and the total time spent during the training and testing phases of the proposed approach is approximately 13% of the total running time required by the search-based methods.

15 March 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
YXyingjie xu
yingjie xu
Xiaolu LiuXiaolu Liu
Xiaolu Liu
RHRenjie He
Renjie He
YZYuehe Zhu
Yuehe Zhu
YZYahui Zuo
Yahui Zuo
Lei HeLei He
Lei He
To prevent the proliferation of space debris and stabilize the space environment, active debris removal (ADR) has increasingly gained public concern. Considering the complexity of space operations and the viability of ADR missions, it would be necessary to schedule the ADR process in order to remove as much debris as possible. This paper presents an active debris removal mission planning problem, devoted to generate an optimal debris removal plan to guide the mission process. According to the problem characteristics, a two-layer time-dependent traveling salesman problem(TSP) mathematical model is established, involving the debris removal sequence planning and the transfer trajectory planning. Subsequently, two main novel methods based on machine learning are proposed for the ADR mission planning problem, including a deep neural networks(DNN)-based estimation method for approximating the optimal velocity increments of perturbed multiple-impulse rendezvous and an reinforcement learning(RL)-based method for optimizing the sequence of debris removal and rendezvous time. Experimental results of different simulation scenarios have verified the effectiveness and superiority of the proposed method, indicating the good performance for solving the active debris removal mission planning problem.

31 December 2020 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
YZYue-He Zhu
Yue-He Zhu
YLYazhong Luo
Yazhong Luo
The design of multitarget rendezvous missions requires a method to quickly and accurately approximate the optimal transfer between any two rendezvous targets. In this paper, an artificial neural network-based method is proposed for the rapid approximation of optimal perturbed long-duration impulsive transfers. The relationship between the optimal transfer velocity increments and the initial right ascension of the ascending node difference between the departure body and the rendezvous target is analyzed, and the result suggests that the perturbed long-duration impulsive transfers should be divided into three types. An efficient database generation method is developed. Three regression multilayer perceptrons are trained individually and applied to approximate the corresponding types of transfers. The simulation results show that the well-trained multilayer perceptrons are capable of quickly estimating the optimal velocity increments with a relative error of less than 3% for all three types of transfers. Additional tests of the debris chains with total velocity increments of several thousand m/s show that the estimation results are very close to the optimized results, with a final estimation error of less than 10 m/s.

1 February 2025 in Astrodynamics
Verified
Journal Article
Closed access
PDF file
YZYu Zhang
Yu Zhang
YZYuehe Zhu
Yuehe Zhu
JZJiacheng Zhang
Jiacheng Zhang
HWHanwei Wang
Hanwei Wang
KJKe Jin
Ke Jin
LFLifeng Fu
Lifeng Fu

1 July 2024 in Journal of Guidance, Control, and Dynamics
Verified
Journal Article
Closed access
YZYue-He Zhu
Yue-He Zhu
YZYu Zhang
Yu Zhang
YLYazhong Luo
Yazhong Luo
JZJia-Cheng Zhang
Jia-Cheng Zhang

16 September 2025 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
JZJia Cheng Zhang
Jia Cheng Zhang
YZYue He Zhu
Yue He Zhu
YLYazhong Luo
Yazhong Luo
YZYu Zhang
Yu Zhang
Global trajectory optimization of multitarget successive rendezvous missions is studied. A learning-based method is proposed to train a neural network offline, which can directly generate the near-optimal rendezvous sequence online. A neural network structure based on the attention mechanism is developed to extract combinatorial features among multiple on-orbit bodies. Physical equations and neural networks are integrated to generate solutions in a recurrent manner. The sequence generator can be trained and applied in cases with diverse values and sizes. A local refinement approach is applied to the generator to enhance the final solution quality. A reinforcement parallel learning algorithm is specifically designed for efficient model training. Numerical simulations are conducted on general random cases and global trajectory optimization competition (GTOC) problems. The well-trained solver can efficiently produce a sequence that is equivalent to the solution obtained via traditional advanced heuristics. When the trained sequence generator is applied to multispacecraft rendezvous sequence planning, the target assignment optimization process clearly accelerates due to fast sequence generation. The sequence and time of the GTOC winner's solution is reoptimized and better results were obtained, indicating that the proposed model performs significantly well in terms of solution quality.