Wenjie Yu

Wenjie Yu


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
1 July 2023 in Sensors
Verified
Journal Article
Open access
PDF file
LZLi Zheng
Li Zheng
WYWenjie Yu
Wenjie Yu
GLGuangxu Li
Guangxu Li
GQGuangxu Qin
Guangxu Qin
YLYunchuan Luo
Yunchuan Luo
Path planning is an important part of the navigation control system of mobile robots since it plays a decisive role in whether mobile robots can realize autonomy and intelligence. The particle swarm algorithm can effectively solve the path-planning problem of a mobile robot, but the traditional particle swarm algorithm has the problems of a too-long path, poor global search ability, and local development ability. Moreover, the existence of obstacles makes the actual environment more complex, thus putting forward more stringent requirements on the environmental adaptation ability, path-planning accuracy, and path-planning efficiency of mobile robots. In this study, an artificial potential field-based particle swarm algorithm (apfrPSO) was proposed. First, the method generates robot planning paths by adjusting the inertia weight parameter and ranking the position vector of particles (rPSO), and second, the artificial potential field method is introduced. Through comparative numerical experiments with other state-of-the-art algorithms, the results show that the algorithm proposed was very competitive.

15 June 2018 in IEEE Access
Verified
Journal Article
Open access
WYWenjie Yu
Wenjie Yu
ZZZhi Zeng
Zhi Zeng
BPBei Peng
Bei Peng
SYShuo Yan
Shuo Yan
YHYueshuang Huang
Yueshuang Huang
TFTao Fan
Tao Fan
This research was supported by the Science and Technology Planning Project of Sichuan Province (Grant No. 2018GZ0284) and the National Natural Science Foundation of China (Grant No. 51205047). The authors would also like to acknowledge the anonymous reviewers for their valuable comments and suggestions that helped to improve the quality of the paper. This paper outlines a new procedure for computer modeling and optimum design for the dynamic mechanical and electrical study of a high-speed backplane connector, which is a key electrical interconnection technology in large communications equipment, ultra-high performance servers, supercomputers, industrial computers and high-end storage devices, etc. The optimum structure design of contact pairs is important for a backplane connector in meeting multiple challenges in terms of minimizing the maximum insertion force and the contact resistance. Current optimization schemes, such as the quadrature method, are relatively complex. Therefore, we designed the connector contact pairs for simultaneously obtaining the proper insertion force and the contact resistance through a multi-objective particle swarm optimization method of simpler settings and faster convergence speed. In this analysis, the required insertion force was minimized during the entire process, and the minimum contact resistance was maintained after insertion. To this end, a multi-objective particle-swarm optimization algorithm (MCDPSO) was proposed for the connector-design. A dynamic weight coefficient was developed to calculate the interval values of the reserved solutions for the selection of the operator, and an external archive update based on roulette wheel selection and gbest selection strategies was developed to increase the diversity of the solutions. A set of optimal structure solutions of the contact pairs was obtained for the subsequent design optimization. The feasibility and effectiveness of the proposed method was verified by comparing with the results from ANSYS finite element simulation.

1 February 2021 in Computing
Verified
Journal Article
Closed access
PDF file
CLChao Lu
Chao Lu
XLXunbo Li
Xunbo Li
WYWenjie Yu
Wenjie Yu
ZZZhi Zeng
Zhi Zeng
MYMingming Yan
Mingming Yan
XLXiang Li
Xiang Li

1 June 2018 in Intelligent Automation and Soft Computing
Verified
Journal Article
Closed access
WYWenjie Yu
Wenjie Yu
XLXunbo Li
Xunbo Li
HYHang Yang
Hang Yang
BHBo Huang
Bo Huang

18 November 2022 in Sensors
Verified
Journal Article
Open access
PDF file
WYWenjie Yu
Wenjie Yu
XLXiangmei Li
Xiangmei Li
Zhi ZengZhi Zeng
Zhi Zeng
MLMiao Luo
Miao Luo
Lifetime optimization is one of the key issues among the many challenges of wireless sensor networks. The introduction of a small number of high-performance relay nodes can effectively improve the quality of the network services. However, how to deploy these nodes reasonably to fully enhance the network lifetime becomes a very difficult problem. In this study, a modified and enhanced Artificial Bee Colony is proposed to maximize the lifetime of a two-tiered wireless sensor network by optimal deployment of relay nodes. First, the dimension of the problem is introduced into the candidate search equation and the local search is adjusted according to the fitness of the problem and number of iterations, which helps to balance the exploration and exploitation ability of the algorithm. Second, in order to prevent the algorithm from falling into local convergence, a dynamic search balance strategy is proposed instead of the scout bee phase in the original Artificial Bee Colony. Then, a feasible solution formation method is proposed to ensure that the relay nodes can form the upper-layer backbone of the network. Finally, we employ this algorithm on a test dataset obtained from the literature. The simulation results show that the proposed algorithm for two-tiered wireless sensor network lifetime optimization can obtain higher and stable average network lifetime and more reasonable relay node deployment compared to other classical and state-of-the-art algorithms, verifying the competitive performance of the proposed algorithm.

28 January 2018 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
WYWenjie Yu
Wenjie Yu
XLXunbo Li
Xunbo Li
HCHanbin Cai
Hanbin Cai
Zhi ZengZhi Zeng
Zhi Zeng
XLXiang Li
Xiang Li
The artificial bee colony (ABC) algorithm is a relatively new optimization technique for simulating the honey bee swarms foraging behavior. Due to its simplicity and effectiveness, it has attracted much attention in recent years. However, ABC search equation is good at global search but poor at local search. Some different search equations are developed to tackle this problem, while there is no particular algorithm to substantially attain the best solution for all optimization problems. Therefore, we proposed an improved ABC with a new search equation, which incorporates the global search factor based on the optimization problem dimension and the local search factor based on the factor library (FL). Furthermore, aimed at preventing the algorithm from falling into local optima, dynamic search balance strategy is proposed and applied to replace the scout bee procedure in ABC. Thus, a hybrid, fast, and enhanced algorithm, HFEABC, is presented. In order to verify its effectiveness, some comprehensive tests among HFEABC and ABC and its variants are conducted on 21 basic benchmark functions and 20 complicated functions from CEC 2017. The experimental results show HFEABC offers better compatibility for different problems than ABC and some of its variants. The HFEABC performance is very competitive.