Xiaodan Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xiaodan Zhang has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Zhenxue He
Key Laboratory of Agricultural Big Data of Hebei Province, Hebei Agricultural University, Baoding, China
4 shared publications - Limin Xiao
Beihang University
2 shared publications - Lixin Miao
Hebei Agricultural University
2 shared publications - Xiaojun Zhao
Key Laboratory of Agricultural Big Data of Hebei Province, Hebei Agricultural University, Baoding 071001, China
2 shared publications - Yijin Wang
Key Laboratory of Agricultural Big Data of Hebei Province, Hebei Agricultural University, Baoding 071001, China
2 shared publications - Zhisheng Huo
Beihang University
2 shared publications
Latest Publications
- Open Access
- 24 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
A Collaborative Optimization Method for Area and Power Consumption of FPRM Logic Circuits Based on an Experience Interaction Mechanism
To address the low quality of Pareto solution sets and poor search efficiency in multi-objective optimization for XNOR/OR-based Fixed Polarity Reed-Muller (FPRM) logic circuits, this paper proposes an Experience Interaction Mechanism-based Area and Power Co-optimization method (EIM-APCO). At its core is the Dynamic Intelligent Experience-based Dung Beetle Optimizer (DIEDBO), which incorporates three complementary strategies: a dual-mode adaptive exploration strategy that balances global and local search via dynamic mode switching; a jump-based exploitation strategy that uses adaptive step sizes to escape local optima; and a phase-aware intelligent experience fusion strategy that facilitates information sharing and co-evolution within the population. Extensive experiments on 12 MCNC benchmark circuits—including orthogonal parameter tuning, ablation studies, HV indicator analysis, runtime comparison, and Wilcoxon statistical tests—demonstrate that DIEDBO outperforms DBO, MMODE_SPDN, MOGWO, IMOPSO, and MOEA/D, achieving maximum area and power savings of 42.58% and 23.33%, respectively, with an average runtime saving of 45.87%. The results confirm the effectiveness and competitiveness of the proposed method in multi‑objective FPRM circuit optimization.
- 24 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
Open AccessA Collaborative Optimization Method for Area and Power Consumption of FPRM Logic Circuits Based on an Experience Interaction Mechanism
To address the low quality of Pareto solution sets and poor search efficiency in multi-objective optimization for XNOR/OR-based Fixed Polarity Reed-Muller (FPRM) logic circuits, this paper proposes an Experience Interaction Mechanism-based Area and Power Co-optimization method (EIM-APCO). At its core is the Dynamic Intelligent Experience-based Dung Beetle Optimizer (DIEDBO), which incorporates three complementary strategies: a dual-mode adaptive exploration strategy that balances global and local search via dynamic mode switching; a jump-based exploitation strategy that uses adaptive step sizes to escape local optima; and a phase-aware intelligent experience fusion strategy that facilitates information sharing and co-evolution within the population. Extensive experiments on 12 MCNC benchmark circuits—including orthogonal parameter tuning, ablation studies, HV indicator analysis, runtime comparison, and Wilcoxon statistical tests—demonstrate that DIEDBO outperforms DBO, MMODE_SPDN, MOGWO, IMOPSO, and MOEA/D, achieving maximum area and power savings of 42.58% and 23.33%, respectively, with an average runtime saving of 45.87%. The results confirm the effectiveness and competitiveness of the proposed method in multi‑objective FPRM circuit optimization.
- Open Access
- 7 April 2026
- Published by MDPI AG in Algorithms
- Vol. 19 (4) , 285
A Robot Path Planning Method Based on a Key Point Encoding Genetic Algorithm
Path planning is a key technology in robot navigation and has long attracted significant attention. However, in scenarios with high-density or unstructured obstacle distributions, path planning methods based on swarm intelligence optimization still face issues of low computational efficiency and poor path quality, limiting their performance in real-time applications. To address these challenges, this paper defines path key points and proposes a path planning method based on the Key-Points Encoding Genetic Algorithm (KEGA). First, an encoding scheme is designed to map key-point sequences into binary encodings, guiding the population to explore efficiently. Then, a new path generation module is integrated using target point direction, local environment, and historical path information to generate high-quality key-point sequences, thereby improving path quality. Additionally, by evaluating key-point sequences as a proxy for full path evaluation, only one precise path construction is required per iteration, significantly reducing computational overhead. Experiments were conducted on four simulated maps with diverse obstacle distribution characteristics and eight real-world street maps to validate the method’s robustness and generalizability. The results show that, compared to the existing state-of-the-art robot path planning methods, the proposed method achieves an average runtime savings of 75.40%, a path length reduction of 35.65% and a path smoothness improvement of 68%.
- 7 April 2026
- Published by MDPI AG in Algorithms
- Vol. 19 (4) , 285
Open AccessA Robot Path Planning Method Based on a Key Point Encoding Genetic Algorithm
Path planning is a key technology in robot navigation and has long attracted significant attention. However, in scenarios with high-density or unstructured obstacle distributions, path planning methods based on swarm intelligence optimization still face issues of low computational efficiency and poor path quality, limiting their performance in real-time applications. To address these challenges, this paper defines path key points and proposes a path planning method based on the Key-Points Encoding Genetic Algorithm (KEGA). First, an encoding scheme is designed to map key-point sequences into binary encodings, guiding the population to explore efficiently. Then, a new path generation module is integrated using target point direction, local environment, and historical path information to generate high-quality key-point sequences, thereby improving path quality. Additionally, by evaluating key-point sequences as a proxy for full path evaluation, only one precise path construction is required per iteration, significantly reducing computational overhead. Experiments were conducted on four simulated maps with diverse obstacle distribution characteristics and eight real-world street maps to validate the method’s robustness and generalizability. The results show that, compared to the existing state-of-the-art robot path planning methods, the proposed method achieves an average runtime savings of 75.40%, a path length reduction of 35.65% and a path smoothness improvement of 68%.
- 12 February 2026
- Published by Springer Nature in Cluster Computing
- Vol. 29 (3) , 138
Adaptive sand cat swarm optimization algorithm for unmanned ground vehicle path planning
- 12 February 2026
- Published by Springer Nature in Cluster Computing
- Vol. 29 (3) , 138
Adaptive sand cat swarm optimization algorithm for unmanned ground vehicle path planning
- 1 September 2025
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 26 (9) , 1577-1595
An adaptive dung beetle optimizer based on an elastic annealing mechanism and its application to numerical problems and optimization of Reed–Muller logic circuits
The dung beetle optimizer (DBO) is a metaheuristic algorithm with fast convergence and powerful search capabilities, which has shown excellent performance
- 1 September 2025
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 26 (9) , 1577-1595
An adaptive dung beetle optimizer based on an elastic annealing mechanism and its application to numerical problems and optimization of Reed–Muller logic circuits
The dung beetle optimizer (DBO) is a metaheuristic algorithm with fast convergence and powerful search capabilities, which has shown excellent performance
- 1 November 2024
- Published by Springer Nature
- p. 290-303
Multi-prototype Co-saliency Model for Plant Disease Detection
- 1 November 2024
- Published by Springer Nature
- p. 290-303
Multi-prototype Co-saliency Model for Plant Disease Detection
- Open Access
- 1 January 2021
- Published by Acta Physica Sinica, Chinese Physical Society and Institute of Physics, Chinese Academy of Sciences in Acta Physica Sinica
- Vol. 70 (18) , 188401-188401-11
Design and optimization of passivation layers and emitter layers in silicon heterojunction solar cells
本征钝化层及p型发射层对硅异质结太阳电池的性能具有重要的影响. 本文在常规钝化层与晶硅衬底(c-Si)之间插入一层低功率、高氢稀释比沉积的超薄缓冲层, 以此来提高钝化效果, 并拓宽钝化层工艺窗口. 此外, 设计并制备了具有宽带隙、高电导特性的重掺杂纳米晶硅/轻掺杂p型双层复合发射极. 实验结果表明, 双层钝化层具有更加稳定与优异的钝化效果, 钝化样品的少子寿命达到4.197 ms, 隐含开路电压(implied-VOC, iVOC)达到726 mV. 同时双层复合发射层中, 轻掺杂的掺杂层可以减弱掺杂剂向本征钝化层的扩散, 保证良好的钝化效果, 而重掺杂的掺杂层不仅能够提供足够的内建电场, 而且可以改善掺杂层与氧化铟锡薄膜的接触特性, 进而提升电池的输出特性. 并且高氢稀释比的前掺杂层还可以对钝化层起到氢处理的作用, 减少钝化层表面的悬挂键, 从而增强化学钝化效果, 进而提高电池的开路电压. 最终, 基于商业化制绒的硅片, 获得了效率达到20.96%的硅异质结太阳电池, 其中开路电压710 mV, 短路电流密度为39.88 mA/cm2, 填充因子为74.02%.
- 1 January 2021
- Published by Acta Physica Sinica, Chinese Physical Society and Institute of Physics, Chinese Academy of Sciences in Acta Physica Sinica
- Vol. 70 (18) , 188401-188401-11
Open AccessDesign and optimization of passivation layers and emitter layers in silicon heterojunction solar cells
本征钝化层及p型发射层对硅异质结太阳电池的性能具有重要的影响. 本文在常规钝化层与晶硅衬底(c-Si)之间插入一层低功率、高氢稀释比沉积的超薄缓冲层, 以此来提高钝化效果, 并拓宽钝化层工艺窗口. 此外, 设计并制备了具有宽带隙、高电导特性的重掺杂纳米晶硅/轻掺杂p型双层复合发射极. 实验结果表明, 双层钝化层具有更加稳定与优异的钝化效果, 钝化样品的少子寿命达到4.197 ms, 隐含开路电压(implied-VOC, iVOC)达到726 mV. 同时双层复合发射层中, 轻掺杂的掺杂层可以减弱掺杂剂向本征钝化层的扩散, 保证良好的钝化效果, 而重掺杂的掺杂层不仅能够提供足够的内建电场, 而且可以改善掺杂层与氧化铟锡薄膜的接触特性, 进而提升电池的输出特性. 并且高氢稀释比的前掺杂层还可以对钝化层起到氢处理的作用, 减少钝化层表面的悬挂键, 从而增强化学钝化效果, 进而提高电池的开路电压. 最终, 基于商业化制绒的硅片, 获得了效率达到20.96%的硅异质结太阳电池, 其中开路电压710 mV, 短路电流密度为39.88 mA/cm2, 填充因子为74.02%.
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
The Pyrolysis Characteristics and Kinetics Analysis on Typical Thermoplastic Artificial Green Plants
The flowers, leaves and stems of artificial green plants have been chosen as the study objects and the pyrolysis characteristics of these three parts have been analyzed in order to identify the fire characteristics of the typical thermoplastic artificial green plants. The pyrolysis activation energy distribution of the three parts of the sample has been studied through Starink method and Firedman method respectively and the accuracy of the two methods have been compared. The most probable mechanism functions of the primary pyrolysis stages of the three parts have been discussed through Malek method. The Coats-Redfern method has been used to verify the obtained most probable mechanism functions. The results of thermogravimetric experiments show that the pyrolysis of the flowers and leaves of the artificial green plants can be divided into two stages. The temperature at which these two parts reach the maximum heating rate is basically the same. The residual amount of the flower sample keeps decreasing with the increase of the heating rate while the residual amount of the leaves increases with the increasing heating rate. The pyrolysis of stems involves three stages, in which the second stage owns the highest mass loss rate, and the residual amount of stems decreases with the rising heating rate. The analysis results of the pyrolysis kinetics of artificial green plants show that the activation energy of stems is relatively low, most likely to be pyrolyzed in case of fire. The partial activation energy of the leaves is relatively high, contributing to high thermal stability in case of fire. As the reaction proceeds, the pyrolysis mechanisms of the artificial green plant flowers, leaves and stems transform from random nucleation to two-dimensional diffusion, from random nucleation to phase boundary reaction and from chemical reaction to three-dimensional diffusion respectively.
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
The Pyrolysis Characteristics and Kinetics Analysis on Typical Thermoplastic Artificial Green Plants
The flowers, leaves and stems of artificial green plants have been chosen as the study objects and the pyrolysis characteristics of these three parts have been analyzed in order to identify the fire characteristics of the typical thermoplastic artificial green plants. The pyrolysis activation energy distribution of the three parts of the sample has been studied through Starink method and Firedman method respectively and the accuracy of the two methods have been compared. The most probable mechanism functions of the primary pyrolysis stages of the three parts have been discussed through Malek method. The Coats-Redfern method has been used to verify the obtained most probable mechanism functions. The results of thermogravimetric experiments show that the pyrolysis of the flowers and leaves of the artificial green plants can be divided into two stages. The temperature at which these two parts reach the maximum heating rate is basically the same. The residual amount of the flower sample keeps decreasing with the increase of the heating rate while the residual amount of the leaves increases with the increasing heating rate. The pyrolysis of stems involves three stages, in which the second stage owns the highest mass loss rate, and the residual amount of stems decreases with the rising heating rate. The analysis results of the pyrolysis kinetics of artificial green plants show that the activation energy of stems is relatively low, most likely to be pyrolyzed in case of fire. The partial activation energy of the leaves is relatively high, contributing to high thermal stability in case of fire. As the reaction proceeds, the pyrolysis mechanisms of the artificial green plant flowers, leaves and stems transform from random nucleation to two-dimensional diffusion, from random nucleation to phase boundary reaction and from chemical reaction to three-dimensional diffusion respectively.