Yijie Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Yijie Zhang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Jizhou Chen
School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi 214200, China
3 shared publications - Mandan Liu
Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education, East China University of Science and Technology, Shanghai 200237, China
3 shared publications - Xiangbo Yang
School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi 214122, P. R. China
1 shared publication - Yuhang Cai
School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi 214122, China
1 shared publication - Zhan Guo
No. 32 Research Institute of China Electronics Technology Group Corporation, 63 Chengliu Road, Shanghai 201808, China
1 shared publication
Latest Publications
- Open Access
- 14 May 2026
- Published by MDPI AG in Algorithms
- Vol. 19 (5) , 393
Three-Dimensional UAV Omnidirectional Path Planning Algorithm Based on Urban Obstacle Environment
To address the challenges of high computational complexity, inferior path performance, and the balance between path quality and efficiency in traditional 3D omnidirectional path planning algorithms for UAVs, this study proposes an innovative precision algorithm for solving 3D omnidirectional shortest paths. The algorithm innovatively introduces the concepts of circling path and overpass path, reducing three-dimensional omnidirectional path computation to two-dimensional processing. It designs a three-view obstacle detection algorithm to achieve efficient obstacle avoidance judgment, formulates separate path-solving strategies for discrete and continuous obstacles, respectively, and obtains optimal solutions through recursive adjustments and path optimization. Experimental results demonstrate that compared to A* and Theta* algorithms, our approach achieves shorter path lengths with superior stability; the proposed algorithm achieves a 21.86% reduction compared to RRT*, 10.48% compared to A*, and 0.89% compared to Lazy_Theta*. In addition, the proposed algorithm exhibits enhanced adaptability in high-obstacle environments (particularly irregular obstacles). These findings provide an effective solution for complex spatial path planning in UAV applications.
- 14 May 2026
- Published by MDPI AG in Algorithms
- Vol. 19 (5) , 393
Open AccessThree-Dimensional UAV Omnidirectional Path Planning Algorithm Based on Urban Obstacle Environment
To address the challenges of high computational complexity, inferior path performance, and the balance between path quality and efficiency in traditional 3D omnidirectional path planning algorithms for UAVs, this study proposes an innovative precision algorithm for solving 3D omnidirectional shortest paths. The algorithm innovatively introduces the concepts of circling path and overpass path, reducing three-dimensional omnidirectional path computation to two-dimensional processing. It designs a three-view obstacle detection algorithm to achieve efficient obstacle avoidance judgment, formulates separate path-solving strategies for discrete and continuous obstacles, respectively, and obtains optimal solutions through recursive adjustments and path optimization. Experimental results demonstrate that compared to A* and Theta* algorithms, our approach achieves shorter path lengths with superior stability; the proposed algorithm achieves a 21.86% reduction compared to RRT*, 10.48% compared to A*, and 0.89% compared to Lazy_Theta*. In addition, the proposed algorithm exhibits enhanced adaptability in high-obstacle environments (particularly irregular obstacles). These findings provide an effective solution for complex spatial path planning in UAV applications.
- Open Access
- 29 June 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (7) , 400
The True Shortest Path of Obstacle Grid Graph Is Solved by SGP Vertex Extraction and Filtering Algorithm
In the obstacle grid map, due to the limitations in search direction imposed by classical path algorithms and meta-heuristic algorithms, the shortest paths are not the true shortest paths (TSPs) but rather the shortest grid paths (SGPs). This paper introduces an SGP vertex extraction and filtering algorithm (SGPVEFA) that identifies key nodes within SGPs. After screening, these nodes yield TSPs under the same conditions. Through various experiments, the shortest path length searched by the SGPVEFA proposed in this paper can be used to search for the real shortest path, and it also has advantages in comparison with recent new algorithms. With the increase in map scale and obstacle rate, the advantages of this path algorithm are more significant.
- 29 June 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (7) , 400
Open AccessThe True Shortest Path of Obstacle Grid Graph Is Solved by SGP Vertex Extraction and Filtering Algorithm
In the obstacle grid map, due to the limitations in search direction imposed by classical path algorithms and meta-heuristic algorithms, the shortest paths are not the true shortest paths (TSPs) but rather the shortest grid paths (SGPs). This paper introduces an SGP vertex extraction and filtering algorithm (SGPVEFA) that identifies key nodes within SGPs. After screening, these nodes yield TSPs under the same conditions. Through various experiments, the shortest path length searched by the SGPVEFA proposed in this paper can be used to search for the real shortest path, and it also has advantages in comparison with recent new algorithms. With the increase in map scale and obstacle rate, the advantages of this path algorithm are more significant.
- Open Access
- 30 May 2025
- Published by MDPI AG in Preprints.org
Solving the TSP of the Obstacle Grid Map with SGP Vertex Extraction and Filtering Algorithm
In the obstacle grid map, due to the limited search directions of classical path algorithms and meta-heuristic algorithms, the shortest paths they solve are not true shortest paths (TSP), but rather shortest grid paths (SGP). In this paper, a SGP vertex extraction and filtering algorithm is proposed to extract and filter the key nodes in the SGP path, so as to obtain the TSP path under the same conditions. Experimental validation shows that the shortest path lengths found by the proposed SGP vertex extraction and filtering algorithm are shorter than those obtained by heuristic path algorithms, and it also outperforms recent new algorithms in comparative experiments. As the map scale increases and the obstacle rate rises, the advantages of this path algorithm become more pronounced.
- 30 May 2025
- Published by MDPI AG in Preprints.org
Open AccessSolving the TSP of the Obstacle Grid Map with SGP Vertex Extraction and Filtering Algorithm
In the obstacle grid map, due to the limited search directions of classical path algorithms and meta-heuristic algorithms, the shortest paths they solve are not true shortest paths (TSP), but rather shortest grid paths (SGP). In this paper, a SGP vertex extraction and filtering algorithm is proposed to extract and filter the key nodes in the SGP path, so as to obtain the TSP path under the same conditions. Experimental validation shows that the shortest path lengths found by the proposed SGP vertex extraction and filtering algorithm are shorter than those obtained by heuristic path algorithms, and it also outperforms recent new algorithms in comparative experiments. As the map scale increases and the obstacle rate rises, the advantages of this path algorithm become more pronounced.
- Open Access
- 21 October 2024
- Published by MDPI AG in Biomimetics
- Vol. 9 (10) , 648
Explorative Binary Gray Wolf Optimizer with Quadratic Interpolation for Feature Selection
The high dimensionality of large datasets can severely impact the data mining process. Therefore, feature selection becomes an essential preprocessing stage, aimed at reducing the dimensionality of the dataset by selecting the most informative features while improving classification accuracy. This paper proposes a novel binary Gray Wolf Optimization algorithm to address the feature selection problem in classification tasks. Firstly, the historical optimal position of the search agent helps explore more promising areas. Therefore, by linearly combining the best positions of the search agents, the algorithm’s exploration capability is increased, thus enhancing its global development ability. Secondly, the novel quadratic interpolation technique, which integrates population diversity with local exploitation, helps improve both the diversity of the population and the convergence accuracy. Thirdly, chaotic perturbations (small random fluctuations) applied to the convergence factor during the exploration phase further help avoid premature convergence and promote exploration of the search space. Finally, a novel transfer function processes feature information differently at various stages, enabling the algorithm to search and optimize effectively in the binary space, thereby selecting the optimal feature subset. The proposed method employs a k-nearest neighbor classifier and evaluates performance through 10-fold cross-validation across 32 datasets. Experimental results, compared with other advanced algorithms, demonstrate the effectiveness of the proposed algorithm.
- 21 October 2024
- Published by MDPI AG in Biomimetics
- Vol. 9 (10) , 648
Open AccessExplorative Binary Gray Wolf Optimizer with Quadratic Interpolation for Feature Selection
The high dimensionality of large datasets can severely impact the data mining process. Therefore, feature selection becomes an essential preprocessing stage, aimed at reducing the dimensionality of the dataset by selecting the most informative features while improving classification accuracy. This paper proposes a novel binary Gray Wolf Optimization algorithm to address the feature selection problem in classification tasks. Firstly, the historical optimal position of the search agent helps explore more promising areas. Therefore, by linearly combining the best positions of the search agents, the algorithm’s exploration capability is increased, thus enhancing its global development ability. Secondly, the novel quadratic interpolation technique, which integrates population diversity with local exploitation, helps improve both the diversity of the population and the convergence accuracy. Thirdly, chaotic perturbations (small random fluctuations) applied to the convergence factor during the exploration phase further help avoid premature convergence and promote exploration of the search space. Finally, a novel transfer function processes feature information differently at various stages, enabling the algorithm to search and optimize effectively in the binary space, thereby selecting the optimal feature subset. The proposed method employs a k-nearest neighbor classifier and evaluates performance through 10-fold cross-validation across 32 datasets. Experimental results, compared with other advanced algorithms, demonstrate the effectiveness of the proposed algorithm.
- 20 August 2024
- Published by World Scientific Pub Co Pte Ltd in Journal of Mechanics in Medicine and Biology
- Vol. 24 (08)
A HEART FAILURE PREDICTION ALGORITHM BASED ON IMPROVED REINFORCEMENT LEARNING FRAMEWORK
Reducing the occurrence of diseases has become an important research direction in today’s social medicine. Accurate prediction of heart failure can greatly reduce the complication rate, allowing patients to know the condition in advance and receive treatment. To deal with heart failure, this paper proposes a heart failure prediction algorithm based on a reinforcement learning framework. This paper combines and improves the reinforcement learning algorithm and the swarm intelligence (SI) optimization algorithm, aiming to use the reinforcement learning algorithm to improve the global optimization capability of the SI optimization algorithm. In order to better improve the global search ability of the SI optimization algorithm, the penalty function will be replaced by a combination mode of dynamic and static reward. The improved reinforcement learning algorithm framework is significantly better than the previous algorithm framework and has been used to predict heart failure. The experimental results have proven the effectiveness of the algorithm and its accuracy in prediction of heart failure.
- 20 August 2024
- Published by World Scientific Pub Co Pte Ltd in Journal of Mechanics in Medicine and Biology
- Vol. 24 (08)
A HEART FAILURE PREDICTION ALGORITHM BASED ON IMPROVED REINFORCEMENT LEARNING FRAMEWORK
Reducing the occurrence of diseases has become an important research direction in today’s social medicine. Accurate prediction of heart failure can greatly reduce the complication rate, allowing patients to know the condition in advance and receive treatment. To deal with heart failure, this paper proposes a heart failure prediction algorithm based on a reinforcement learning framework. This paper combines and improves the reinforcement learning algorithm and the swarm intelligence (SI) optimization algorithm, aiming to use the reinforcement learning algorithm to improve the global optimization capability of the SI optimization algorithm. In order to better improve the global search ability of the SI optimization algorithm, the penalty function will be replaced by a combination mode of dynamic and static reward. The improved reinforcement learning algorithm framework is significantly better than the previous algorithm framework and has been used to predict heart failure. The experimental results have proven the effectiveness of the algorithm and its accuracy in prediction of heart failure.
- Open Access
- 22 August 2022
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2022, 1-20
A Node Placement Optimization Algorithm in Heterogeneous WSN Based on Neighbor Nodes
Wireless sensor network (WSN) is an important part of the Internet of Things. With the application and development of the Internet of Things, the heterogeneity of WSN is put forward a higher demand. Node placement is a critical step in the heterogeneous wireless sensor network (HEWSN). It is very important to optimize the node placement to fundamentally prolong the lifetime, improve the performance, and decrease the cost of the HEWSN. In this paper, the node placement optimization problem of HEWSN with different sensing types’ nodes is studied. An improved algorithm named neighbor nodes directed evolved nondominated sorting genetic algorithm (NN-DENSGA) is proposed to solve the multiobjective optimization problem. Homogeneous neighbor nodes are considered to promote directional evolution, and heterogeneous neighbor nodes are considered to repair the coverage holes. In addition, a forced update strategy is designed to increase diversity of population. Experiments have shown that the proposed algorithm not only has improvements in optimization performance but also in convergence speed and stability.
- 22 August 2022
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2022, 1-20
Open AccessA Node Placement Optimization Algorithm in Heterogeneous WSN Based on Neighbor Nodes
Wireless sensor network (WSN) is an important part of the Internet of Things. With the application and development of the Internet of Things, the heterogeneity of WSN is put forward a higher demand. Node placement is a critical step in the heterogeneous wireless sensor network (HEWSN). It is very important to optimize the node placement to fundamentally prolong the lifetime, improve the performance, and decrease the cost of the HEWSN. In this paper, the node placement optimization problem of HEWSN with different sensing types’ nodes is studied. An improved algorithm named neighbor nodes directed evolved nondominated sorting genetic algorithm (NN-DENSGA) is proposed to solve the multiobjective optimization problem. Homogeneous neighbor nodes are considered to promote directional evolution, and heterogeneous neighbor nodes are considered to repair the coverage holes. In addition, a forced update strategy is designed to increase diversity of population. Experiments have shown that the proposed algorithm not only has improvements in optimization performance but also in convergence speed and stability.
- Open Access
- 3 August 2020
- Published by MDPI AG in Algorithms
- Vol. 13 (8) , 189
Node Placement Optimization of Wireless Sensor Networks Using Multi-Objective Adaptive Degressive Ary Number Encoded Genetic Algorithm
The wireless sensor network (WSN) has the advantages of low cost, high monitoring accuracy, good fault tolerance, remote monitoring and convenient maintenance. It has been widely used in various fields. In the WSN, the placement of node sensors has a great impact on its coverage, energy consumption and some other factors. In order to improve the convergence speed of a node placement optimization algorithm, the encoding method is improved in this paper. The degressive ary number encoding is further extended to a multi-objective optimization problem. Furthermore, the adaptive changing rule of ary number is proposed by analyzing the experimental results of the N-ary number encoded algorithm. Then a multi-objective optimization algorithm adopting the adaptive degressive ary number encoding method has been used in optimizing the node placement in WSN. The experiments show that the proposed adaptive degressive ary number encoded algorithm can improve both the optimization effect and search efficiency when solving the node placement problem.
- 3 August 2020
- Published by MDPI AG in Algorithms
- Vol. 13 (8) , 189
Open AccessNode Placement Optimization of Wireless Sensor Networks Using Multi-Objective Adaptive Degressive Ary Number Encoded Genetic Algorithm
The wireless sensor network (WSN) has the advantages of low cost, high monitoring accuracy, good fault tolerance, remote monitoring and convenient maintenance. It has been widely used in various fields. In the WSN, the placement of node sensors has a great impact on its coverage, energy consumption and some other factors. In order to improve the convergence speed of a node placement optimization algorithm, the encoding method is improved in this paper. The degressive ary number encoding is further extended to a multi-objective optimization problem. Furthermore, the adaptive changing rule of ary number is proposed by analyzing the experimental results of the N-ary number encoded algorithm. Then a multi-objective optimization algorithm adopting the adaptive degressive ary number encoding method has been used in optimizing the node placement in WSN. The experiments show that the proposed adaptive degressive ary number encoded algorithm can improve both the optimization effect and search efficiency when solving the node placement problem.
- Open Access
Regional Optimization Dynamic Algorithm for Node Placement in Wireless Sensor Networks
Node placement is one of the basic problems in a Wireless Sensor Network (WSN). During the operation of a WSN, sensor nodes may fail or die suddenly, which may lead to a coverage hole. To solve this problem, the node placement needs to be re-optimized. The dimensions of node placement optimization are high because of the large node number. In view of this defect, a regional optimization dynamic algorithm is put forward. In this paper, the regional optimization problem of node placement is modeled, and a regional optimization dynamic algorithm with a mixed strategy for node placement (MRDA) is proposed. Simulation experiments are carried out for the proposed algorithm and other comparison algorithms. Results of experiments show that the proposed algorithm can greatly reduce the dimensions and narrow the search range, with a significant improvement in the search performance and convergence speed.
Open AccessRegional Optimization Dynamic Algorithm for Node Placement in Wireless Sensor Networks
Node placement is one of the basic problems in a Wireless Sensor Network (WSN). During the operation of a WSN, sensor nodes may fail or die suddenly, which may lead to a coverage hole. To solve this problem, the node placement needs to be re-optimized. The dimensions of node placement optimization are high because of the large node number. In view of this defect, a regional optimization dynamic algorithm is put forward. In this paper, the regional optimization problem of node placement is modeled, and a regional optimization dynamic algorithm with a mixed strategy for node placement (MRDA) is proposed. Simulation experiments are carried out for the proposed algorithm and other comparison algorithms. Results of experiments show that the proposed algorithm can greatly reduce the dimensions and narrow the search range, with a significant improvement in the search performance and convergence speed.
- 19 February 2020
- Published by Springer Nature in Wireless Networks
- Vol. 26 (5) , 3539-3552
Adaptive directed evolved NSGA2 based node placement optimization for wireless sensor networks
- 19 February 2020
- Published by Springer Nature in Wireless Networks
- Vol. 26 (5) , 3539-3552
Adaptive directed evolved NSGA2 based node placement optimization for wireless sensor networks