Qian Chen

Qian Chen

Auto-generated profile, based on publicly available information

Qian Chen

School of Architecture and Transportation Engineering, Guilin University of Electronic Technology, Guilin, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
31 July 2025 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
XTXin Tang
Xin Tang
QCQian Chen
Qian Chen
WWWenjie Weng
Wenjie Weng
CJChao Jin
Chao Jin
ZHANG LIUZHANG LIU
ZHANG LIU
DNDusit Niyato
Dusit Niyato
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.

13 February 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Open access
XTXin Tang
Xin Tang
QCQian Chen
Qian Chen
WWWenjie Weng
Wenjie Weng
BLBinhan Liao
Binhan Liao
WANG JIACHENGWANG JIACHENG
WANG JIACHENG
Xiaohuan LiXiaohuan Li
Xiaohuan Li
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.

17 October 2024 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Open access
XTXin Tang
Xin Tang
QCQian Chen
Qian Chen
RYRong Yu
Rong Yu
Xiaohuan LiXiaohuan Li
Xiaohuan Li
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.

1 January 2026 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
XTXin Tang
Xin Tang
Xiaohuan LiXiaohuan Li
Xiaohuan Li
QCQian Chen
Qian Chen
BLBinhan Liao
Binhan Liao
YZYaqi Zhang
Yaqi Zhang
JTJunxi Tian
Junxi Tian

27 September 2024
Verified
Conference Paper
Open access
CGChangbiao Gu C Gu
Changbiao Gu C Gu
SZShengyuan Zhou S Zhou
Shengyuan Zhou S Zhou
QCQian Chen Q Chen
Qian Chen Q Chen
RYRongbin Yao R Yao
Rongbin Yao R Yao
XTXin Tang X Tang
Xin Tang X Tang
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.

8 June 2022 in Electronics
Verified
Journal Article
Open access
PDF file
QCQian Chen
Qian Chen
XTXin Tang
Xin Tang
ZSZhaoyu Su
Zhaoyu Su
Xiaohuan LiXiaohuan Li
Xiaohuan Li
DWDuiwu Wang
Duiwu Wang
Ensuring that a vehicle can obtain its real location in a high-precision prebuilt map is one of the most important tasks of the Autonomous Internet of Vehicles (AIoV). In this work, we show that the resampling of the particle filter (PF) algorithm is optimized by using the prior information of particles that shift real localizations to improve vehicle localization accuracy without changing the existing PF process, i.e., the particle shift filter (PSF). The number of particles is critical to their convergence efficiency. We perform quantitative and qualitative analyses of how to improve particle localization accuracy while ensuring timeliness, without increasing the number of particles. Moreover, the cumulative error of the particles increases with time, and the localization accuracy and robustness decrease. Our findings show that the initial particle density is 159 particles/m3, and the cumulative variance of the PSF particles is improved by 27%, 29%, and 82% at the x-, y-, and z-axes, respectively, under the same conditions as the PF algorithm, while the calculation time only increases by 10.6%. Moreover, the cumulative mean error is reduced by 0.74 m, 0.88 m, and 0.68 m at the x-, y-, and z-axes, respectively, indicating that the localization error of the PSF changes less with time. All experiments were performed using open-source software and datasets.