Haitao Zhong

Dr. Haitao Zhong

Air Force Engineering University, Xi'an, China
orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
11 November 2021 in Symmetry
Verified
Journal Article
Open access
PDF file
Aoyu ZhengAoyu Zheng
Aoyu Zheng
BLBingjie Li
Bingjie Li
MZMingfa Zheng
Mingfa Zheng
HZHaitao Zhong
Haitao Zhong
UAV trajectory planning is one of the research focuses in artificial intelligence and UAV technology. The asymmetric information, however, will lead to the uncertainty of the UAV trajectory planning; the probability theory as the most commonly used method to solve the trajectory planning problem in uncertain environment will lead to unrealistic conclusions under the condition of lacking samples, while the uncertainty theory based on uncertain measures is an efficient method to solve such problems. Firstly, the uncertainties in trajectory planning are sufficiently considered in this paper; the fuel consumption, concealment and threat degree with uncertain variables are taken as the objective functions; the constraints are analyzed according to the maneuverability; and the uncertain multi-objective trajectory planning (UMOTP) model is established. After that, this paper takes both the long-term benefits and its stability into account, and then, the expected-value and standard-deviation efficient trajectory model is established. What is more, this paper solves the Pareto front of the trajectory planning, satisfying various preferences, which avoids the defects of the trajectory obtained by traditional model only applicable to a certain specific situation. In order to obtain a better solution set, this paper proposes an improved backbones particle swarm optimization algorithm based on PSO and NSGA-II, which overcomes the shortcomings of the traditional algorithm such as premature convergence and poor robustness, and the efficiency of the algorithm is tested. Finally, the algorithm is applied to the UMOTP problem; then, the optimal trajectory set is obtained, and the effectiveness and reliability of the model is verified.

17 June 2025 in Aerospace
Verified
Journal Article
Open access
PDF file
HZHaitao Zhong
Haitao Zhong
RYRennong Yang
Rennong Yang
AZAoyu Zheng
Aoyu Zheng
MZMingfa Zheng
Mingfa Zheng
Yu MeiYu Mei
Yu Mei
Based on uncertainty theory, this paper studies the problem of unmanned aerial vehicle (UAV) combat mission assignment under an uncertain environment. First, considering both the target value, which is the combat mission benefit gained from attacking the target, and the unit fuel consumption of UAV as uncertain variables, an uncertain UAV combat mission assignment model is established. And according to decisions under the realization of uncertain variables, the first stage generates an initial mission allocation scheme corresponding to the realization of target value, while the second stage dynamically adjusts the scheme according to the realization of unit fuel consumption; a two-stage uncertain UAV combat mission assignment (TUCMA) model is obtained. Then, because of the difficulty of obtaining analytical solutions due to uncertainty and the complexity of solving the second stage, the TUCMA model is transformed into an expected value-effective deterministic model of the two-stage uncertain UAV combat mission assignment (ETUCMA). A modified particle swarm optimization (PSO) algorithm is designed to solve the ETUCMA model to get the expected value-effective solution of the TUCMA model. Finally, experimental simulations of multiple UAV combat task allocation scenarios demonstrate that the proposed modified PSO algorithm yields an optimal decision with maximum combat mission benefits under a maximum iteration limit, which are significantly greater benefits than those for the mission assignment achieved by the original PSO algorithm. The proposed modified PSO exhibits superior performance compared with the ant colony optimization algorithm, enabling the acquisition of an optimal allocation scheme with greater benefits. This verifies the effectiveness and superiority of the proposed model and algorithm in maximizing combat mission benefits.

2 March 2025 in Axioms
Verified
Journal Article
Open access
PDF file
ZGZhichao Gao
Zhichao Gao
MZMingfa Zheng
Mingfa Zheng
HZHaitao Zhong
Haitao Zhong
Yu MeiYu Mei
Yu Mei
The cooperative task assignment problem with time windows for heterogeneous multiple unmanned aerial vehicles is an attractive complex combinatorial optimization problem. In reality, unmanned aerial vehicles’ fuel consumption exhibits uncertainty due to environmental factors or operational maneuvers, and accurately determining the probability distributions for these uncertainties remains challenging. This paper investigates the heterogeneous multiple unmanned aerial vehicle cooperative task assignment model that incorporates time window constraints under uncertain environments. To model the time window constraints, we employ the big-M method. To address the uncertainty in fuel consumption, we apply an adjustable robust optimization approach combined with duality theory, which allows us to derive the robust equivalent form and transform the model into a deterministic mixed-integer linear programming problem. We conduct a series of numerical experiments to compare the optimization results across different objectives, including maximizing task profit, minimizing total distance, minimizing makespan, and incorporating three different time window constraints. The numerical results demonstrate that the robust optimization-based heterogeneous multiple unmanned aerial vehicle cooperative task assignment model effectively mitigates the impact of parameter uncertainty, while achieving a balanced trade-off between robustness and the optimality of task assignment objectives.

20 September 2024 in Axioms
Verified
Journal Article
Open access
PDF file
GLGuangjian Li
Guangjian Li
MZMingfa Zheng
Mingfa Zheng
GHGuangjun He
Guangjun He
Yu MeiYu Mei
Yu Mei
GSGaoji Sun
Gaoji Sun
HZHaitao Zhong
Haitao Zhong
Multi-objective optimization problems (MOPs) constitute a vital component in the field of mathematical optimization and operations research. The multi-objective evolutionary algorithm based on decomposition (MOEA/D) decomposes a MOP into a set of single-objective subproblems and approximates the true Pareto front (PF) by optimizing these subproblems in a collaborative manner. However, most existing MOEA/Ds maintain population diversity by limiting the replacement region or scale, which come at the cost of decreasing convergence. To better balance convergence and diversity, we introduce auction theory into algorithm design and propose an auction-based matching (ABM) mechanism to coordinate the replacement procedure in MOEA/D. In the ABM mechanism, each subproblem can be associated with its preferred individual in a competitive manner by simulating the auction process in economic activities. The integration of ABM into MOEA/D forms the proposed MOEA/D-ABM. Furthermore, to make the appropriate distribution of weight vectors, a modified adjustment strategy is utilized to adaptively adjust the weight vectors during the evolution process, where the trigger timing is determined by the convergence activity of the population. Finally, MOEA/D-ABM is compared with six state-of-the-art multi-objective evolutionary algorithms (MOEAs) on some benchmark problems with two to ten objectives. The experimental results show the competitiveness of MOEA/D-ABM in the performance of diversity and convergence. They also demonstrate that the use of the ABM mechanism can greatly improve the convergence rate of the algorithm.

8 September 2025 in Drones
Verified
Journal Article
Open access
PDF file
ZGZhichao Gao
Zhichao Gao
MZMingfa Zheng
Mingfa Zheng
Yu MeiYu Mei
Yu Mei
AZAoyu Zheng
Aoyu Zheng
HZHaitao Zhong
Haitao Zhong
This paper addresses the cooperative task assignment problem for heterogeneous unmanned aerial vehicles with time windows considering uncertain fuel consumption. In the scenario where probabilistic fuel consumption exists and its distribution needs to be estimated from historical data samples, we first formulate the problem as a chance-constrained combinatorial optimization problem and utilize the sample average approximation method to solve it. Further, to address the issue of ambiguous distribution, we introduce distributionally robust chance constraints, which consider a set of probability distributions that are contained within a 1-Wasserstein ball centered around the empirical distribution of field data. We approximate the distributionally robust chance-constrained cooperative task assignment problem by applying a CVaR-based tractable approximation such that the problem can be transformed into a deterministic mixed-integer linear programming problem, which can be efficiently solved by state-of-the-art optimization solvers. Finally, we conduct a series of numerical experiments, which not only verify the computational efficiency of the distributionally robust chance-constrainted models but also reduce the degree of constraint violation in out-of-sample tests compared with a sample average approximation method.

24 August 2026 in Mathematics
Verified
Journal Article
Open access
PDF file
AZAoyu Zheng
Aoyu Zheng
XLXiaolong Liang
Xiaolong Liang
HZHaitao Zhong
Haitao Zhong
ZZZhi Zhang
Zhi Zhang
ZLZuolin Lyu
Zuolin Lyu
MZMingfa Zheng
Mingfa Zheng
Emergency response missions employing heterogeneous multi-UAVs are challenged by both the tight coupling between task assignment and motion control and the inherent difficulty in obtaining full probability distributions of stochastic disturbances. In practice, only partial moment information—typically the mean, covariance, and support set—can be estimated. To address this, the paper proposes a distributionally robust integrated “decision–control” framework. A bi-level optimization model is established: the upper level minimizes the maximum mission completion time across all platforms, while the lower level solves minimum-time optimal control problems under kinematic constraints, with the two levels coupled through task execution times. Given only the mean, covariance, and support set of disturbances, an ambiguity set is constructed, and by leveraging duality theory and semidefinite programming, the distributionally robust chance constraints on site reachability are equivalently transformed into deterministic safety margins. A two-stage trajectory planning method is further designed to decouple accumulated time estimation from robust constraint enforcement, ensuring computational tractability. Simulation results across multiple disturbance configurations show that, whereas deterministic planning yields an overall mission success rate of only about 0.7%, the proposed framework consistently achieves success rates above 99.9% and effectively balances workload among multiple UAVs. These results validate the practical benefit of the framework in providing reliable emergency response plans under limited distributional information.