Liping Mo

Prof. Liping Mo

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-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.

12 October 2020 in IEEE Access
Verified
Journal Article
Open access
HLHang-Cheng Li
Hang-Cheng Li
KZKai-Qing Zhou
Kai-Qing Zhou
LMLiping Mo
Liping Mo
AZAzlan Mohd Zain
Azlan Mohd Zain
FQFeng Qin
Feng Qin
Compared with rules in the form of ’IF-THEN’, weighted fuzzy production rules (WFPRs) have more robust knowledge expression capabilities, but weighted fuzzy production rules are more difficult to obtain. The weighted fuzzy production rules obtained using traditional neural network methods have shortcomings, such as insufficient precision and insufficient knowledge extraction. Focusing on the mentioned shortages, a modified weighted fuzzy production rules extraction approach is proposed by combining the modified harmony search algorithm, and neural network. The method consists of three main stages. First, a global optimal adaptive harmony search algorithm (AGOHS) is proposed to overcome the traditional harmony search algorithm’s existing poor adaptive ability. Then, the AGOHS algorithm is used to optimize the neural network’s initial weights to improve the neural network’s training efficiency. Finally, extract the WFPRs with IF-THEN from the trained neural network and give the corresponding fuzzy reasoning. Through the WFPRs extraction experiments using IRIS and PIMA data sets reveal the proposed rule extraction framework has some apparent highlights, such as high accuracy, the smaller number of generated rules, and low redundancy.

1 June 2018 in Symmetry
Verified
Journal Article
Open access
PDF file
KZKai-Qing Zhou
Kai-Qing Zhou
WGWeihua Gui
Weihua Gui
LMLiping Mo
Liping Mo
AZAZLAN Mohd MOHD ZAIN
AZLAN Mohd MOHD ZAIN
Fuzzy Petri net (FPN) is a powerful tool to execute the fault diagnosis function for various industrial applications. One of the most popular approaches for fault diagnosis is to calculate the corresponding algebra forms which record flow information and three parameters of value of all places and transitions of the FPN model. However, with the rapid growth of the complexity of the real system, the scale of the corresponding FPN is also increased sharply. It indicates that the complexity of the fault diagnosis algorithm is also raised due to the increased scale of vectors and matrix. Focusing on this situation, a bidirectional adaptive fault diagnosis algorithm is presented in this article to reduce the complexity of the fault diagnosis process via removing irrelevant places and transitions of the large-scale FPN, followed by the correctness and algorithm complexity of the proposed approach that are also discussed in detail. A practical example is utilized to show the feasibility and efficacy of the proposed method. The results of the experiments illustrated that the proposed algorithm owns the ability to simplify the inference process and to reduce the algorithm complexity due to the removal of unnecessary places and transitions in the reasoning path of the appointed output place.

20 October 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
WMWei Min
Wei Min
LMLiping Mo
Liping Mo
BYBiao Yin
Biao Yin
SLShan Li
Shan Li
This manuscript introduces an improved Cuckoo Search (CS) algorithm, known as BASCS, designed to address the inherent limitations of CS, including insufficient search space coverage, premature convergence, low search accuracy, and slow search speed. The proposed improvements encompass four main areas: the integration of tent chaotic mapping and random migration in population initialization to reduce the impact of random errors, the guidance of Levy flight by the directional determination strategy of the Beetle Antennae Search (BAS) algorithm during the global search phase to improve search accuracy and convergence speed, the adoption of the Sine Cosine Algorithm for local exploitation in later iterations to enhance local optimization and accuracy, and the adaptive adjustment of the step-size factor and elimination probability throughout the iterative process to convergence. The performance of BASCS is validated through ablation experiments on 10 benchmark functions, comparative experiments with the original CS and its four variants, and application to a robot path planning problem. The results demonstrate that BASCS achieves higher convergence accuracy and exhibits faster convergence speed and superior practical applicability compared to other algorithms.

26 November 2024 in Scientific Reports
Verified
Journal Article
Open access
PDF file
BYBiao Yin
Biao Yin
LMLiping Mo
Liping Mo
WMWei Min
Wei Min
SLShan Li
Shan Li
CYCunwei Yu
Cunwei Yu
This manuscript presents ABSAS-CS-GSA, an improved iteration of the beetle antennae search (BAS) algorithm, tailored to address the shortcoming of the BAS with low convergence accuracy and easily falling into local optima. The improvements are structured into three principal components: first, dynamic step-size adjustment predicated on initial population to bolster solution accuracy and expedite convergence; second, position update mechanism integrating golden sine algorithm to diversify search patterns and expedite convergence; and third, population disturbance based on vertical and horizontal cross strategy to avoid falling into local optima. Experimental results on 12 benchmark functions demonstrate ABSAS-CS-GSA's superiority over the standard BAS and its four variants, as well as over two classic swarm intelligence algorithms. The simulation results of the algorithm applied to coverage optimization of wireless sensor networks with 30 nodes and 50 nodes reveal a marked improvement in both optimal and average coverage metrics relative to seven alternative algorithms. The refined algorithm exhibits excellent performance and is well-suited for tackling the coverage issue within wireless sensor networks.