Aoyu Zheng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Aoyu Zheng has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Haitao Zhong
Air Traffic Control and Navigation School, Air Force Engineering University, Xi’an 710038, China
4 shared publications - Mingfa Zheng
Fundamentals Department, Air Force Engineering University, Xi’an 710038, China
4 shared publications - Jiaqiang Zhang
Air Traffic Control and Navigation School, Air Force Engineering University, Xi’an 710051, China
2 shared publications - Ning Wang
Air Traffic Control and Navigation School, Air Force Engineering University, Xi’an 710051, China
2 shared publications - Aiwu Yang
Air Traffic Control and Navigation School, Air Force Engineering University, Xi’an 710051, China
1 shared publication - Bingjie Li
Fundamentals Department, Air Force Engineering University, Xi’an 710051, China
1 shared publication
Latest Publications
- 7 February 2024
- Published by World Scientific Pub Co Pte Ltd in Guidance, Navigation and Control
- Vol. 04 (01)
Cooperative Decision-Making for Multiple UAVs Autonomous Confrontation
This paper presents a rule-based framework for addressing decision-making problems within the context of the “UI-STRIVE” Competition. First, two distinct autonomous confrontation scenarios are described: autonomous air combat and cooperative interception. Second, a State-Event-Condition-Action (SECA) decision-making framework is developed, which integrates the finite state machine and event-condition-action frameworks. This framework provides three products to describe rules, i.e. the SECA model, the SECA state chart, and the SECA rule description. Third, the situation assessment and target assignment during autonomous air combat are investigated, and the mathematical models are established. Finally, the decision-making model’s rationality and feasibility are verified through data simulation and analysis.
- 7 February 2024
- Published by World Scientific Pub Co Pte Ltd in Guidance, Navigation and Control
- Vol. 04 (01)
Cooperative Decision-Making for Multiple UAVs Autonomous Confrontation
This paper presents a rule-based framework for addressing decision-making problems within the context of the “UI-STRIVE” Competition. First, two distinct autonomous confrontation scenarios are described: autonomous air combat and cooperative interception. Second, a State-Event-Condition-Action (SECA) decision-making framework is developed, which integrates the finite state machine and event-condition-action frameworks. This framework provides three products to describe rules, i.e. the SECA model, the SECA state chart, and the SECA rule description. Third, the situation assessment and target assignment during autonomous air combat are investigated, and the mathematical models are established. Finally, the decision-making model’s rationality and feasibility are verified through data simulation and analysis.
- Open Access
Uncertain Sensor–Weapon–Target Allocation Problem Based on Uncertainty Theory
The sensor–weapon–target allocation (S-WTA) is a typical collaborative task allocation problem involved in network-centric warfare (NCW). The existing related studies have a limitation to the nature of cooperation and uncertainty in an air defense battle scenario, and most existing models have the assumption that they are determinate, i.e., the parameters in them are known certainly. For the actual battlefield environment, the asymmetric information in it could lead to the failure of the above assumption, and there are many uncertainties whose frequency can not be evaluated objectively. Based on uncertainty theory, this paper studied the S-WTA problem in an indeterminate battlefield environment. First, we analyze the uncertain factors existing in the actual battlefield environment and their influence on the S-WTA problem, and by considering the threat value of the target, the deviation parameters of the sensor tracking performance and weapon interception performance as uncertain variables, we then establish an uncertain S-WTA (USWTA) model, where the destruction value to targets is regarded as an objective function and four categories of typical constraints are set. Further, an equivalent transformation is presented to convert the unsolvable model into a determinate one by the expected value principle. To solve the proposed model efficiently, a permutation-based representation for the allocation scheme of the USWTA problem is introduced firstly, which can construct a feasible solution efficiently, and on this basis, a constructive heuristic algorithm based on maximum marginal return rule (MMRCH) is designed to construct a feasible solution with high quality. Additionally, a local search (LS) operation is proposed to explore for the better solution locally and further improve the quality of solution obtained by MMRCH. Finally, a set of instances are set to be solved by the designed algorithm, and the simulation experiment demonstrates the superiority of the designed algorithm and the feasibility of the proposed model.
Open AccessUncertain Sensor–Weapon–Target Allocation Problem Based on Uncertainty Theory
The sensor–weapon–target allocation (S-WTA) is a typical collaborative task allocation problem involved in network-centric warfare (NCW). The existing related studies have a limitation to the nature of cooperation and uncertainty in an air defense battle scenario, and most existing models have the assumption that they are determinate, i.e., the parameters in them are known certainly. For the actual battlefield environment, the asymmetric information in it could lead to the failure of the above assumption, and there are many uncertainties whose frequency can not be evaluated objectively. Based on uncertainty theory, this paper studied the S-WTA problem in an indeterminate battlefield environment. First, we analyze the uncertain factors existing in the actual battlefield environment and their influence on the S-WTA problem, and by considering the threat value of the target, the deviation parameters of the sensor tracking performance and weapon interception performance as uncertain variables, we then establish an uncertain S-WTA (USWTA) model, where the destruction value to targets is regarded as an objective function and four categories of typical constraints are set. Further, an equivalent transformation is presented to convert the unsolvable model into a determinate one by the expected value principle. To solve the proposed model efficiently, a permutation-based representation for the allocation scheme of the USWTA problem is introduced firstly, which can construct a feasible solution efficiently, and on this basis, a constructive heuristic algorithm based on maximum marginal return rule (MMRCH) is designed to construct a feasible solution with high quality. Additionally, a local search (LS) operation is proposed to explore for the better solution locally and further improve the quality of solution obtained by MMRCH. Finally, a set of instances are set to be solved by the designed algorithm, and the simulation experiment demonstrates the superiority of the designed algorithm and the feasibility of the proposed model.
- 24 May 2022
- Published by Springer Nature in Evolutionary Intelligence
- Vol. 17 (1) , 291-301
Global optimality conditions for nonlinear optimization problems
- 24 May 2022
- Published by Springer Nature in Evolutionary Intelligence
- Vol. 17 (1) , 291-301
Global optimality conditions for nonlinear optimization problems
- 9 March 2022
- Published by Springer Nature in Evolutionary Intelligence
- Vol. 17 (1) , 229-237
Research on uncertain bi-objective UAV mission allocation problem
- 9 March 2022
- Published by Springer Nature in Evolutionary Intelligence
- Vol. 17 (1) , 229-237
Research on uncertain bi-objective UAV mission allocation problem
- Open Access
Research on Comparision between Deterministic Method and Uncertain Method for Solving Uncertain Multiobjective Programming
Since there are often few or no samples and asymmetry information in the problems, uncertainty theory is introduced to study uncertain multi-objective programming (UMP), which cannot be solved by probability theory. Generally speaking, there are two types of methods for solving the UMP problem: in deterministic method, using the numerical characteristics of an uncertain variable, the UMP problem is transformed into a deterministic multiobjective programming, and then solved by the weighting method and ideal point method; in the uncertain method, the UMP problem is transformed into an uncertain single-objective programming, and then is solved by the evaluation criteria of the uncertain variables. The theoretical analysis and the data results for numerical examples solved by the AC algorithm designed in the paper show that the two types of methods are obviously different. Further, using this comparison, the essential difference between the two methods is whether the uncertainty relation between objective functions sholud be considered. Therefore, when the uncertainty relation is closely related, the uncertain method is more appropriate; otherwise, the deterministic method should be chosen.
Open AccessResearch on Comparision between Deterministic Method and Uncertain Method for Solving Uncertain Multiobjective Programming
Since there are often few or no samples and asymmetry information in the problems, uncertainty theory is introduced to study uncertain multi-objective programming (UMP), which cannot be solved by probability theory. Generally speaking, there are two types of methods for solving the UMP problem: in deterministic method, using the numerical characteristics of an uncertain variable, the UMP problem is transformed into a deterministic multiobjective programming, and then solved by the weighting method and ideal point method; in the uncertain method, the UMP problem is transformed into an uncertain single-objective programming, and then is solved by the evaluation criteria of the uncertain variables. The theoretical analysis and the data results for numerical examples solved by the AC algorithm designed in the paper show that the two types of methods are obviously different. Further, using this comparison, the essential difference between the two methods is whether the uncertainty relation between objective functions sholud be considered. Therefore, when the uncertainty relation is closely related, the uncertain method is more appropriate; otherwise, the deterministic method should be chosen.
- Open Access
Multi-Objective UAV Trajectory Planning in Uncertain Environment
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.
Open AccessMulti-Objective UAV Trajectory Planning in Uncertain Environment
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.