Jin Yu

Dr. Jin Yu


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
28 July 2025 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
JYJin Yu
Jin Yu
YZYa Zhang
Ya Zhang
CSChangyin Sun
Changyin Sun
This paper addresses the dynamic task assignment problem for multiple uncrewed aerial vehicles (UAVs) operating under weak communication. Existing learning-based methods face two primary challenges: limited scene generalization and excessive reliance on communication resources. To address these issues, this paper proposes an event-triggered reinforcement learning algorithm based on graph neural networks. First, heterogeneous UAVs and tasks are embedded into a graph to construct a relationship model, which clearly represents the complex constraints between UAVs and tasks. This graph structure overcomes the limitations of existing methods in capturing constraint relationships. Second, the incorporation of heterogeneous graph neural networks and adaptive attention mechanisms enables effective learning of changes in adjacent node information, allowing the model to capture complex constraint relationships and environmental dynamics. This approach also addresses the lack of sensitivity to environmental changes observed in existing methods. Lastly, a dynamic synchronization mechanism is employed to update task assignment statuses in real time, preventing task conflicts and ensuring efficient allocation. Experimental results demonstrate that this method strikes a better balance between task assignment quality and efficiency. It performs well in untrained scenarios and significantly reduces communication resource consumption. These results highlight its promising potential for application in weak communication environments. Note to Practitioners—This paper addresses the dynamic task assignment problem in multi-UAV systems under weak communication conditions. It proposes an event-triggered graph reinforcement learning algorithm combining graph neural networks and an adaptive attention mechanism. This framework models UAVs and tasks as nodes in a heterogeneous graph, capturing their relationships and constraints. The algorithm updates task assignments in real time using a dynamic synchronization mechanism, minimizing conflicts and ensuring optimal task completion despite intermittent communication. Its key advantage is balancing task quality and efficiency. Compared to traditional methods, it performs better in various scenarios, especially in untrained environments, and adapts to dynamic task demands. This approach is particularly useful in defense, logistics, agriculture, and surveillance. However, it has limitations in extreme cases of frequent UAV sabotage, and future work could optimize it for fully distributed environments to improve adaptability and reliability.

16 June 2020 in IEEE Access
Verified
Journal Article
Open access
JYJin Yu
Jin Yu
XYXiaoming You
Xiaoming You
SLSheng Liu
Sheng Liu
Ant colony system has a good performance in solving Traveling Salesman Problem (TSP), but it tends to fall into local optimum and is deficient in convergence speed. To address this problem, a dynamic density clustering ant colony algorithm with a filtering recommendation backtracking mechanism is proposed (DBACS). Firstly, a dynamic density clustering strategy is proposed to accelerate the convergence speed of the algorithm and improve the quality of the solution. Under this strategy, the search radius is expanded dynamically to merge adjacent classes, so as to form the differential pheromone distribution. The splicing paths between each class are adjusted through the ant colony algorithm to achieve better performance. Secondly, a recommendation backtracking mechanism based on collaborative filtering is proposed to increase the diversity of the population, thus helping the algorithm jump out of the local optimum. With the help of the collaborative filtering algorithm, some dense data points are recommended for pheromone dynamic backtracking, which can not only help algorithm jump out of the local optimum, but also help the algorithm accelerate convergence. Simulation results show that the improved algorithm can obtain a better solution and higher stability. Especially in solving large-scale TSP, the accuracy of the solution is significantly improved.

12 January 2021 in Electronics
Verified
Journal Article
Open access
PDF file
JLJianying Liang
Jianying Liang
DWDonghua Wu
Donghua Wu
JYJin Yu
Jin Yu
Capacitive power transfer (CPT) is a promising method to solve the problems caused by the traditional Pantograph-catenary contact power supply for railway applications. In contrast, the CPT system suffers a broken risk because of the small coupling capacitor. This paper has analyzed the CPT coupler’s voltage distributions for dynamic CPT systems when high power is required in real railway applications. The triangle relationship among the coupler voltages is derived. The circuit of the CPT system to accolated the coupler voltage is analyzed. Then, the compensation parameters are given. With the adopted LCLC-CL topology, the design process is presented by considering the coupler voltages. An experimental setup is conducted to validate the proposed design method. The experimental results show that the system can achieve 3 kW output power with 92.46% DC-DC efficiency and the voltage distribution aggress well with the designed values.

5 September 2024 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Closed access
JYJin Yu
Jin Yu
YZYa Zhang
Ya Zhang
CSChangyin Sun
Changyin Sun
Despite the significant advancements in single-agent evolutionary reinforcement learning, research exploring evolutionary reinforcement learning within multi-agent systems is still in its nascent stage. The integration of evolutionary algorithms (EA) and reinforcement learning (RL) has partially mitigated RL's reliance on the environment and provided it with an ample supply of data. Nonetheless, existing studies primarily focus on the indirect collaboration between RL and EA, which lacks sufficient exploration on the effective balance of individual and team rewards. To address this problem, this study introduces game theory to establish a dynamic cooperation framework between EA and RL, and proposes a multi-agent evolutionary reinforcement learning based on cooperative games. This framework facilitates more efficient direct collaboration between RL and EA, enhancing individual rewards while ensuring the attainment of team objectives. Initially, a cooperative policy is formed through a joint network to simplify the parameters of each agent to speed up the overall training process. Subsequently, RL and EA engage in cooperative games to determine whether RL jointly optimizes the same policy based on Pareto optimal results. Lastly, through double objectives optimization, a balance between the two types of rewards is achieved, with EA focusing on team rewards and RL focusing on individual rewards. Experimental results demonstrate that the proposed algorithm outperforms its single-algorithm counterparts in terms of competitiveness.

31 March 2018
Verified
Book Chapter
Closed access
PDF file
JLJianying Liang
Jianying Liang
SLShaoqing Liu
Shaoqing Liu
CZChongcheng Zhong
Chongcheng Zhong
JYJin Yu
Jin Yu