Dehui 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
Dehui Zhang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Sheng Liu
School of Management, Shanghai University of Engineering Science, Shanghai, China
2 shared publications - Xiaoming You
College of Electronic and Electrical Engineering, Shanghai University of Engineering Science, Shanghai, China
2 shared publications Changyuan You
School of Information Engineering, Zhengzhou University, Zhengzhou, China
1 shared publication- Han Pan
College of Electronic and Electrical Engineering, Shanghai University of Engineering Science, Shanghai, China
1 shared publication - Kang Yang
College of Electronic and Electrical Engineering, Shanghai University of Engineering Science, Shanghai 201620, China
1 shared publication
Latest Publications
- 29 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 824-829
Research on DOA Estimation Based on Spatial Smoothing Algorithm and Optimal Smoothing Times
MUSIC algorithm is widely used to estimate the direction of arrival (DOA) of spatial signals because of its high estimation accuracy and low SNR (Signal to Noise Ratio). However, for non-coherent signals, the traditional MUSIC algorithm cannot make accurate estimation. This paper starts with the principles of MUSIC algorithm, carries out mathematical derivation and simulation experiments, and uses the MUSIC algorithm based on spatial smoothing to estimate the coherent DOA of signals. The relationship between the optimal smoothing times and coherent signals is proposed, and the relational expression of the optimal smoothing times is found under the condition of one-dimensional uniform linear array, more antenna arrays and less coherent signals. The simulation results show that the relational expression has good performance.
- 29 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 824-829
Research on DOA Estimation Based on Spatial Smoothing Algorithm and Optimal Smoothing Times
MUSIC algorithm is widely used to estimate the direction of arrival (DOA) of spatial signals because of its high estimation accuracy and low SNR (Signal to Noise Ratio). However, for non-coherent signals, the traditional MUSIC algorithm cannot make accurate estimation. This paper starts with the principles of MUSIC algorithm, carries out mathematical derivation and simulation experiments, and uses the MUSIC algorithm based on spatial smoothing to estimate the coherent DOA of signals. The relationship between the optimal smoothing times and coherent signals is proposed, and the relational expression of the optimal smoothing times is found under the condition of one-dimensional uniform linear array, more antenna arrays and less coherent signals. The simulation results show that the relational expression has good performance.
- Open Access
- 15 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 129958-129974
Dynamic Multi-Role Adaptive Collaborative Ant Colony Optimization for Robot Path Planning
Aiming at the problems of poor diversity and slow convergence of ant colony algorithm, dynamic multi-role adaptive collaborative ant colony optimization (MRCACO) is proposed in this paper, and it applies to robot path planning. Firstly, an adaptive dynamic complementary algorithm is proposed to form a heterogeneous multi-colony together with ACS and MMAS, which complement each other in performance. Secondly, a multi-role adaptive cooperation mechanism is proposed to realize the exchange and sharing of information. The mechanism includes two strategies: one is an elite attribute learning strategy, which highlights the role of elite attribute and improves the comprehensive performance of ACS and MMAS; The second is the pheromone balancing strategy, which is executed when the algorithm is stagnant to make the algorithm jump out of the local optimal. Further, the effectiveness and superiority in the algorithm are demonstrated by the experimental analysis of multiple TSP instances. Finally, the algorithm presented in this paper is applied to the path planning of the robot, two different deadlock rollback strategies are proposed to solve the deadlock problem and improve the efficiency of the algorithm. The results of a practical application show that the algorithm is feasible to solve the path planning problem.
- 15 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 129958-129974
Open AccessDynamic Multi-Role Adaptive Collaborative Ant Colony Optimization for Robot Path Planning
Aiming at the problems of poor diversity and slow convergence of ant colony algorithm, dynamic multi-role adaptive collaborative ant colony optimization (MRCACO) is proposed in this paper, and it applies to robot path planning. Firstly, an adaptive dynamic complementary algorithm is proposed to form a heterogeneous multi-colony together with ACS and MMAS, which complement each other in performance. Secondly, a multi-role adaptive cooperation mechanism is proposed to realize the exchange and sharing of information. The mechanism includes two strategies: one is an elite attribute learning strategy, which highlights the role of elite attribute and improves the comprehensive performance of ACS and MMAS; The second is the pheromone balancing strategy, which is executed when the algorithm is stagnant to make the algorithm jump out of the local optimal. Further, the effectiveness and superiority in the algorithm are demonstrated by the experimental analysis of multiple TSP instances. Finally, the algorithm presented in this paper is applied to the path planning of the robot, two different deadlock rollback strategies are proposed to solve the deadlock problem and improve the efficiency of the algorithm. The results of a practical application show that the algorithm is feasible to solve the path planning problem.
- Open Access
- 28 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 157303-157317
Multi-Colony Ant Colony Optimization Based on Generalized Jaccard Similarity Recommendation Strategy
Ant Colony Optimization has achieved good results in solving Traveling Salesman Problem (TSP), it has a tendency to fall into local optima and the convergence speed is limited. To address this problem, multi-colony ant colony optimization based on the generalized Jaccard similarity recommendation strategy (JCACO) is proposed. Firstly, two classical ant populations, Ant Colony System and Max-Min Ant System are selected to form heterogeneous multi-colony. Secondly, attribute-based collaborative filtering recommendation mechanism is proposed to balance the diversity and convergence of the algorithm, three strategies have been implemented under this recommendation mechanism: The attribute cross-learning strategy is used to highlight the effect of excellent attributes and improve the attribute comprehensive performance; According to the diversity results of the population measured by information entropy, the attribute recommendation learning strategy is used to enrich the diversity of the population adaptively; The pheromone reward strategy is implemented on the public path to accelerate the convergence speed; Among which, according to the generalized Jaccard similarity coefficient, the most suitable communication object is recommended in order to achieve the best learning efficiency. Finally, when the algorithm stagnates, the elite reverse learning mechanism is used to jump out of the local optimum. Experimental results show that JCACO has good performance and high stability in TSP instances, especially in large-scale TSP instances.
- 28 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 157303-157317
Open AccessMulti-Colony Ant Colony Optimization Based on Generalized Jaccard Similarity Recommendation Strategy
Ant Colony Optimization has achieved good results in solving Traveling Salesman Problem (TSP), it has a tendency to fall into local optima and the convergence speed is limited. To address this problem, multi-colony ant colony optimization based on the generalized Jaccard similarity recommendation strategy (JCACO) is proposed. Firstly, two classical ant populations, Ant Colony System and Max-Min Ant System are selected to form heterogeneous multi-colony. Secondly, attribute-based collaborative filtering recommendation mechanism is proposed to balance the diversity and convergence of the algorithm, three strategies have been implemented under this recommendation mechanism: The attribute cross-learning strategy is used to highlight the effect of excellent attributes and improve the attribute comprehensive performance; According to the diversity results of the population measured by information entropy, the attribute recommendation learning strategy is used to enrich the diversity of the population adaptively; The pheromone reward strategy is implemented on the public path to accelerate the convergence speed; Among which, according to the generalized Jaccard similarity coefficient, the most suitable communication object is recommended in order to achieve the best learning efficiency. Finally, when the algorithm stagnates, the elite reverse learning mechanism is used to jump out of the local optimum. Experimental results show that JCACO has good performance and high stability in TSP instances, especially in large-scale TSP instances.