Zhao Wei

Dr. Zhao Wei

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
28 September 2021 in Astrodynamics
Verified
Journal Article
Open access
PDF file
Renhe ShiRenhe Shi
Renhe Shi
TLTeng Long
Teng Long
NYNianhui Ye
Nianhui Ye
YWYufei Wu
Yufei Wu
ZWZhao Wei
Zhao Wei
ZLZhenyu Liu
Zhenyu Liu
The design of complex aerospace systems is a multidisciplinary design optimization (MDO) problem involving the interaction of multiple disciplines. However, because of the necessity of evaluating expensive black-box simulations, the enormous computational cost of solving MDO problems in aerospace systems has also become a problem in practice. To resolve this, metamodel-based design optimization techniques have been applied to MDO. With these methods, system models can be rapidly predicted using approximate metamodels to improve the optimization efficiency. This paper presents an overall survey of metamodel-based MDO for aerospace systems. From the perspective of aerospace system design, this paper introduces the fundamental methodology and technology of metamodel-based MDO, including aerospace system MDO problem formulation, metamodeling techniques, state-of-the-art metamodel-based multidisciplinary optimization strategies, and expensive black-box constraint-handling mechanisms. Moreover, various aerospace system examples are presented to illustrate the application of metamodel-based MDOs to practical engineering. The conclusions derived from this work are summarized in the final section of the paper. The survey results are expected to serve as guide and reference for designers involved in metamodel-based MDO in the field of aerospace engineering.

30 November 2021 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
ZWZhao Wei
Zhao Wei
TLTeng Long
Teng Long
Renhe ShiRenhe Shi
Renhe Shi
YWYufei Wu
Yufei Wu
NYNianhui Ye
Nianhui Ye
To efficiently implement space debris removal missions on geostationary Earth orbit (GEO), a scheduling optimization scheme of multiple hybrid-propulsive servicing spacecraft (SSc) is proposed. In this scheme, a many-to-many task allocation coding model is established to formulate the removal sequences of debris targets with respect to different SSc. And a hybrid-propulsive orbit transfer strategy is developed to implement the debris removal maneuvers to save the propellant consumption and removal time simultaneously via using both electric and chemical propulsion systems. Then, the multiple GEO space debris removal scheduling optimization problem is formulated to minimize the total propellant consumption by exploring the optimal removal sequences and orbit maneuver parameters, subject to the available velocity increment, removal time, and many-to-many task allocation constraints. To effectively solve the scheduling optimization problem involving discrete-continuous mixed variables, a clustering based adaptive differential evolution algorithm with potential individual reservation (CADE-PIR) is proposed. In CADE-PIR, the k-means clustering method and potential individual reservation mutation strategy are employed to promote the convergence rate and performance of exploration and exploitation. In the end, a real-world GEO space debris removal mission with multiple SSc is investigated to demonstrate the effectiveness and practicality of the proposed optimization scheme.

10 May 2024 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
ZWZhao Wei
Zhao Wei
TLTeng Long
Teng Long
KTKang Tai
Kang Tai
Renhe ShiRenhe Shi
Renhe Shi
To improve the geostationary Earth orbit (GEO) debris removal efficiency and mission efficacy, a metamodel-based multidisciplinary design optimization (MDO) scheme of GEO debris removal satellites is proposed. In this work, the intercouplings between system design and mission planning are fully considered to formulate the GEO debris removal satellite MDO problem involving mixed discrete and continuous design variables. The satellite system design is investigated considering power, thermal control, and structure disciplines to obtain the subsystem performance parameters according to the removal mission requirements. In terms of the performance of satellite system, the floating number-based task allocation model and hybrid propulsion-based orbital transfer strategy are developed for efficient removal mission planning of multiple satellites. Then, a parallel adaptive Kriging method with constraint aggregation for mixed discrete-continuous optimization problem (PAKM-CA-DC) is proposed to efficiently minimize the total mass of multiple satellites subject to a number of practical engineering constraints including power usage, depth of discharge, thermal equilibrium temperature, and structural frequencies. Finally, the GEO debris removal satellite MDO engineering applications are implemented to validate the effectiveness and practicability of the proposed MDO scheme.

15 April 2024
Verified
Conference Paper
Open access
HZHuan Zhang
Huan Zhang
WMWeihuan Min
Weihuan Min
ZWZhao Wei
Zhao Wei
LKLi Kuang
Li Kuang
Honghao GaoHonghao Gao
Honghao Gao
HMHuaikou Miao
Huaikou Miao
Traditional software defect localization aims to locate defective files, methods, or code lines based on symptoms such as defect reports. In comparison, Just-In-Time (JIT) software defect localization focuses on identifying defective code lines when a defective code change is initially submitted. It can identify issues at the code line level before the defect becomes apparent, preventing it from adversely affecting the software. Although researchers have proposed various methods for JIT defect localization, existing methods still have the following shortcomings: (1) Most methods rely heavily on tokens from single code lines to calculate naturalness for defect localization, which makes it challenging to effectively distinguish between code lines that have the same content but different labels (defective code lines or non-defective code lines) - termed Duplicate Lines with Different Labels (DLDL). (2) Existing methods represent code in the form of sequences, neglecting the structural information of the code. Therefore, we propose a JIT defect localization method based on code graph representation. First, we construct code linelevel code graphs for code changes to distinguish DLDL explicitly. Next, to extract sequential and structural information from the code, we propose a code graph representation model with contrastive learning to generate graph feature vectors and node scores with rich semantics. Finally, we calculate the naturalness of code lines based on the graph feature vectors and node scores. Using this naturalness, we identify defective code lines. Experimental results show that our JIT defect localization method outperforms the state-of-the-art methods.

17 September 2025 in Applied Soft Computing
Verified
Journal Article
Closed access
ZWZhao Wei
Zhao Wei
COChin Chun Ooi
Chin Chun Ooi
YOYew-Soon Ong
Yew-Soon Ong

27 January 2026 in arXiv
Verified
Preprint
Open access
PDF file
ZWZhao Wei
Zhao Wei
COChin Chun Ooi
Chin Chun Ooi
JWJian Cheng Wong
Jian Cheng Wong
AGAbhishek Gupta
Abhishek Gupta
PCPao-Hsiung Chiu
Pao-Hsiung Chiu
YOYew-Soon Ong
Yew-Soon Ong
Neural physics solvers are increasingly used in scientific discovery, given their potential for rapid in silico insights into physical, materials, or biological systems and their long-time evolution. However, poor generalization beyond their training support limits exploration of novel designs and long-time horizon predictions. We introduce NOVA, a route to generalizable neural physics solvers that can provide rapid, accurate solutions to scenarios even under distributional shifts in partial differential equation parameters, geometries and initial conditions. By learning physics-aligned representations from an initial sparse set of scenarios, NOVA consistently achieves 1-2 orders of magnitude lower out-of-distribution errors than data-driven baselines across complex, nonlinear problems including heat transfer, diffusion-reaction and fluid flow. We further showcase NOVA's dual impact on stabilizing long-time dynamical rollouts and improving generative design through application to the simulation of nonlinear Turing systems and fluidic chip optimization. Unlike neural physics solvers that are constrained to retrieval and/or emulation within an a priori space, NOVA enables reliable extrapolation beyond known regimes, a key capability given the need for exploration of novel hypothesis spaces in scientific discovery