Xin Tang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xin Tang has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Xiaohuan Li
Guilin University of Electronic Technology
7 shared publications - Qian Chen
School of Architecture and Transportation Engineering, Guilin University of Electronic Technology, Guilin, China
5 shared publications Binhan Liao
Guangxi University Key Laboratory of Intelligent Networking and Scenario System (School of Information and Communication, Guilin University of Electronic Technology (GUET)), Guilin, China
2 shared publications- Dusit Niyato
Nanyang Technological University
2 shared publications - Jiacheng Wang
Nanyang Technological University
2 shared publications - Jin Ye
School of Computer and Electronic Information, Guangxi University, Nanning, China
2 shared publications
Latest Publications
- 10 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 1356-1368
Meta-Computing Enhanced Federated Learning in IIoT: Satisfaction-Aware Incentive Scheme via DRL-Based Stackelberg Game
The Industrial Internet of Things (IIoT) leverages Federated Learning (FL) for distributed model training while preserving data privacy, and meta-computing enhances FL by optimizing and integrating distributed computing resources, improving efficiency and scalability. Efficient IIoT operations require a trade-off between model quality and training latency. Consequently, a primary challenge of FL in IIoT is to optimize overall system performance by balancing model quality and training latency. This paper designs a satisfaction function that accounts for data size, Age of Information (AoI), and training latency for meta-computing. Additionally, the satisfaction function is incorporated into the utility function to incentivize IIoT nodes to participate in model training. We model the utility functions of servers and nodes as a two-stage Stackelberg game and employ a deep reinforcement learning approach to learn the Stackelberg equilibrium. This approach ensures balanced rewards and enhances the applicability of the incentive scheme for IIoT. Simulation results demonstrate that, under the same budget constraints, the proposed incentive scheme improves utility by at least 23.7% compared to existing FL schemes without compromising model accuracy.
- 10 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 1356-1368
Meta-Computing Enhanced Federated Learning in IIoT: Satisfaction-Aware Incentive Scheme via DRL-Based Stackelberg Game
The Industrial Internet of Things (IIoT) leverages Federated Learning (FL) for distributed model training while preserving data privacy, and meta-computing enhances FL by optimizing and integrating distributed computing resources, improving efficiency and scalability. Efficient IIoT operations require a trade-off between model quality and training latency. Consequently, a primary challenge of FL in IIoT is to optimize overall system performance by balancing model quality and training latency. This paper designs a satisfaction function that accounts for data size, Age of Information (AoI), and training latency for meta-computing. Additionally, the satisfaction function is incorporated into the utility function to incentivize IIoT nodes to participate in model training. We model the utility functions of servers and nodes as a two-stage Stackelberg game and employ a deep reinforcement learning approach to learn the Stackelberg equilibrium. This approach ensures balanced rewards and enhances the applicability of the incentive scheme for IIoT. Simulation results demonstrate that, under the same budget constraints, the proposed incentive scheme improves utility by at least 23.7% compared to existing FL schemes without compromising model accuracy.
- Top Cited Papers
- 31 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (1) , 627-643
Task Assignment and Exploration Optimization for Low Altitude UAV Rescue via Generative AI Enhanced Multi-Agent Reinforcement Learning
The integration of emerging uncrewed aerial vehicle (UAV) with artificial intelligence (AI) and ground-embedded robots (GERs) has transformed emergency rescue operations in unknown environments. However, the high computational demands of such missions often exceed the capacity of a single UAV, making it difficult for the system to continuously and stably provide high-level services. To address these challenges, this paper proposes a novel cooperation framework involving UAVs, GERs, and airships. This framework enables resource pooling through UAV-to-GER (U2G) and UAV-to-airship (U2A) communications, providing computing services for UAV offloaded tasks. Specifically, we formulate the multi-objective optimization problem of task assignment and exploration optimization in UAVs as a dynamic long-term optimization problem. Our objective is to minimize task completion time and energy consumption while ensuring system stability over time. To achieve this, we first employ the Lyapunov optimization method to transform the original problem, with stability constraints, into a per-slot deterministic problem. We then propose an algorithm named HG-MADDPG, which combines the Hungarian algorithm with a generative diffusion model (GDM)-based multi-agent deep deterministic policy gradient (MADDPG) approach, to jointly optimize exploration and task assignment decisions. In HG-MADDPG, we first introduce the Hungarian algorithm as a method for exploration area selection, enhancing UAV efficiency in interacting with the environment. We then innovatively integrate the GDM and multi-agent deep deterministic policy gradient (MADDPG) to optimize task assignment decisions, such as task offloading and resource allocation. Simulation results demonstrate the effectiveness of the proposed approach, with significant improvements in task offloading efficiency, latency reduction, and system stability compared to baseline methods.
- 31 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (1) , 627-643
Top Cited PapersTask Assignment and Exploration Optimization for Low Altitude UAV Rescue via Generative AI Enhanced Multi-Agent Reinforcement Learning
The integration of emerging uncrewed aerial vehicle (UAV) with artificial intelligence (AI) and ground-embedded robots (GERs) has transformed emergency rescue operations in unknown environments. However, the high computational demands of such missions often exceed the capacity of a single UAV, making it difficult for the system to continuously and stably provide high-level services. To address these challenges, this paper proposes a novel cooperation framework involving UAVs, GERs, and airships. This framework enables resource pooling through UAV-to-GER (U2G) and UAV-to-airship (U2A) communications, providing computing services for UAV offloaded tasks. Specifically, we formulate the multi-objective optimization problem of task assignment and exploration optimization in UAVs as a dynamic long-term optimization problem. Our objective is to minimize task completion time and energy consumption while ensuring system stability over time. To achieve this, we first employ the Lyapunov optimization method to transform the original problem, with stability constraints, into a per-slot deterministic problem. We then propose an algorithm named HG-MADDPG, which combines the Hungarian algorithm with a generative diffusion model (GDM)-based multi-agent deep deterministic policy gradient (MADDPG) approach, to jointly optimize exploration and task assignment decisions. In HG-MADDPG, we first introduce the Hungarian algorithm as a method for exploration area selection, enhancing UAV efficiency in interacting with the environment. We then innovatively integrate the GDM and multi-agent deep deterministic policy gradient (MADDPG) to optimize task assignment decisions, such as task offloading and resource allocation. Simulation results demonstrate the effectiveness of the proposed approach, with significant improvements in task offloading efficiency, latency reduction, and system stability compared to baseline methods.
- Open Access
- 13 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (10) , 13340-13352
DNN Task Assignment in UAV Networks: A Generative AI Enhanced Multiagent Reinforcement Learning Approach
uncrewed aerial vehicles (UAVs) offer high mobility and flexible deployment capabilities, making them ideal for Internet of Things (IoT) applications. However, the substantial amount of data generated by various applications within the existing low-altitude network requires processing through deep neural networks (DNN) on UAVs, which is challenging due to their limited computational resources. To address this issue, we propose a two-stage optimization method for flight path planning and task allocation based on a mother-child UAV swarm system. In the first stage, we employ a greedy algorithm to solve the path planning problem by considering the task size of the target area to be inspected and the shortest flight path as constraints. The goal is to minimize both the flight path of the UAV and the overall cost of the system. In the second stage, we introduce a novel DNN task assignment algorithm that combines multiagent deep deterministic policy gradient (MADDPG) and generative diffusion models (GDMs), named GDM-MADDPG. This algorithm takes advantage of the reverse denoising process of GDM to replace the actor network in MADDPG. It enables UAVs to generate specific DNN task assignment actions based on agents’ observations in a dynamic environment, thereby improving the efficiency of task assignment and overall system performance. The simulation results demonstrate that our algorithm outperforms the benchmarks in terms of path planning, Age of Information (AoI), task completion rate, and system utility, demonstrating its effectiveness.
- 13 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (10) , 13340-13352
Open AccessDNN Task Assignment in UAV Networks: A Generative AI Enhanced Multiagent Reinforcement Learning Approach
uncrewed aerial vehicles (UAVs) offer high mobility and flexible deployment capabilities, making them ideal for Internet of Things (IoT) applications. However, the substantial amount of data generated by various applications within the existing low-altitude network requires processing through deep neural networks (DNN) on UAVs, which is challenging due to their limited computational resources. To address this issue, we propose a two-stage optimization method for flight path planning and task allocation based on a mother-child UAV swarm system. In the first stage, we employ a greedy algorithm to solve the path planning problem by considering the task size of the target area to be inspected and the shortest flight path as constraints. The goal is to minimize both the flight path of the UAV and the overall cost of the system. In the second stage, we introduce a novel DNN task assignment algorithm that combines multiagent deep deterministic policy gradient (MADDPG) and generative diffusion models (GDMs), named GDM-MADDPG. This algorithm takes advantage of the reverse denoising process of GDM to replace the actor network in MADDPG. It enables UAVs to generate specific DNN task assignment actions based on agents’ observations in a dynamic environment, thereby improving the efficiency of task assignment and overall system performance. The simulation results demonstrate that our algorithm outperforms the benchmarks in terms of path planning, Age of Information (AoI), task completion rate, and system utility, demonstrating its effectiveness.
- Open Access
- 17 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 12 (1) , 13-27
Digital Twin-Empowered Task Assignment in Aerial MEC Network: A Resource Coalition Cooperation Approach With Generative Model
To meet the demands for ubiquitous communication and temporary edge computing in 6G networks, aerial mobile edge computing (MEC) networks have been envisioned as a new paradigm. However, dynamic user requests pose challenges for task assignment strategies. Most of the existing research assumes that the strategy is deployed on ground-based stations or UAVs, which will be ineffective in an environment lacking infrastructure and continuous energy supply. Moreover, the resource mutual exclusion problem of dynamic task assignment has not been effectively solved. Toward this end, we introduce the digital twin (DT) into the aerial MEC network to study the resource coalition cooperation approach with the generative model (GM), which provides a preliminary coalition structure for the coalition game. Specifically, we propose a novel network framework that is composed of an application plane, a physical plane, and a virtual plane. After that, the task assignment problem is simplified to convex optimization programming with linear constraints. And then, we also propose a resource coalition cooperation approach that is based on a transferable utility (TU) coalition game to obtain an approximate optimal solution. Extensive analysis and numerical results confirm the effectiveness of our proposed approach in terms of energy consumption and utilization of resources.
- 17 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 12 (1) , 13-27
Open AccessDigital Twin-Empowered Task Assignment in Aerial MEC Network: A Resource Coalition Cooperation Approach With Generative Model
To meet the demands for ubiquitous communication and temporary edge computing in 6G networks, aerial mobile edge computing (MEC) networks have been envisioned as a new paradigm. However, dynamic user requests pose challenges for task assignment strategies. Most of the existing research assumes that the strategy is deployed on ground-based stations or UAVs, which will be ineffective in an environment lacking infrastructure and continuous energy supply. Moreover, the resource mutual exclusion problem of dynamic task assignment has not been effectively solved. Toward this end, we introduce the digital twin (DT) into the aerial MEC network to study the resource coalition cooperation approach with the generative model (GM), which provides a preliminary coalition structure for the coalition game. Specifically, we propose a novel network framework that is composed of an application plane, a physical plane, and a virtual plane. After that, the task assignment problem is simplified to convex optimization programming with linear constraints. And then, we also propose a resource coalition cooperation approach that is based on a transferable utility (TU) coalition game to obtain an approximate optimal solution. Extensive analysis and numerical results confirm the effectiveness of our proposed approach in terms of energy consumption and utilization of resources.
- Open Access
- 27 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-7
A Landslide Displacement Prediction Method Based on Convolutional Neural Networks_Bidirectional Long Short-Term Memory and Extreme Gradient Boosting
To address the limitations of traditional single deep learning network models in landslide displacement prediction, this paper proposes a combined prediction model based on Convolutional Neural Networks (CNN)_Bidirectional Long Short-Term Memory (BiLSTM)-Extreme Gradient Boosting (XGB). In this paper, the Sparrow Search Algorithm (SSA)- Variational Mode Decomposition (VMD) method is used to decompose the landslide displacement series into periodic, random, and trend components. Appropriate influencing factors are selected as input variables based on Grey Relation Analysis (GRA) Using ensemble learning method, the CNN_BiLSTM-XGB combination model is constructed to predict the periodic and random components. The trend component is fitted by double exponential smoothing method. Finally, the cumulative landslide predicted displacement is obtained by time series theory. The model is evaluated by Root Mean Square Error (RMSE), Mean Absolute Error (MAE), Coefficient of Determination (R2), and is validated by the Baishuihe landslide, the performance is compared with CNN-Long Short-Term Memory (LSTM), Gated Recurrent Unit (GRU), and Support Vector Machine (SVM) models. The experimental prediction results demonstrate that the CNN_BiLSTM-XGB combination model has higher prediction accuracy. This paper provides new insights and exploration for landslide displacement prediction.
- 27 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessA Landslide Displacement Prediction Method Based on Convolutional Neural Networks_Bidirectional Long Short-Term Memory and Extreme Gradient Boosting
To address the limitations of traditional single deep learning network models in landslide displacement prediction, this paper proposes a combined prediction model based on Convolutional Neural Networks (CNN)_Bidirectional Long Short-Term Memory (BiLSTM)-Extreme Gradient Boosting (XGB). In this paper, the Sparrow Search Algorithm (SSA)- Variational Mode Decomposition (VMD) method is used to decompose the landslide displacement series into periodic, random, and trend components. Appropriate influencing factors are selected as input variables based on Grey Relation Analysis (GRA) Using ensemble learning method, the CNN_BiLSTM-XGB combination model is constructed to predict the periodic and random components. The trend component is fitted by double exponential smoothing method. Finally, the cumulative landslide predicted displacement is obtained by time series theory. The model is evaluated by Root Mean Square Error (RMSE), Mean Absolute Error (MAE), Coefficient of Determination (R2), and is validated by the Baishuihe landslide, the performance is compared with CNN-Long Short-Term Memory (LSTM), Gated Recurrent Unit (GRU), and Support Vector Machine (SVM) models. The experimental prediction results demonstrate that the CNN_BiLSTM-XGB combination model has higher prediction accuracy. This paper provides new insights and exploration for landslide displacement prediction.
- 28 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (4) , 3522-3535
Adaptive Bitrate Algorithms via Deep Reinforcement Learning With Digital Twins Assisted Trajectory
Adaptive bitrate (ABR) algorithms based on deep reinforcement learning (RL) can continuously improve their adaptability to network conditions. Existing methods usually adopt a reward function to train the ABR policies. However, in some network conditions, the quality of experience (QoE) performances obtained from the deterministic reward functions are not consistent with the users' perception. In this paper, we propose a novel learning-based deep reward model from video trajectory preference data to obtain a dynamic reward function that better reflects users' preference of the video stream. To augment the training data with more precise aggregation in a quick way, we leverage the digital twin (DT) technology to map the users' trajectory into virtual space. The digital twin can mimic users' video trajectory preferences which is used to train a reward model that can precisely predict QoE. Integrated with this reward model, the RL algorithm can generate an ABR policy that optimizes the user-perceived QoE. Experiment results show that the accuracy of the proposed reward model outperforms state-of-the-art reward functions by 13.6% in preference prediction. Compared with other RL-based ABR policies, our RL-based trajectory-preferred ABR algorithm can increase the average user QoE by 16.4%.
- 28 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (4) , 3522-3535
Adaptive Bitrate Algorithms via Deep Reinforcement Learning With Digital Twins Assisted Trajectory
Adaptive bitrate (ABR) algorithms based on deep reinforcement learning (RL) can continuously improve their adaptability to network conditions. Existing methods usually adopt a reward function to train the ABR policies. However, in some network conditions, the quality of experience (QoE) performances obtained from the deterministic reward functions are not consistent with the users' perception. In this paper, we propose a novel learning-based deep reward model from video trajectory preference data to obtain a dynamic reward function that better reflects users' preference of the video stream. To augment the training data with more precise aggregation in a quick way, we leverage the digital twin (DT) technology to map the users' trajectory into virtual space. The digital twin can mimic users' video trajectory preferences which is used to train a reward model that can precisely predict QoE. Integrated with this reward model, the RL algorithm can generate an ABR policy that optimizes the user-perceived QoE. Experiment results show that the accuracy of the proposed reward model outperforms state-of-the-art reward functions by 13.6% in preference prediction. Compared with other RL-based ABR policies, our RL-based trajectory-preferred ABR algorithm can increase the average user QoE by 16.4%.
- Open Access
- 31 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (17) , 15362-15375
Digital-Twin-Assisted Task Assignment in Multi-UAV Systems: A Deep Reinforcement Learning Approach
Most existing multi-unmanned aerial vehicle (multi-UAV) systems focus on fly path or energy consumption for task assignment, while little attention has been paid to the dynamic feature of the task, resulting in poor task completion ratio. The machine learning (ML) paradigm provides new methodologies for task assignment. However, ML methods are usually of heavy resource-consumption that cannot be directly applied in the UAV. In this paper, a digital twin (DT) assisted task assignment approach is proposed to improve the resource-intensive utilization and the efficiency of deep reinforcement learning (DRL) in multi-UAV system. The approach has a three-layer network structure which can dynamically assign tasks based on the task time constraints. Moreover, the approach is divided into two stages of initial task-assignment and task-reassignment. In the first stage, airship divides a task into multiple subtasks according to the shortest distance based on genetic algorithm and assigns them to UAVs. In the second stage, the DT can be leveraged to enable the airships to learn from the features of tasks and to generate the Q-value of the estimated value network of DRL for UAVs via pre-train of DT. The Q-value can be directly applied for deep Q-learning network (DQN) in the UAVs to reduce the training episode. Furthermore, the DQN is adopted to train task-reassignment strategy. Simulation results indicate that the DQN with DT can significantly reduce the training episode, improving 30% of the task completion ratio and 19% of the system energy efficiency compared with that of the baseline methods.
- 31 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (17) , 15362-15375
Open AccessDigital-Twin-Assisted Task Assignment in Multi-UAV Systems: A Deep Reinforcement Learning Approach
Most existing multi-unmanned aerial vehicle (multi-UAV) systems focus on fly path or energy consumption for task assignment, while little attention has been paid to the dynamic feature of the task, resulting in poor task completion ratio. The machine learning (ML) paradigm provides new methodologies for task assignment. However, ML methods are usually of heavy resource-consumption that cannot be directly applied in the UAV. In this paper, a digital twin (DT) assisted task assignment approach is proposed to improve the resource-intensive utilization and the efficiency of deep reinforcement learning (DRL) in multi-UAV system. The approach has a three-layer network structure which can dynamically assign tasks based on the task time constraints. Moreover, the approach is divided into two stages of initial task-assignment and task-reassignment. In the first stage, airship divides a task into multiple subtasks according to the shortest distance based on genetic algorithm and assigns them to UAVs. In the second stage, the DT can be leveraged to enable the airships to learn from the features of tasks and to generate the Q-value of the estimated value network of DRL for UAVs via pre-train of DT. The Q-value can be directly applied for deep Q-learning network (DQN) in the UAVs to reduce the training episode. Furthermore, the DQN is adopted to train task-reassignment strategy. Simulation results indicate that the DQN with DT can significantly reduce the training episode, improving 30% of the task completion ratio and 19% of the system energy efficiency compared with that of the baseline methods.