YZYiyang Zhao

Yiyang Zhao

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Yiyang Zhao has a total of 20 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Path-Following and Formation Control for UAV Swarms Using Hybrid Gradient Vector Field

    by Yiyang Zhao, Xiaohua Wang, Yangyang Zhao, Chao Fan, Yuting Xie

  • Open Access

    Cooperative UAV search strategy based on DMPC-AACO algorithm in restricted communication scenarios

    by Shiyuan Chai, Zhen Yang, Jichuan Huang, Xiaoyang Li, Yiyang Zhao, Deyun Zhou


  • Open Access

    A Novel Elitism Co-Evolutionary Algorithm for Antagonistic Weapon-Target Assignment

    by Jichuan Huang, Xiaoyang Li, Zhen Yang, Weiren Kong, Yiyang Zhao, Deyun Zhou

    The Antagonistic Weapon-Target Assignment (AGWTA) problem is a crucial decision issue in Command & Control (C2). Since this is a minimax problem, co-evolutionary algorithms can be used to solve it effectively. However, the co-evolutionary algorithm is originally designed for continuous minimax problems which loses its efficiency to discrete contexts. In this paper, a novel elitism co-evolutionary algorithm is proposed to solve the AGWTA. Firstly, an improved AGWTA model for air combat based on the attack and evasion strategies is proposed. Secondly, an elite cooperative genetic algorithm based on the framework of the co-evolutionary algorithm is put forward. In this proposed algorithm, a problem-specific coding method and evolution operator are designed. Meanwhile, an elite individual update mechanism is presented. Finally, based on the analysis of the relationship between the feasible solutions under the air combat environment, an evaluation index is proposed. Experiments show that the proposed algorithm has higher accuracy than traditional co-evolutionary algorithms for solving AGWTA problems.


  • Open Access

    Cooperative Multiple Task Assignment Problem With Target Precedence Constraints Using a Waitable Path Coordination and Modified Genetic Algorithm

    by Yiyang Zhao, Deyun Zhou, Haiyin Piao, Zhen Yang, Rui Hou, Weiren Kong, Qian Pan

    Task assignment is a critical technology for heterogeneous unmanned aerial vehicle (UAV) applications. Target precedence has typically been ignored in previous studies, such that it is possible to obtain a task assignment solution with an unreasonable target execution order. For this reason, a cooperative multiple task assignment problem with target precedence constraints (CMTAPTPC) model is proposed in this paper, which considers not only kinematic, resource, and task precedence constraints of the UAV, but also target precedence to achieve more realistic scenarios. In addition, a graph method is improved to detect and eliminate deadlocks in solutions that include target precedence constraints. We also introduced a waitable path coordination (WPC) algorithm to generate conflict-free flight paths. Unlike the traditional path elongation method, this method can reduce the number of path elongation operations and save the energy of UAVs. Based on the characteristics of the CMTAPTPC model, this study proposes a modified genetic algorithm that integrates the graph-based method and WPC algorithm to solve the task assignment problem. In the simulation, three problem-scale scenarios were designed, and the superior performance of the modified genetic algorithm was demonstrated by comparing it with a traditional genetic algorithm. Finally, a time series diagram shows the task assignment solution that meets all time constraints and illustrates the rationality of the WPC algorithm.


  • Open Access

    Sample-Guided Adaptive Class Prototype for Visual Domain Adaptation

    by Chao Han, Xiaoyang Li, Zhen Yang, Deyun Zhou, Yiyang Zhao, Weiren Kong

    Domain adaptation aims to handle the distribution mismatch of training and testing data, which achieves dramatic progress in multi-sensor systems. Previous methods align the cross-domain distributions by some statistics, such as the means and variances. Despite their appeal, such methods often fail to model the discriminative structures existing within testing samples. In this paper, we present a sample-guided adaptive class prototype method, which consists of the no distribution matching strategy. Specifically, two adaptive measures are proposed. Firstly, the modified nearest class prototype is raised, which allows more diversity within same class, while keeping most of the class wise discrimination information. Secondly, we put forward an easy-to-hard testing scheme by taking into account the different difficulties in recognizing target samples. Easy samples are classified and selected to assist the prediction of hard samples. Extensive experiments verify the effectiveness of the proposed method.


  • Open Access

    Efficient Decision Approaches for Asset-Based Dynamic Weapon Target Assignment by a Receding Horizon and Marginal Return Heuristic

    by Kai Zhang, Deyun Zhou, Zhen Yang, Yiyang Zhao, Weiren Kong

    The weapon-target assignment problem is a crucial decision support in a Command and Control system. As a typical operational scenario, the major asset-based dynamic weapon target assignment (A-DWTA) models and solving algorithms are challenging to reflect the actual requirement of decision maker. Deriving from the “shoot–look–shoot” principle, an “observe–orient–decide–act” loop model for A-DWTA (OODA/A-DWTA) is established. Focus on the decide phase of the OODA/A-DWTA loop, a novel A-DWTA model, which is based on the receding horizon decomposition strategy (A-DWTA/RH), is established. To solve the A-DWTA/RH efficiently, a heuristic algorithm based on statistical marginal return (HA-SMR) is designed, which proposes a reverse hierarchical idea of “asset value-target selected-weapon decision.” Experimental results show that HA-SMR solving A-DWTA/RH has advantages of real-time and robustness. The obtained decision plan can fulfill the operational mission in the fewer stages and the “radical-conservative” degree can be adjusted adaptively by parameters.


  • Open Access

    An Autonomous Attack Guidance Method with High Aiming Precision for UCAV Based on Adaptive Fuzzy Control under Model Predictive Control Framework

    by Zhen Yang, Zhixiao Sun, Haiyin Piao, Yiyang Zhao, Deyun Zhou, Weiren Kong, Kai Zhang

    With its superior performance, the unmanned combat air vehicle (UCAV) will gradually become an important combat force in the future beyond-visual-range (BVR) air combat. For the problem of UCAV using the BVR air-to-air missile (AAM) to intercept the highly maneuvering aerial target, an autonomous attack guidance method with high aiming precision is proposed. In BVR air combat, the best launching conditions can be formed through the attack guidance and aiming of fighters, which can give full play to the combat effectiveness of BVR AAMs to the greatest extent. The mode of manned fighters aiming by manual control of pilots is inefficient and obviously not suitable for the autonomous UCAV. Existing attack guidance control methods have some defects such as low precision, poor timeliness, and too much reliance on manual experience when intercepting highly maneuvering targets. To address this problem, aiming error angle is calculated based on the motion model of UCAV and the aiming model of BVR attack fire control in this study, then target motion prediction information is introduced based on the designed model predictive control (MPC) framework, and the adaptive fuzzy guidance controller is designed to generate control variable. To reduce the predicted aiming error angle, the algorithm iteratively optimizes and updates the actual guidance control variable online. The simulation results show that the proposed method is very effective for solving the autonomous attack guidance problem, which has the characteristics of adaptivity, high timeliness, and high aiming precision.


  • Open Access

    UAV Autonomous Aerial Combat Maneuver Strategy Generation with Observation Error Based on State-Adversarial Deep Deterministic Policy Gradient and Inverse Reinforcement Learning

    by Weiren Kong, Deyun Zhou, Zhen Yang, Yiyang Zhao, Kai Zhang

    With the development of unmanned aerial vehicle (UAV) and artificial intelligence (AI) technology, Intelligent UAV will be widely used in future autonomous aerial combat. Previous researches on autonomous aerial combat within visual range (WVR) have limitations due to simplifying assumptions, limited robustness, and ignoring sensor errors. In this paper, in order to consider the error of the aircraft sensors, we model the aerial combat WVR as a state-adversarial Markov decision process (SA-MDP), which introduce the small adversarial perturbations on state observations and these perturbations do not alter the environment directly, but can mislead the agent into making suboptimal decisions. Meanwhile, we propose a novel autonomous aerial combat maneuver strategy generation algorithm with high-performance and high-robustness based on state-adversarial deep deterministic policy gradient algorithm (SA-DDPG), which add a robustness regularizers related to an upper bound on performance loss at the actor-network. At the same time, a reward shaping method based on maximum entropy (MaxEnt) inverse reinforcement learning algorithm (IRL) is proposed to improve the aerial combat strategy generation algorithm’s efficiency. Finally, the efficiency of the aerial combat strategy generation algorithm and the performance and robustness of the resulting aerial combat strategy is verified by simulation experiments. Our main contributions are three-fold. First, to introduce the observation errors of UAV, we are modeling air combat as SA-MDP. Second, to make the strategy network of air combat maneuver more robust in the presence of observation errors, we introduce regularizers into the policy gradient. Third, to solve the problem that air combat’s reward function is too sparse, we use MaxEnt IRL to design a shaping reward to accelerate the convergence of SA-DDPG.