Tan Wang

Tan Wang

Auto-generated profile, based on publicly available information

Tan Wang

Space Technology (Jilin) Limited Company, Jilin, China

Research Focus & Metrics

Academic Career Length

17Years (2010-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.

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.

1 September 2010
Verified
Conference Paper
Closed access
LLLisha Ling
Lisha Ling
TWTan Wang
Tan Wang
YWYing Wang
Ying Wang
CSCong Shi
Cong Shi
This paper studies the power allocation (PA) and distributed antenna (DA) selection in the downlink orthogonal frequency division multiplexing distributed antenna systems (OFDM-DAS). Two schemes are analyzed, with the objective of maximizing the downlink received signal power. In the first scheme, the DA selection is based on large-scale fading only and the related PA is simple. It is proved that at most three DA ports are enough for the transmission. In the later scheme, the DA selection is based on both large-scale and small-scale fading, and an optimal power partition result to the utilized DA ports is shown for each individual subcarrier. Then a novel resource allocation problem with suboptimal objective is formulated, which is modified to an integer program for complete solution. Finally, the advantages of the two schemes are combined and a suboptimal algorithm is proposed. Simulation compares various transmission strategies of OFDM-DAS and the proposed algorithm shows promising performance.

26 January 2021 in IEEE Access
Verified
Journal Article
Open access
TYTaiqiao Yin
Taiqiao Yin
YLYing Li
Ying Li
JFJiahao Fan
Jiahao Fan
TWTan Wang
Tan Wang
YSYunxia Shi
Yunxia Shi
The behavior decision-making algorithm plays an important role in ensuring the safe driving of autonomous vehicles. However, existing behavior decision-making methods lack the capability to cope with future motion uncertainty in traffic, because the historical state of vehicles are not considered. This article proposes a novel driving behavior decision-making method EnMFO-ImGRU based on Gated Recurrent Unit (GRU) and Moth-Flame Optimization algorithm (MFO). Four improvements are proposed in EnMFO-ImGRU. First, to consider the driving information of the vehicles on the road, ImGRU is designed based on a double-layer GRU. Second, to promote decisions accuracy, Support Vector Machine (SVM), which has good performance in classification problems, replaces the softmax classifier to train the output of the ImGRU. Third, to promote the classification capability of SVM, MFO is introduced to optimize the key parameters that affect the performance of SVM. Finally, to promote the optimization capability of MFO, we propose the Enhanced Moth-Flame Optimization algorithm (EnMFO). A new position updating method is proposed in EnMFO. The experimental results on the NGSIM dataset show that EnMFO-ImGRU brings higher accuracy than existing methods for the behavior decision-making results of autonomous vehicles.