Pengfei Fan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Pengfei Fan has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Pengfei He
School of Physics and Electronic Information, Yantai University, Yantai 264005, China
3 shared publications - Ying Zhang
School of Physics and Electronic Information, Yantai University, Yantai, China
2 shared publications - Han Gan
School of Information and Electronic Engineering, Shandong Business and Technology University, Yantai 264005, China
1 shared publication - Hongxin Zhang
School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing, China
1 shared publication Shi-E Wu
School of Physics and Electronic Information, Yantai University, Yantai, China
1 shared publicationYing Zhang
School of Physics and Electronic Information, Yantai University, Yantai, China
1 shared publication
Latest Publications
- Open Access
- 1 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 105703-105715
Optimization of Storage and Retrieval Strategies in Warehousing Based on Enhanced Genetic Algorithm
The Shuttle-Based Storage and Retrieval System (SBS/RS) faces challenges of low efficiency due to the constraints of single outbound or inbound operations. To overcome this limitation, a scheme enabling simultaneous outbound and inbound operations has been proposed. This involved developing a physical model that incorporates costs related to outbound cargo urgency, shelf stability, time, and warehouse busyness. The model was solved using a Genetic Algorithm with priority selection, adaptive operators, and a decay factor (GA-DF). Experimental results, validated across various environments, demonstrate that the proposed GA-DF algorithm achieves 50% higher efficiency compared to the IOSA algorithm when the shelf occupancy rate is 50% and multiple cost environments are considered. Additionally, GA-DF outperforms the Simulated Annealing algorithm, traditional Genetic Algorithm, and IOSA algorithm in optimizing storage and retrieval locations, significantly enhancing system optimization. This provides a crucial reference for optimizing such systems, particularly in dynamic and complex warehousing environments. The GA-DF algorithm’s applicability and advantages have been widely recognized through further validation, highlighting its potential to drive improvements in warehousing system efficiency and optimization strategies.
- 1 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 105703-105715
Open AccessOptimization of Storage and Retrieval Strategies in Warehousing Based on Enhanced Genetic Algorithm
The Shuttle-Based Storage and Retrieval System (SBS/RS) faces challenges of low efficiency due to the constraints of single outbound or inbound operations. To overcome this limitation, a scheme enabling simultaneous outbound and inbound operations has been proposed. This involved developing a physical model that incorporates costs related to outbound cargo urgency, shelf stability, time, and warehouse busyness. The model was solved using a Genetic Algorithm with priority selection, adaptive operators, and a decay factor (GA-DF). Experimental results, validated across various environments, demonstrate that the proposed GA-DF algorithm achieves 50% higher efficiency compared to the IOSA algorithm when the shelf occupancy rate is 50% and multiple cost environments are considered. Additionally, GA-DF outperforms the Simulated Annealing algorithm, traditional Genetic Algorithm, and IOSA algorithm in optimizing storage and retrieval locations, significantly enhancing system optimization. This provides a crucial reference for optimizing such systems, particularly in dynamic and complex warehousing environments. The GA-DF algorithm’s applicability and advantages have been widely recognized through further validation, highlighting its potential to drive improvements in warehousing system efficiency and optimization strategies.
- Open Access
- 11 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 109625-109633
Research on Path Planning Based on Bidirectional A* Algorithm
A refined bidirectional A* algorithm proposes to address the issue of imprecise path planning for unmanned mining vehicles navigating through complex open-pit mining terrains. To ensure the smooth traversal of these vehicles, a gradient factor incorporates into the cost function to circumvent obstacles along the pathway. Additionally, a weighted coefficient introduces into the heuristic function to fine-tune the combination of Euclidean and Manhattan distances, enhancing the accuracy of path distance measurement and ultimately leading to an optimal path. The enhanced algorithm adeptly simultaneously explores from both the starting and end points, significantly reducing search time and improving path planning efficiency. Utilizing the established map of the mining environment, an experiment for unmanned mining vehicle path planning devises, and a simulation test of the global path planning algorithm conducts using the MATLAB platform. The experimental results demonstrate that the refined bidirectional A* algorithm exhibits accelerated search speed and superior path planning effectiveness.
- 11 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 109625-109633
Open AccessResearch on Path Planning Based on Bidirectional A* Algorithm
A refined bidirectional A* algorithm proposes to address the issue of imprecise path planning for unmanned mining vehicles navigating through complex open-pit mining terrains. To ensure the smooth traversal of these vehicles, a gradient factor incorporates into the cost function to circumvent obstacles along the pathway. Additionally, a weighted coefficient introduces into the heuristic function to fine-tune the combination of Euclidean and Manhattan distances, enhancing the accuracy of path distance measurement and ultimately leading to an optimal path. The enhanced algorithm adeptly simultaneously explores from both the starting and end points, significantly reducing search time and improving path planning efficiency. Utilizing the established map of the mining environment, an experiment for unmanned mining vehicle path planning devises, and a simulation test of the global path planning algorithm conducts using the MATLAB platform. The experimental results demonstrate that the refined bidirectional A* algorithm exhibits accelerated search speed and superior path planning effectiveness.
- Open Access
- 4 May 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (9) , 5671
Side-Channel Power Analysis Based on SA-SVM
Support vector machines (SVMs) have been widely used in side-channel power analysis. The selection of the penalty factor and kernel parameter heavily influences how well support vector machines work. Setting reasonable SVM hyperparameters is a key issue in side-channel power analysis. The novel side-channel power analysis method SA-SVM, which combines simulated annealing (SA) and support vector machines (SVMs) to analyze the power traces and crack the key, is proposed in this paper as a solution to this issue. This method differs from other approaches in that it integrates SA and SVMs, enabling us to more effectively explore the search space and produce superior results. In this paper, we conducted experiments on SA-SVM and SVM models from three different aspects: the selection of kernel functions, the number of parameters, and the number of eigenvalues. To compare our results with previous research, we performed experimental evaluations on open datasets. The results indicate that, compared with the SVM model, the SA-SVM model improved the accuracy by 0.25% to 3.25% and reduced the required time by 39.96% to 98.02% when the point of interest was 53, recovering the key using only three power traces. The SA-SVM model outperforms existing methods in terms of accuracy and computation time.
- 4 May 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (9) , 5671
Open AccessSide-Channel Power Analysis Based on SA-SVM
Support vector machines (SVMs) have been widely used in side-channel power analysis. The selection of the penalty factor and kernel parameter heavily influences how well support vector machines work. Setting reasonable SVM hyperparameters is a key issue in side-channel power analysis. The novel side-channel power analysis method SA-SVM, which combines simulated annealing (SA) and support vector machines (SVMs) to analyze the power traces and crack the key, is proposed in this paper as a solution to this issue. This method differs from other approaches in that it integrates SA and SVMs, enabling us to more effectively explore the search space and produce superior results. In this paper, we conducted experiments on SA-SVM and SVM models from three different aspects: the selection of kernel functions, the number of parameters, and the number of eigenvalues. To compare our results with previous research, we performed experimental evaluations on open datasets. The results indicate that, compared with the SVM model, the SA-SVM model improved the accuracy by 0.25% to 3.25% and reduced the required time by 39.96% to 98.02% when the point of interest was 53, recovering the key using only three power traces. The SA-SVM model outperforms existing methods in terms of accuracy and computation time.