Zuqiong Zhang

Zuqiong Zhang

Auto-generated profile, based on publicly available information

Zuqiong Zhang

Network and Information Center, Guilin University of Technology, Guilin, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
11 June 2021 in Symmetry
Verified
Journal Article
Open access
PDF file
LZLieping Zhang
Lieping Zhang
LTLiu Tang
Liu Tang
SZShenglan Zhang
Shenglan Zhang
ZWZhengzhong Wang
Zhengzhong Wang
XSXianhao Shen
Xianhao Shen
ZZZuqiong Zhang
Zuqiong Zhang
Directing at various problems of the traditional Q-Learning algorithm, such as heavy repetition and disequilibrium of explorations, the reinforcement-exploration strategy was used to replace the decayed ε-greedy strategy in the traditional Q-Learning algorithm, and thus a novel self-adaptive reinforcement-exploration Q-Learning (SARE-Q) algorithm was proposed. First, the concept of behavior utility trace was introduced in the proposed algorithm, and the probability for each action to be chosen was adjusted according to the behavior utility trace, so as to improve the efficiency of exploration. Second, the attenuation process of exploration factor ε was designed into two phases, where the first phase centered on the exploration and the second one transited the focus from the exploration into utilization, and the exploration rate was dynamically adjusted according to the success rate. Finally, by establishing a list of state access times, the exploration factor of the current state is adaptively adjusted according to the number of times the state is accessed. The symmetric grid map environment was established via OpenAI Gym platform to carry out the symmetrical simulation experiments on the Q-Learning algorithm, self-adaptive Q-Learning (SA-Q) algorithm and SARE-Q algorithm. The experimental results show that the proposed algorithm has obvious advantages over the first two algorithms in the average number of turning times, average inside success rate, and number of times with the shortest planned route.

6 July 2022 in Electronics
Verified
Journal Article
Open access
PDF file
XZXin Zhang
Xin Zhang
XSXiaoxu Shi
Xiaoxu Shi
ZZZuqiong Zhang
Zuqiong Zhang
ZWZhengzhong Wang
Zhengzhong Wang
LZLieping Zhang
Lieping Zhang
Constrained by the numbers of action space and state space, Q-learning cannot be applied to continuous state space. Targeting this problem, the double deep Q network (DDQN) algorithm and the corresponding improvement methods were explored. First of all, to improve the accuracy of the DDNQ algorithm in estimating the target Q value in the training process, a multi-step guided strategy was introduced into the traditional DDQN algorithm, for which the single-step reward was replaced with the reward obtained in continuous multi-step interactions of mobile robots. Furthermore, an experience classification training method was introduced into the traditional DDQN algorithm, for which the state transition generated by the mobile robot–environment interaction was divided into two different types of experience pools, and experience pools were trained by the Q network, and the sampling proportions of the two experience pools were updated through the training loss. Afterward, the advantages of a multi-step guided DDQN (MS-DDQN) algorithm and experience classification DDQN (EC-DDQN) algorithm were combined to develop a novel experience classification multi-step DDQN (ECMS-DDQN) algorithm. Finally, the path planning of these four algorithms, including DDQN, MS-DDQN, EC-DDQN, and ECMS-DDQN, was simulated on the OpenAI Gym platform. The simulation results revealed that the ECMS-DDQN algorithm outperforms the other three in the total return value and generalization in path planning.

17 June 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
JWJunkang Wu
Junkang Wu
ZZZuqiong Zhang
Zuqiong Zhang
SZShenglan Zhang
Shenglan Zhang
ZKZhenwu Kuang
Zhenwu Kuang
LZLieping Zhang
Lieping Zhang
To reduce the influence of non-line-of-sight (NLOS) errors in the ultra-wideband (UWB) positioning process, a UWB positioning algorithm based on fuzzy inference and adaptive anti-NLOS Kalman filtering (KF) was proposed in this paper. First of all, the NLOS errors of the channel impulse response (CIR) signal characteristics were estimated by the fuzzy inference algorithm and then initially mitigated. Next, an adaptive anti-NLOS KF algorithm was developed to perform a second mitigation on the ranging errors after mitigation of the NLOS errors with the fuzzy inference, thereby further raising the range estimation accuracy. At last, the range estimation information after error mitigation was taken as the ranging information of the LS positioning algorithm for target localization. In the static positioning experiment, the probability of producing an error range of less than 19.1 cm with the positioning algorithm combining fuzzy inference with adaptive anti-NLOS KF was 0.93, which was much better than the positioning algorithm based on fuzzy inference and the adaptive anti-NLOS KF positioning algorithm. In the dynamic positioning experiment, compared with the adaptive anti-NLOS KF positioning algorithm, the RMSE was reduced by 43.31% in the overall positioning. Furthermore, compared with those of the positioning algorithm based on fuzzy inference, the RMSEs in overall positioning were lowered by 12.89%. The positioning accuracy was improved significantly.

20 June 2022 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
ZLZhihao Li
Zhihao Li
JWJunkang Wu
Junkang Wu
ZKZhenwu Kuang
Zhenwu Kuang
ZZZuqiong Zhang
Zuqiong Zhang
SZShenglan Zhang
Shenglan Zhang
LZLieping Zhang
Lieping Zhang
In this paper, a moving target tracking (MTT) algorithm based on the improved resampling particle filter (IRPF) was put forward for the reduced accuracy of particle filter (PF) due to the lack of particle diversity resulting from traditional resampling methods. In this algorithm, the influences of the likelihood probability distribution of particles on the PF accuracy were firstly analyzed to stratify the adaptive regions of particles, and a particle diversity measurement index based on stratification was proposed. After that, a threshold was set for the particle diversity after resampling. If the particle diversity failed to reach the set threshold, all new particles would be subjected to a Gaussian random walk in a preset variance matrix to improve the particle diversity. Finally, the performance of related algorithms was tested in both simulation environment and actual indoor ultrawideband (UWB) nonline-of-sight (NLOS) environment. The experimental results revealed that the nonlinear target state estimation accuracy was maximally and minimally improved by 12.83% and 1.97%, respectively, in the simulation environment, and the root mean square error (RMSE) of MTT was reduced from 17.131 cm to 10.471 cm in actual UWB NLOS environment, indicating that the IRPF algorithm can enhance the target estimation accuracy and state tracking capability, manifesting better filter performance.

18 July 2022 in International Journal of Distributed Sensor Networks
Verified
Journal Article
Open access
LZLieping Zhang
Lieping Zhang
HPHuihao Peng
Huihao Peng
JHJiajie He
Jiajie He
SZShenglan Zhang
Shenglan Zhang
ZZZuqiong Zhang
Zuqiong Zhang
Node localization is one of the key technologies in the wireless sensor network research field, which is crucial to the high-accuracy localization of mobile nodes, but the positioning error of traditional algorithms such as received signal strength indicator and angle of arrival is more than 4 m, which has almost no practical value. For example, the localization accuracy of the localization algorithm based on received signal strength indicator will be reduced sharply when affected by signal reflection, multipath propagation, and other interference factors. To solve the problem, a three-dimensional localization algorithm of mobile nodes was proposed in this article based on received signal strength indicator–angle of arrival and least-squares support-vector regression, which fused the ranging information of received signal strength indicator algorithm and the angle of arrival algorithm and optimized the estimated distance of unknown nodes. Next, the mobile node model and least-squares support-vector regression modeling mechanism were built according to the hop count of the shortest distance between nodes. Finally, the unknown mobile nodes were localized based on least-squares support-vector regression modeling. The experimental results showed that compared with the localization algorithms without optimized ranging information or least-squares support-vector regression modeling, the algorithm proposed in this study exhibited significantly improved stability, a reduced mean localization error by more than 50%, and increased localization accuracy.

4 September 2021 in Journal of Electrical and Computer Engineering
Verified
Journal Article
Open access
PDF file
LZLieping Zhang
Lieping Zhang
JNJinghua Nie
Jinghua Nie
SZShenglan Zhang
Shenglan Zhang
YYYanlin Yu
Yanlin Yu
YLYong Liang
Yong Liang
ZZZuqiong Zhang
Zuqiong Zhang
Given that the tracking accuracy and real-time performance of the particle filter (PF) target tracking algorithm are greatly affected by the number of sampled particles, a PF target tracking algorithm based on particle number optimization under the single-station environment was proposed in this study. First, a single-station target tracking model was established, and the corresponding PF algorithm was designed. Next, a tracking simulation experiment was carried out on the PF target tracking algorithm under different numbers of particles with the root mean square error (RMSE) and filtering time as the evaluation indexes. On this basis, the optimal number of particles, which could meet the accuracy and real-time performance requirements, was determined and taken as the number of particles of the proposed algorithm. The MATLAB simulation results revealed that compared with the unscented Kalman filter (UKF), the single-station PF target tracking algorithm based on particle number optimization not only was of high tracking accuracy but also could meet the real-time performance requirement.