Xiaozhu Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xiaozhu Wu has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Chongcheng Chen
The Academy of Digital China, Fuzhou University, Fuzhou 350108, China
4 shared publications Binjie Li
College of Computer and Data Science (College of Software), College of Artificial Intelligence, Fuzhou University, Fuzhou, China
1 shared publication- Dan Li
College of The Academy of Digital China, Fuzhou University, Fuzhou 350003, China
1 shared publication - Fuxun Chen
College of The Academy of Digital China, Fuzhou University, Fuzhou 350003, China
1 shared publication - Hong Jiang
Key Laboratory of Spatial Data Mining & Information Sharing, Ministry of Education, Fuzhou University, Fuzhou 350002, China
1 shared publication - Honghong Dong
College of The Academy of Digital China, Fuzhou University, Fuzhou 350003, China
1 shared publication
Latest Publications
- Open Access
- 23 April 2026
- Published by Springer Nature in Intelligent Marine Technology and Systems
- Vol. 4 (1) , 13
CA-PPO: a cross-attention PPO-based task allocation algorithm for single-USV debris collection
With increasing severity of water pollution, intelligent cleaning technologies based on unmanned systems have attracted widespread attention. To address the dynamic characteristics of floating debris on water surfaces, such as random movement and easy outflow, existing reinforcement learning methods face several challenges in practical scheduling tasks, including the inadequate prediction of future states, the weak prioritization of critical targets, and the insufficient consideration of resource constraints. This paper proposes cross-attention-proximal policy optimization (CA-PPO), a task allocation algorithm for a single unmanned surface vehicle (USV), based on the proximal policy optimization (PPO) algorithm. The proposed algorithm constructed a cleaning task environment that incorporated a flow prediction mechanism for floating debris by considering the battery and load limitations of the USV. A cross-attention module enhanced the policy network’s perception of key debris targets. The experimental results demonstrated that the proposed CA-PPO method outperformed traditional heuristic approaches and other reinforcement learning algorithms in terms of debris collection rate, outflow rate, energy efficiency, and movement distance efficiency.
- 23 April 2026
- Published by Springer Nature in Intelligent Marine Technology and Systems
- Vol. 4 (1) , 13
Open AccessCA-PPO: a cross-attention PPO-based task allocation algorithm for single-USV debris collection
With increasing severity of water pollution, intelligent cleaning technologies based on unmanned systems have attracted widespread attention. To address the dynamic characteristics of floating debris on water surfaces, such as random movement and easy outflow, existing reinforcement learning methods face several challenges in practical scheduling tasks, including the inadequate prediction of future states, the weak prioritization of critical targets, and the insufficient consideration of resource constraints. This paper proposes cross-attention-proximal policy optimization (CA-PPO), a task allocation algorithm for a single unmanned surface vehicle (USV), based on the proximal policy optimization (PPO) algorithm. The proposed algorithm constructed a cleaning task environment that incorporated a flow prediction mechanism for floating debris by considering the battery and load limitations of the USV. A cross-attention module enhanced the policy network’s perception of key debris targets. The experimental results demonstrated that the proposed CA-PPO method outperformed traditional heuristic approaches and other reinforcement learning algorithms in terms of debris collection rate, outflow rate, energy efficiency, and movement distance efficiency.
- Open Access
- 8 July 2023
- Published by MDPI AG in Sustainability
- Vol. 15 (14) , 10751
Soft-NMS-Enabled YOLOv5 with SIOU for Small Water Surface Floater Detection in UAV-Captured Images
In recent years, the protection and management of water environments have garnered heightened attention due to their critical importance. Detection of small objects in unmanned aerial vehicle (UAV) images remains a persistent challenge due to the limited pixel values and interference from background noise. To address this challenge, this paper proposes an integrated object detection approach that utilizes an improved YOLOv5 model for real-time detection of small water surface floaters. The proposed improved YOLOv5 model effectively detects small objects by better integrating shallow and deep features and addressing the issue of missed detections and, therefore, aligns with the characteristics of the water surface floater dataset. Our proposed model has demonstrated significant improvements in detecting small water surface floaters when compared to previous studies. Specifically, the average precision (AP), recall (R), and frames per second (FPS) of our model achieved 86.3%, 79.4%, and 92%, respectively. Furthermore, when compared to the original YOLOv5 model, our model exhibits a notable increase in both AP and R, with improvements of 5% and 6.1%, respectively. As such, the proposed improved YOLOv5 model is well-suited for the real-time detection of small objects on the water’s surface. Therefore, this method will be essential for large-scale, high-precision, and intelligent water surface floater monitoring.
- 8 July 2023
- Published by MDPI AG in Sustainability
- Vol. 15 (14) , 10751
Open AccessSoft-NMS-Enabled YOLOv5 with SIOU for Small Water Surface Floater Detection in UAV-Captured Images
In recent years, the protection and management of water environments have garnered heightened attention due to their critical importance. Detection of small objects in unmanned aerial vehicle (UAV) images remains a persistent challenge due to the limited pixel values and interference from background noise. To address this challenge, this paper proposes an integrated object detection approach that utilizes an improved YOLOv5 model for real-time detection of small water surface floaters. The proposed improved YOLOv5 model effectively detects small objects by better integrating shallow and deep features and addressing the issue of missed detections and, therefore, aligns with the characteristics of the water surface floater dataset. Our proposed model has demonstrated significant improvements in detecting small water surface floaters when compared to previous studies. Specifically, the average precision (AP), recall (R), and frames per second (FPS) of our model achieved 86.3%, 79.4%, and 92%, respectively. Furthermore, when compared to the original YOLOv5 model, our model exhibits a notable increase in both AP and R, with improvements of 5% and 6.1%, respectively. As such, the proposed improved YOLOv5 model is well-suited for the real-time detection of small objects on the water’s surface. Therefore, this method will be essential for large-scale, high-precision, and intelligent water surface floater monitoring.
- Open Access
- 17 March 2022
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 11 (3) , 203
A Fine-Grain Batching-Based Task Allocation Algorithm for Spatial Crowdsourcing
Task allocation is a critical issue of spatial crowdsourcing. Although the batching strategy performs better than the real-time matching mode, it still has the following two drawbacks: (1) Because the granularity of the batch size set obtained by batching is too coarse, it will result in poor matching accuracy. However, roughly designing the batch size for all possible delays will result in a large computational overhead. (2) Ignoring non-stationary factors will lead to a change in optimal batch size that cannot be found as soon as possible. Therefore, this paper proposes a fine-grained, batching-based task allocation algorithm (FGBTA), considering non-stationary setting. In the batch method, the algorithm first uses variable step size to allow for fine-grained exploration within the predicted value given by the multi-armed bandit (MAB) algorithm and uses the results of pseudo-matching to calculate the batch utility. Then, the batch size with higher utility is selected, and the exact maximum weight matching algorithm is used to obtain the allocation result within the batch. In order to cope with the non-stationary changes, we use the sliding window (SW) method to retain the latest batch utility and discard the historical information that is too far away, so as to finally achieve refined batching and adapt to temporal changes. In addition, we also take into account the benefits of requesters, workers, and the platform. Experiments on real data and synthetic data show that this method can accomplish the task assignment of spatial crowdsourcing effectively and can adapt to the non-stationary setting as soon as possible. This paper mainly focuses on the spatial crowdsourcing task of ride-hailing.
- 17 March 2022
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 11 (3) , 203
Open AccessA Fine-Grain Batching-Based Task Allocation Algorithm for Spatial Crowdsourcing
Task allocation is a critical issue of spatial crowdsourcing. Although the batching strategy performs better than the real-time matching mode, it still has the following two drawbacks: (1) Because the granularity of the batch size set obtained by batching is too coarse, it will result in poor matching accuracy. However, roughly designing the batch size for all possible delays will result in a large computational overhead. (2) Ignoring non-stationary factors will lead to a change in optimal batch size that cannot be found as soon as possible. Therefore, this paper proposes a fine-grained, batching-based task allocation algorithm (FGBTA), considering non-stationary setting. In the batch method, the algorithm first uses variable step size to allow for fine-grained exploration within the predicted value given by the multi-armed bandit (MAB) algorithm and uses the results of pseudo-matching to calculate the batch utility. Then, the batch size with higher utility is selected, and the exact maximum weight matching algorithm is used to obtain the allocation result within the batch. In order to cope with the non-stationary changes, we use the sliding window (SW) method to retain the latest batch utility and discard the historical information that is too far away, so as to finally achieve refined batching and adapt to temporal changes. In addition, we also take into account the benefits of requesters, workers, and the platform. Experiments on real data and synthetic data show that this method can accomplish the task assignment of spatial crowdsourcing effectively and can adapt to the non-stationary setting as soon as possible. This paper mainly focuses on the spatial crowdsourcing task of ride-hailing.
- 31 March 2021
- Published by Korean Society for Internet Information (KSII) in KSII Transactions on Internet and Information Systems
- Vol. 15 (3) , 891-910
A Dynamic QoS Adjustment Enabled and Load-balancing-aware Service Composition Method for Multiple Requests
KSII Transactions on Internet and Information Systems TIIS Paper Details
- 31 March 2021
- Published by Korean Society for Internet Information (KSII) in KSII Transactions on Internet and Information Systems
- Vol. 15 (3) , 891-910
A Dynamic QoS Adjustment Enabled and Load-balancing-aware Service Composition Method for Multiple Requests
KSII Transactions on Internet and Information Systems TIIS Paper Details
- 11 August 2019
- Published by Springer Nature in Earth Science Informatics
- Vol. 12 (4) , 641-658
ACO-DPDGW: an ant colony optimization algorithm for data placement of data-intensive geospatial workflow
- 11 August 2019
- Published by Springer Nature in Earth Science Informatics
- Vol. 12 (4) , 641-658
ACO-DPDGW: an ant colony optimization algorithm for data placement of data-intensive geospatial workflow
- Open Access
- 13 July 2017
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 6 (7) , 217
SCMDOT: Spatial Clustering with Multiple Density-Ordered Trees
With the rapid explosion of information based on location, spatial clustering plays an increasingly significant role in this day and age as an important technique in geographical data analysis. Most existing spatial clustering algorithms are limited by complicated spatial patterns, which have difficulty in discovering clusters with arbitrary shapes and uneven density. In order to overcome such limitations, we propose a novel clustering method called Spatial Clustering with Multiple Density-Ordered Trees (SCMDOT). Motivated by the idea of the Density-Ordered Tree (DOT), we firstly represent the original dataset by the means of constructing Multiple Density-Ordered Trees (MDOT). In the constructing process, we impose additional constraints to control the growth of each Density-Ordered Tree, ensuring that they all have high spatial similarity. Furthermore, a series of MDOT can be successively generated from regions of sparse areas to the dense areas, where each Density-Ordered Tree, also treated as a sub-tree, represents a cluster. In the merging process, the final clusters are obtained by repeatedly merging a suitable pair of clusters until they satisfy the expected clustering result. In addition, a heuristic strategy is applied during the process of our algorithm for suitability for special applications. The experiments on synthetic and real-world spatial databases are utilised to demonstrate the performance of our proposed method.
- 13 July 2017
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 6 (7) , 217
Open AccessSCMDOT: Spatial Clustering with Multiple Density-Ordered Trees
With the rapid explosion of information based on location, spatial clustering plays an increasingly significant role in this day and age as an important technique in geographical data analysis. Most existing spatial clustering algorithms are limited by complicated spatial patterns, which have difficulty in discovering clusters with arbitrary shapes and uneven density. In order to overcome such limitations, we propose a novel clustering method called Spatial Clustering with Multiple Density-Ordered Trees (SCMDOT). Motivated by the idea of the Density-Ordered Tree (DOT), we firstly represent the original dataset by the means of constructing Multiple Density-Ordered Trees (MDOT). In the constructing process, we impose additional constraints to control the growth of each Density-Ordered Tree, ensuring that they all have high spatial similarity. Furthermore, a series of MDOT can be successively generated from regions of sparse areas to the dense areas, where each Density-Ordered Tree, also treated as a sub-tree, represents a cluster. In the merging process, the final clusters are obtained by repeatedly merging a suitable pair of clusters until they satisfy the expected clustering result. In addition, a heuristic strategy is applied during the process of our algorithm for suitability for special applications. The experiments on synthetic and real-world spatial databases are utilised to demonstrate the performance of our proposed method.
- Open Access
- 30 June 2016
- Published by NADIA in International Journal of Grid and Distributed Computing
- Vol. 9 (6) , 103-116
A Data Volume Aware Ant Colony Optimization Approach for Geographical Knowledge Cloud Service Composition
- 30 June 2016
- Published by NADIA in International Journal of Grid and Distributed Computing
- Vol. 9 (6) , 103-116
Open AccessA Data Volume Aware Ant Colony Optimization Approach for Geographical Knowledge Cloud Service Composition
- 8 March 2015
- Published by Springer Nature in Journal of Grid Computing
- Vol. 13 (2) , 139-157
Parallel and Distributed Spatial Outlier Mining in Grid: Algorithm, Design and Application
- 8 March 2015
- Published by Springer Nature in Journal of Grid Computing
- Vol. 13 (2) , 139-157
Parallel and Distributed Spatial Outlier Mining in Grid: Algorithm, Design and Application