WANG Dongxing

Prof. Dr. WANG Dongxing

orcid

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
6 October 2019 in Sensors
Verified
Journal Article
Open access
PDF file
WDWANG Dongxing
WANG Dongxing
HWHuibo WANG
Huibo WANG
Xiaojuan BanXiaojuan Ban
Xiaojuan Ban
XQXu QIAN
Xu QIAN
JNJingxiu NI
Jingxiu NI
Recently, many related algorithms have been proposed to find an efficient wireless sensor network with good sustainability, a stable connection, and a high covering rate. To further improve the coverage rate of movable wireless sensor networks under the condition of guaranteed connectivity, this paper proposes an adaptive, discrete space oriented wolf pack optimization algorithm for a movable wireless sensor network (DSO-WPOA). Firstly, a strategy of adaptive expansion based on a minimum overlapping full-coverage model is designed to achieve minimum overlap and no-gap coverage for the monitoring area. Moreover, the adaptive shrinking grid search wolf pack optimization algorithm (ASGS-CWOA) is improved to optimize the movable wireless sensor network, which is a discrete space oriented problem. This improvement includes the usage of a target–node probability matrix and the design of an adaptive step size method, both of which work together to enhance the convergence speed and global optimization ability of the algorithm. Theoretical research and experimental results indicate that compared with the coverage algorithm based on particle swarm optimization (PSO-WSN) and classical virtual force algorithm, the newly proposed algorithm possesses the best coverage rate, better stability, acceptable performance in terms of time, advantages in energy savings, and no gaps.

28 October 2018 in IEEE Access
Verified
Journal Article
Open access
WDWANG Dongxing
WANG Dongxing
XQXu Qian
Xu Qian
KLKang Liu
Kang Liu
XBXiaojuan Ban
Xiaojuan Ban
XGXinyu Guan
Xinyu Guan
On the premise of guaranteeing the accuracy of the solution, to reduce the time spent for optimization by an existing algorithm named adaptive shrinking grid search chaos wolf optimization algorithm (ASGS-CWOA), an adaptive distribution size (ADS) wolf pack optimization algorithm using the strategy of jumping for raid (for short: WDX-WPOA) was proposed. First, the strategy of jumping for raid is proposed to improve the performance in raiding process by airlifting directly half of wolves to be around the leader wolf that can accelerate the convergence of the existing wolf pack algorithm; Moreover, an ADS was used to distribute the half of wolves to specific locations according to its rules, so as to enhance the probability of finding the optical value. Under the same condition, the results of numerical experiments demonstrate that WDX-WPOA possesses preferable optimization ability including best global search accuracy, better robustness, and fast convergence speed compared with classical genetic algorithm, particle swarm optimization algorithm, LWPS and CWOA; especially, WDX-WPOA has better performance in time than ASGS-CWOA with the prerequisite of the same solution quality.

25 April 2022 in Symmetry
Verified
Journal Article
Open access
PDF file
WDWANG Dongxing
WANG Dongxing
JNJingxiu NI
Jingxiu NI
TDTingyu Du
Tingyu Du
To improve the recognition accuracy of coal gangue images with the back propagation (BP) neural network, a coal gangue image recognition method based on BP neural network and ASGS-CWOA (ASGS-CWOA-BP) was proposed, which makes two key contributions. Firstly, a new feature extraction method for the unique features of coal and gangue images is proposed, known as “Encircle–City Feature”. Additionally, a method that applied ASGS-CWOA to optimize the parameters of the BP neural network was introduced to address to the issue of its low accuracy in coal gangue image recognition, and a BP neural network with a simple structure and reduced computational consumption was designed. The experimental results showed that the proposed method outperformed the other six comparison methods, with recognition of 95.47% and 94.37% in the training set and the test set, respectively, showing good symmetry.

8 July 2019 in IEEE Access
Verified
Journal Article
Open access
WDWANG Dongxing
WANG Dongxing
XQXu QIAN
Xu QIAN
Xiaojuan BanXiaojuan Ban
Xiaojuan Ban
BMBoyuan Ma
Boyuan Ma
YMYan Ma
Yan Ma
ZLZiyi Lv
Ziyi Lv
Since the bacterial foraging optimization algorithm (BFO) was proposed, many variants about it have been designed in order to improve the performance and applied in different fields. Even so, people are constantly probing new methods designed to enhance the performance of BFO, so as to form new variants with superior performance. As a new variant of original BFO, bacterial foraging optimization using strategies of progressive exploitation approximating local optimum and adaptive raid (BFO-DX) was proposed. On the one hand, the strategy of progressive exploration approximating local optimum (PELO) was introduced into BFO to enhance its ability of exploitation in a local space, which enables the algorithm to find the global optima better possibly. On the other hand, the strategy of adaptive raid for leader (ARL) was adopted to boost the speed of convergence by strengthening its exploration capacity. The numerical experiments indicates that BFO-DX possesses better ability of finding global optima, better stability and other acceptable terms such as iteration and running time compared with classical genetic algorithm(GA), particle swarm algorithm(PSO) and conventional bacterial foraging optimization(BFO).

29 March 2022 in Energy Reports
Verified
Journal Article
Open access
TDTingyu Du
Tingyu Du
WDWANG Dongxing
WANG Dongxing
XQXu QIAN
Xu QIAN

29 January 2025 in Symmetry
Verified
Journal Article
Open access
PDF file
WDWANG Dongxing
WANG Dongxing
MZMeijing ZHANG
Meijing ZHANG
ZHZhiyang Huang
Zhiyang Huang
Multi-UAV path planning for police patrols plays an important role in public security work, and while many path-planning algorithms have been applied in this area, all of them possess various degrees of shortcomings. To further improve the accuracy and efficiency of multi-UAV path planning for police patrols, this paper proposes a multi-UAV police patrol path-planning method based on an improved wolf pack optimization algorithm using the strategies of Composite Directional Raid and Dynamic Random Search (PMU-3PM-IWPA). Firstly, a multi-UAV police patrol path-planning model was constructed to reflect the planning problem for multi-UAV police patrol paths (PMU-3PM). Moreover, to enhance the performance of the existing wolf pack optimization algorithm, this paper proposes an improved wolf pack optimization algorithm (for short CDR-DRS-WPOA), including the Composite-Directional Raid Strategy (CDRS), aimed at enhancing global exploration capability, as well as the Dynamic Random Search Strategy (DRSS), with a view to speeding up the convergence for simple problems and heightening the optimization accuracy for difficult problems. Finally, the improved wolf pack optimization algorithm was adopted to solve the issue of multi-UAV path planning for police patrols, and numerical experiments were carried out on 20 public classical datasets as well as PMU-3PM compared with GA, PSO, WDX-WPOA, and DAF-BRS-CWOA. The results indicate that CDR-DRS-WPOA took 20~80% less time and possessed more optimization accuracy, and that PMU-3PM-IWPA based on CDR-DRS-WPOA offers excellent performance.