Pengfei Yin

Dr. Pengfei Yin


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
1 March 2024 in Symmetry
Verified
Journal Article
Open access
PDF file
YOyun ou
yun ou
FQFeng Qin
Feng Qin
KZKai-Qing Zhou
Kai-Qing Zhou
PYPengfei Yin
Pengfei Yin
LMLiping Mo
Liping Mo
AZAZLAN Mohd MOHD ZAIN
AZLAN Mohd MOHD ZAIN
For wireless sensor network (WSN) coverage problems, since the sensing range of sensor nodes is a circular area with symmetry, taking symmetry into account when deploying nodes will help simplify problem solving. In addition, in view of two specific problems of high node deployment costs and insufficient effective coverage in WSNs, this paper proposes a WSN coverage optimization method based on the improved grey wolf optimizer with multi-strategies (IGWO-MS). As far as IGWO-MS is concerned, first of all, it uses Sobol sequences to initialize the population so that the initial values of the population are evenly distributed in the search space, ensuring high ergodicity and diversity. Secondly, it introduces a search space strategy to increase the search range of the population, avoid premature convergence, and improve search accuracy. And then, it combines reverse learning and mirror mapping to expand the population richness. Finally, it adds Levy flight to increase the disturbance and improve the probability of the algorithm jumping out of the local optimum. To verify the performance of IGWO-MS in WSN coverage optimization, this paper rasterizes the coverage area of the WSN into multiple grids of the same size and symmetry with each other, thereby transforming the node coverage problem into a single-objective optimization problem. In the simulation experiment, not only was IGWO-MS selected, but four other algorithms were also selected for comparison, namely particle swarm optimization (PSO), grey wolf optimizer (GWO), grey wolf optimization based on drunk walk (DGWO), and grey wolf optimization led by two-headed wolves (GWO-THW). The experimental results demonstrate that when the number of nodes for WSN coverage optimization is 20 and 30, the optimal coverage rate and average coverage rate using IGWO-MS are both improved compared to the other four comparison algorithms. To make this clear, in the case of 20 nodes, the optimal coverage rate of IGWO-MS is increased by 13.19%, 1.68%, 4.92%, and 3.62%, respectively, compared with PSO, GWO, DGWO, and GWO-THW; while IGWO-MS performs even better in terms of average coverage rate, which is 16.45%, 3.13%, 11.25%, and 6.19% higher than that of PSO, GWO, DGWO, and GWO-THW, respectively. Similarly, in the case of 30 nodes, compared with PSO, GWO, DGWO, and GWO-THW, the optimal coverage rate of the IGWO-MS is increased by 15.23%, 1.36%, 5.55%, and 3.66%; the average coverage rate is increased by 16.78%, 1.56%, 10.91%, and 8.55%. Therefore, it can be concluded that IGWO-MS has certain advantages in solving WSN coverage problems, which is reflected in that not only can it effectively improve the coverage quality of network nodes, but it also has good stability.

16 February 2023 in Biomimetics
Verified
Journal Article
Open access
PDF file
YOyun ou
yun ou
PYPengfei Yin
Pengfei Yin
LMLiping Mo
Liping Mo
This paper discusses a hybrid grey wolf optimizer utilizing a clone selection algorithm (pGWO-CSA) to overcome the disadvantages of a standard grey wolf optimizer (GWO), such as slow convergence speed, low accuracy in the single-peak function, and easily falling into local optimum in the multi-peak function and complex problems. The modifications of the proposed pGWO-CSA could be classified into the following three aspects. Firstly, a nonlinear function is used instead of a linear function for adjusting the iterative attenuation of the convergence factor to balance exploitation and exploration automatically. Then, an optimal α wolf is designed which will not be affected by the wolves β and δ with poor fitness in the position updating strategy; the second-best β wolf is designed, which will be affected by the low fitness value of the δ wolf. Finally, the cloning and super-mutation of the clonal selection algorithm (CSA) are introduced into GWO to enhance the ability to jump out of the local optimum. In the experimental part, 15 benchmark functions are selected to perform the function optimization tasks to reveal the performance of pGWO-CSA further. Due to the statistical analysis of the obtained experimental data, the pGWO-CSA is superior to these classical swarm intelligence algorithms, GWO, and related variants. Furthermore, in order to verify the applicability of the algorithm, it was applied to the robot path-planning problem and obtained excellent results.


3 July 2024 in Sensors
Verified
Journal Article
Open access
PDF file
Jieyang ZhouJieyang Zhou
Jieyang Zhou
JNJing Ning
Jing Ning
ZXZhiyang Xiang
Zhiyang Xiang
PYPengfei Yin
Pengfei Yin
A robust wood material crack detection algorithm, sensitive to small targets, is indispensable for production and building protection. However, the precise identification and localization of cracks in wooden materials present challenges owing to significant scale variations among cracks and the irregular quality of existing data. In response, we propose a crack detection algorithm tailored to wooden materials, leveraging advancements in the YOLOv8 model, named ICDW-YOLO (improved crack detection for wooden material-YOLO). The ICDW-YOLO model introduces novel designs for the neck network and layer structure, along with an anchor algorithm, which features a dual-layer attention mechanism and dynamic gradient gain characteristics to optimize and enhance the original model. Initially, a new layer structure was crafted using GSConv and GS bottleneck, improving the model’s recognition accuracy by maximizing the preservation of hidden channel connections. Subsequently, enhancements to the network are achieved through the gather–distribute mechanism, aimed at augmenting the fusion capability of multi-scale features and introducing a higher-resolution input layer to enhance small target recognition. Empirical results obtained from a customized wooden material crack detection dataset demonstrate the efficacy of the proposed ICDW-YOLO algorithm in effectively detecting targets. Without significant augmentation in model complexity, the mAP50–95 metric attains 79.018%, marking a 1.869% improvement over YOLOv8. Further validation of our algorithm’s effectiveness is conducted through experiments on fire and smoke detection datasets, aerial remote sensing image datasets, and the coco128 dataset. The results showcase that ICDW-YOLO achieves a mAP50 of 69.226% and a mAP50–95 of 44.210%, indicating robust generalization and competitiveness vis-à-vis state-of-the-art detectors.

1 August 2019 in Tsinghua Science and Technology
Verified
Journal Article
Closed access
YLYanxia Lyu
Yanxia Lyu
SPSancheng Peng
Sancheng Peng
YYYing Yuan
Ying Yuan
CWCong Wang
Cong Wang
PYPengfei Yin
Pengfei Yin
CWCuirong Wang
Cuirong Wang

1 August 2018 in Sensors
Verified
Journal Article
Open access
PDF file
GLGuorui Li
Guorui Li
HCHaobo Chen
Haobo Chen
SPSancheng Peng
Sancheng Peng
XLXinguang Li
Xinguang Li
CWCong Wang
Cong Wang
PYPengfei Yin
Pengfei Yin
In recent years, energy-efficient data collection has evolved into the core problem in the resource-constrained Wireless Sensor Networks (WSNs). Different from existing data collection models in WSNs, we propose a collaborative data collection scheme based on optimal clustering to collect the sensed data in an energy-efficient and load-balanced manner. After dividing the data collection process into the intra-cluster data collection step and the inter-cluster data collection step, we model the optimal clustering problem as a separable convex optimization problem and solve it to obtain the analytical solutions of the optimal clustering size and the optimal data transmission radius. Then, we design a Cluster Heads (CHs)-linking algorithm based on the pseudo Hilbert curve to build a CH chain with the goal of collecting the compressed sensed data among CHs in an accumulative way. Furthermore, we also design a distributed cluster-constructing algorithm to construct the clusters around the virtual CHs in a distributed manner. The experimental results show that the proposed method not only reduces the total energy consumption and prolongs the network lifetime, but also effectively balances the distribution of energy consumption among CHs. By comparing it o the existing compression-based and non-compression-based data collection schemes, the average reductions of energy consumption are 17.9% and 67.9%, respectively. Furthermore, the average network lifetime extends no less than 20-times under the same comparison.