Xiaoqing Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xiaoqing Li has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Ji Wang
National university of defense technology, Changsha, China
4 shared publications - Weidong Bao
College of Systems Engineering, National University of Defense Technology, Changsha 410073, China
4 shared publications - Hui Yan
Information Support Force Engineering University, Wuhan, China
3 shared publications - Yanjie Song
School of Information Science and Technology Dalian Maritime University Dalian China
3 shared publications - Zhenxing Xu
National university of defense technology, Changsha, China
2 shared publications - Hailu Xin
College of Systems Engineering, National University of Defense Technology, Changsha 410073, China
1 shared publication
Latest Publications
- Open Access
Recoverability-Aware Fault-Tolerant Scheduling of UAVs for IoT Data Collection in Disaster Scenarios
Reliable data collection is essential for disaster-oriented Internet of Things (IoT) systems, where damaged terrestrial communication infrastructure often leaves sensed data buffered at disconnected end devices. In Unmanned Aerial Vehicle (UAV)-Internet of Things device (IoTD) collaborative data collection, random UAV faults and limited energy and buffer resources further complicate mission execution, making fault-tolerant scheduling crucial for robust data recovery. To address these issues, a unified framework is developed by integrating dynamic UAV reliability modeling, Maximum Distance Separable (MDS)-coded fault-tolerant backup, and collaborative scheduling optimization. Within this framework, a data fault-tolerance mechanism, termed MFTB, and a bilevel collaborative scheduling algorithm, termed LP-DCFS, are proposed. Simulation results indicate that, in the evaluated scenarios, the proposed methods achieve better overall performance than the considered baselines. In a representative high-load, high-failure scenario, MFTB reduces data loss by 4.8% and 37.5% compared with Buffer-Limited Retransmission (BLR) and Replication, respectively, while LP-DCFS increases the amount of recovered data by 33.9%, 32.3%, and 53.1% compared with ACEPSO, ADE-DMRM, and DQN, respectively. Under the modeled independent random crash and non-return faults and the evaluated simulation settings, these results suggest that coordinating failure-risk characterization, data-protection mechanisms, and task-scheduling strategies can improve the robustness and data-recovery capability of disaster-oriented UAV-assisted data collection.
Open AccessRecoverability-Aware Fault-Tolerant Scheduling of UAVs for IoT Data Collection in Disaster Scenarios
Reliable data collection is essential for disaster-oriented Internet of Things (IoT) systems, where damaged terrestrial communication infrastructure often leaves sensed data buffered at disconnected end devices. In Unmanned Aerial Vehicle (UAV)-Internet of Things device (IoTD) collaborative data collection, random UAV faults and limited energy and buffer resources further complicate mission execution, making fault-tolerant scheduling crucial for robust data recovery. To address these issues, a unified framework is developed by integrating dynamic UAV reliability modeling, Maximum Distance Separable (MDS)-coded fault-tolerant backup, and collaborative scheduling optimization. Within this framework, a data fault-tolerance mechanism, termed MFTB, and a bilevel collaborative scheduling algorithm, termed LP-DCFS, are proposed. Simulation results indicate that, in the evaluated scenarios, the proposed methods achieve better overall performance than the considered baselines. In a representative high-load, high-failure scenario, MFTB reduces data loss by 4.8% and 37.5% compared with Buffer-Limited Retransmission (BLR) and Replication, respectively, while LP-DCFS increases the amount of recovered data by 33.9%, 32.3%, and 53.1% compared with ACEPSO, ADE-DMRM, and DQN, respectively. Under the modeled independent random crash and non-return faults and the evaluated simulation settings, these results suggest that coordinating failure-risk characterization, data-protection mechanisms, and task-scheduling strategies can improve the robustness and data-recovery capability of disaster-oriented UAV-assisted data collection.
- Open Access
- 2 April 2026
- Published by Elsevier in SSRN Electronic Journal
Asymmetric Cooperative Game-Based Trajectory Planning for Multi-UAV Collaborative Area Search
Multi-UAV cooperative area search is crucial for efficient and robust large-scale reconnaissance, yet existing methods struggle to balance computational efficiency with path optimality—heuristic and reinforcement learning approaches are computationally expensive or require extensive training, while rule-based methods lack adaptability. This paper proposes an asymmetric cooperative game-theoretic method to address this challenge. The approach begins by partitioning the task area via constrained clustering and constructing a cooperative game network based on subregion adjacency. A target deviation-based coalition formation mechanism dynamically identifies subregions needing optimization and establishes binary coalitions. Within each coalition, UAVs iteratively exchange boundary grid points, using trajectory length mean and variance as payoffs to achieve Pareto improvements. Experiments on real geographical regions, comparing against 7 representative algorithms belonging to 4 categories, show that the proposed method consistently generates trajectories with shorter total length, lower variance, and higher coverage efficiency at reduced computational cost for both 5- and 10-UAV scenarios. It also demonstrates strong robustness to initial partitioning, confirming its adaptability.
- 2 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessAsymmetric Cooperative Game-Based Trajectory Planning for Multi-UAV Collaborative Area Search
Multi-UAV cooperative area search is crucial for efficient and robust large-scale reconnaissance, yet existing methods struggle to balance computational efficiency with path optimality—heuristic and reinforcement learning approaches are computationally expensive or require extensive training, while rule-based methods lack adaptability. This paper proposes an asymmetric cooperative game-theoretic method to address this challenge. The approach begins by partitioning the task area via constrained clustering and constructing a cooperative game network based on subregion adjacency. A target deviation-based coalition formation mechanism dynamically identifies subregions needing optimization and establishes binary coalitions. Within each coalition, UAVs iteratively exchange boundary grid points, using trajectory length mean and variance as payoffs to achieve Pareto improvements. Experiments on real geographical regions, comparing against 7 representative algorithms belonging to 4 categories, show that the proposed method consistently generates trajectories with shorter total length, lower variance, and higher coverage efficiency at reduced computational cost for both 5- and 10-UAV scenarios. It also demonstrates strong robustness to initial partitioning, confirming its adaptability.
- 20 November 2025
- Published by Elsevier in Future Generation Computer Systems
- Vol. 177
Dynamic demand-aware UAV scheduling for IoT data collection using deep reinforcement learning approach
- 20 November 2025
- Published by Elsevier in Future Generation Computer Systems
- Vol. 177
Dynamic demand-aware UAV scheduling for IoT data collection using deep reinforcement learning approach
- Open Access
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 431-434
Hypernetwork-Based Multi-Objective Optimization with NSGA-II
Multi-objective optimization algorithms have a wide range of applications in various fields. NSGA-II (Non-dominated Sorting Genetic Algorithm II) is a well-known multi-objective optimization algorithm. However, when solving high-dimensional problems using NSGA-II, the algorithm complexity increases linearly with the problem dimension. To address this issue, this paper proposes the HNSGA-II (Hypernetwork Non-dominated Sorting Genetic Algorithm II) algorithm based on hypernetwork modeling. The HNSGA-II algorithm introduces a binary tree data structure and uses hypernetworks to model candidate solutions. A new crowding calculation is designed to improve the algorithm's convergence. Horizontal and vertical comparative experiments were conducted on standard test sets ZDT and BT using the newly proposed algorithm, NSGA-II, MOEAD, and other algorithms. The results demonstrate that the HNSGA-II algorithm achieves a maximum improvement of about 10% in time efficiency when solving high-dimensional problems and exhibits better algorithmic convergence than the original NSGA-II algorithm.
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 431-434
Open AccessHypernetwork-Based Multi-Objective Optimization with NSGA-II
Multi-objective optimization algorithms have a wide range of applications in various fields. NSGA-II (Non-dominated Sorting Genetic Algorithm II) is a well-known multi-objective optimization algorithm. However, when solving high-dimensional problems using NSGA-II, the algorithm complexity increases linearly with the problem dimension. To address this issue, this paper proposes the HNSGA-II (Hypernetwork Non-dominated Sorting Genetic Algorithm II) algorithm based on hypernetwork modeling. The HNSGA-II algorithm introduces a binary tree data structure and uses hypernetworks to model candidate solutions. A new crowding calculation is designed to improve the algorithm's convergence. Horizontal and vertical comparative experiments were conducted on standard test sets ZDT and BT using the newly proposed algorithm, NSGA-II, MOEAD, and other algorithms. The results demonstrate that the HNSGA-II algorithm achieves a maximum improvement of about 10% in time efficiency when solving high-dimensional problems and exhibits better algorithmic convergence than the original NSGA-II algorithm.