Ying Li

Ying Li

Auto-generated profile, based on publicly available information

Ying Li

College of Computer Science and Technology, Jilin University, Changchun, People’s Republic of China

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
10 September 2020 in IEEE Access
Verified
Journal Article
Open access
RWRui Wang
Rui Wang
YLYing Li
Ying Li
JFJiahao Fan
Jiahao Fan
TWTan Wang
Tan Wang
XCXuetao Chen
Xuetao Chen
Pure pursuit algorithm is one of the most effective ways of path tracking in autonomous vehicles. Nevertheless, the tracking accuracy of the existing pure pursuit algorithm is limited by the look-ahead distance. In this paper, to improve the tracking accuracy of the pure pursuit algorithm, a novel pure pursuit algorithm based on the optimized look-ahead distance named OLDPPA is proposed. Four improvements are presented in OLDPPA. Firstly, to find a better look-ahead distance of pure pursuit algorithm, salp swarm algorithm (SSA) is used in pure pursuit algorithm. Secondly, Brownian motion, a random motion mechanism of particles, is introduced in SSA to enhance its exploitation and exploration capabilities. Thirdly, to accelerate the convergence speed of SSA, a weighted mechanism which uses two different weights in the search process to adjust the salps closer to the food source quickly is assigned. Based on innovations 2 and 3, adaptive Brownian motion salp swarm algorithm (ABMSSA) is proposed and applied to pure pursuit algorithm. Finally, a velocity controller which outputs the speed of the next moment according to the distance and time interval between the look-ahead point and the current vehicle position is designed in OLDPPA, to ensure that the vehicle reaches its destination at a specified time. To verify the effectiveness and efficiency of OLDPPA, OLDPPA is applied in four different paths and the corresponding results are compared with other pure pursuit algorithms that use different look-ahead distances. Experimental results show that the tracking accuracy of OLDPPA is better than other algorithms.

30 November 2021 in PLOS ONE
Verified
Journal Article
Open access
PDF file
JFJiahao Fan
Jiahao Fan
YLYing Li
Ying Li
TWTan Wang
Tan Wang
Metaheuristic optimization algorithms are one of the most effective methods for solving complex engineering problems. However, the performance of a metaheuristic algorithm is related to its exploration ability and exploitation ability. Therefore, to further improve the African vultures optimization algorithm (AVOA), a new metaheuristic algorithm, an improved African vultures optimization algorithm based on tent chaotic mapping and time-varying mechanism (TAVOA), is proposed. First, a tent chaotic map is introduced for population initialization. Second, the individual’s historical optimal position is recorded and applied to individual location updating. Third, a time-varying mechanism is designed to balance the exploration ability and exploitation ability. To verify the effectiveness and efficiency of TAVOA, TAVOA is tested on 23 basic benchmark functions, 28 CEC 2013 benchmark functions and 3 common real-world engineering design problems, and compared with AVOA and 5 other state-of-the-art metaheuristic optimization algorithms. According to the results of the Wilcoxon rank-sum test with 5%, among the 23 basic benchmark functions, the performance of TAVOA has significantly better than that of AVOA on 13 functions. Among the 28 CEC 2013 benchmark functions, the performance of TAVOA on 9 functions is significantly better than AVOA, and on 17 functions is similar to AVOA. Besides, compared with the six metaheuristic optimization algorithms, TAVOA also shows good performance in real-world engineering design problems.

1 January 2016 in Sensors and Actuators B: Chemical
Verified
Journal Article
Closed access
YLYing Li
Ying Li
JXJingyue Xu
Jingyue Xu
LWLuokai Wang
Luokai Wang
YHYANJUN HUANG
YANJUN HUANG
Jiajia GuoJiajia Guo
Jiajia Guo
CSChunyan Sun
Chunyan Sun

29 July 2020 in IEEE Access
Verified
Journal Article
Open access
XCXueting Cui
Xueting Cui
YLYing Li
Ying Li
JFJiahao Fan
Jiahao Fan
TWTan Wang
Tan Wang
YZYuefeng Zheng
Yuefeng Zheng
Feature selection, which eliminates irrelevant and redundant features, is one of the most efficient classification methods. However, searching for an optimal subset from the original set is still a challenging problem. This paper proposes a novel feature selection algorithm named hybrid improved dragonfly algorithm (HIDA) which combines the advantages of both mRMR and improved dragonfly algorithm (IDA) in order to generate promising candidate subset and achieve higher classification accuracy rate. Firstly, to generate promising subset, features with small weight have chance to be selected into candidate subset with a small probability in mRMR. Secondly, to balance the exploitation and exploration capabilities of IDA, dynamic swarming factors are proposed to balance global and local capability. Lastly, to enhance the exploitation capability of IDA, quantum local optimum and global optimum are introduced in the position updating mechanism. The performance of HIDA is investigated on ten gene expression datasets and eight UCI data sets from the UCI Machine Learning Data Repository. Results show that the performance of HIDA is superior to BBA, BDA, CDA, LBPSO, MPMDWOA and MSMCCS.

24 August 2020 in IEEE Access
Verified
Journal Article
Open access
YSYunxia Shi
Yunxia Shi
YLYing Li
Ying Li
JFJiahao Fan
Jiahao Fan
TWTan Wang
Tan Wang
TYTaiqiao Yin
Taiqiao Yin
Long short-term memory network is one of the most important network architectures of decision-making for self-driving vehicles. Nevertheless, the decision-making accuracy of long short-term memory network is limited, the information of the surrounding vehicles is not taken into consideration, which is critical for the decision-making of the ego vehicle, and the classification capability of long shortterm memory network is poor. In this paper, a novel network architecture called improved long short-term memory network with support vector machine classifier optimized by grasshopper optimization algorithm (GOA-ImLSTM) is proposed. Three improvements are presented in GOA-ImLSTM. Firstly, to consider the information of the surrounding vehicles, a new network architecture, used to extract vital features for selfdriving vehicles, with three parallel long short-term memory network units and a network unit serial connected according to vehicle location is designed. Secondly, to improve classification accuracy, support vector machine with stronger classification capability than softmax is introduced to accomplish the classification task. Thirdly, to promote the classification capability of support vector machine, grasshopper optimization algorithm is employed to optimize the parameters of support vector machine. Moreover, to balance exploration and exploitation ability of grasshopper optimization algorithm, dynamic weights in position movement formula are defined. The experiments indicate that GOA-ImLSTM improves the accuracy of results compared with other decision-making methods for self-driving vehicles on the Next Generation SIMulation.

16 July 2024 in PLOS ONE
Verified
Journal Article
Open access
PDF file
YLYing Li
Ying Li
YGYanyu Geng
Yanyu Geng
HSHuankun Sheng
Huankun Sheng
Feature selection is an important solution for dealing with high-dimensional data in the fields of machine learning and data mining. In this paper, we present an improved mountain gazelle optimizer (IMGO) based on the newly proposed mountain gazelle optimizer (MGO) and design a binary version of IMGO (BIMGO) to solve the feature selection problem for medical data. First, the gazelle population is initialized using iterative chaotic map with infinite collapses (ICMIC) mapping, which increases the diversity of the population. Second, a nonlinear control factor is introduced to balance the exploration and exploitation components of the algorithm. Individuals in the population are perturbed using a spiral perturbation mechanism to enhance the local search capability of the algorithm. Finally, a neighborhood search strategy is used for the optimal individuals to enhance the exploitation and convergence capabilities of the algorithm. The superior ability of the IMGO algorithm to solve continuous problems is demonstrated on 23 benchmark datasets. Then, BIMGO is evaluated on 16 medical datasets of different dimensions and compared with 8 well-known metaheuristic algorithms. The experimental results indicate that BIMGO outperforms the competing algorithms in terms of the fitness value, number of selected features and sensitivity. In addition, the statistical results of the experiments demonstrate the significantly superior ability of BIMGO to select the most effective features in medical datasets.