Xin Yuan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xin Yuan has a total of 45 co-authors. Here are the top co-authors by number of shared publications:
- Lu Dong
School of Cyber Science and Engineering, Southeast University, Nanjing, China
14 shared publications - Changyin Sun
Southeast University, Nanjing, China
12 shared publications - Yuanda Wang
School of Automation, Southeast University, Nanjing, China
4 shared publications - Jingyu Liu
School of Automation, Southeast University, Nanjing, China
3 shared publications - Yongbao Wu
Southeast University
3 shared publications Buwei Tian
School of Cyber Science and Engineering, Southeast University, Nanjing, Jiangsu, China
2 shared publications
Latest Publications
- 9 November 2026
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 20 (17) , 775
HGSQ: heatmap-guided sparse query detector for real-time aerial small object detection
- 9 November 2026
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 20 (17) , 775
HGSQ: heatmap-guided sparse query detector for real-time aerial small object detection
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72 (4) , 10956-10973
Multi-Agent Reinforcement Learning With User Diversion Mechanism for Dynamic Pricing in Electric Vehicle Charging
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72 (4) , 10956-10973
Multi-Agent Reinforcement Learning With User Diversion Mechanism for Dynamic Pricing in Electric Vehicle Charging
- Open Access
- 11 September 2026
- Published by Springer Nature in Journal of Intelligent & Robotic Systems
Feedback-Enhanced Closed-loop Decision Making for Autonomous Driving with Large Language Models
- 11 September 2026
- Published by Springer Nature in Journal of Intelligent & Robotic Systems
Open AccessFeedback-Enhanced Closed-loop Decision Making for Autonomous Driving with Large Language Models
- 1 August 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (8) , 9843-9850
M3imic: Learning a Versatile Whole-Body Controller for Multimodal Motion Mimicking
- 1 August 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (8) , 9843-9850
M3imic: Learning a Versatile Whole-Body Controller for Multimodal Motion Mimicking
- 28 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (6) , 10223-10236
Reinforcement Learning-Based Dynamic Beam Hopping and Power Allocation for RSMA-Assisted Constrained-Input Satellite System
This paper investigates a dynamic beam hopping and power allocation problem in rate-splitting multiple access (RSMA) assisted multi-beam satellite system, in which beam services are allocated for terrestrial cells with non-uniform traffic demands and spectrum resource is full-frequency reused among beams for serving multiple ground terminals through RSMA technique. The objective is to jointly optimize beam hopping and power allocation strategy for maximizing the long-term sum rate while simultaneously satisfying delay fairness demand. However, the interference caused by full frequency reuse among beams limits the efficacy of RSMA, and the frequent beam patterns changes make instantaneous channel state information (CSI) detection a challenge. To address these challenges, this paper designs a novel deep reinforcement learning (DRL) based resource allocation framework for discrete-continuous action spaces. To alleviate explosion of action space, each beam is treated as a DRL agent, and a multi-agent deep reinforcement learning method is proposed to learn the beam scheduling policy. In addition, an action mapping mechanism is employed to further manage the DRL power allocation for satisfying the power input constraint arising from limited satellite power budget. Simulation results demonstrate that the proposed method can achieve the highest sum rate of the system while ensuring fairness among non-uniform traffic load cells compared with several baseline methods.
- 28 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (6) , 10223-10236
Reinforcement Learning-Based Dynamic Beam Hopping and Power Allocation for RSMA-Assisted Constrained-Input Satellite System
This paper investigates a dynamic beam hopping and power allocation problem in rate-splitting multiple access (RSMA) assisted multi-beam satellite system, in which beam services are allocated for terrestrial cells with non-uniform traffic demands and spectrum resource is full-frequency reused among beams for serving multiple ground terminals through RSMA technique. The objective is to jointly optimize beam hopping and power allocation strategy for maximizing the long-term sum rate while simultaneously satisfying delay fairness demand. However, the interference caused by full frequency reuse among beams limits the efficacy of RSMA, and the frequent beam patterns changes make instantaneous channel state information (CSI) detection a challenge. To address these challenges, this paper designs a novel deep reinforcement learning (DRL) based resource allocation framework for discrete-continuous action spaces. To alleviate explosion of action space, each beam is treated as a DRL agent, and a multi-agent deep reinforcement learning method is proposed to learn the beam scheduling policy. In addition, an action mapping mechanism is employed to further manage the DRL power allocation for satisfying the power input constraint arising from limited satellite power budget. Simulation results demonstrate that the proposed method can achieve the highest sum rate of the system while ensuring fairness among non-uniform traffic load cells compared with several baseline methods.
- 17 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (3) , 4898-4910
DAOMAN: Decentralized Adaptive Computation Offloading and Multi-Agent Navigation for Satellite-Ground-Network Robots
Robots usually appear in the form of robot swarms when they execute complex tasks. Given cost constraints that lead to insufficient computational capabilities in robots, they can offload computation-intensive tasks to mobile edge computing (MEC) servers via satellite-ground network, substantially improving their efficiency in real-world task execution. However, robots' mobility causes their positions relative to MEC servers to change continuously, resulting in dynamically evolving computing offloading environments. To address this issue, this paper aims to ensure the efficiency of multiple robots jointly completing a complex real-world task and at the same time minimize the average completion time of the robot's computing task. We consider a scenario in which multiple robots move to multiple target locations, where the destination of each robot is not assigned in advance. The robots need to move to one of the target locations individually, and at the same time, their own computing tasks can be offloaded to base stations or satellites around them. We conceptualize this problem as a multi-objective optimization framework, which is decoupled into two components: movement control and computation offloading, and propose the DAOMAN algorithm. Simulation results show that the proposed method minimizes the time for robots to reach their respective targets while also reducing the completion time of their computation tasks.
- 17 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (3) , 4898-4910
DAOMAN: Decentralized Adaptive Computation Offloading and Multi-Agent Navigation for Satellite-Ground-Network Robots
Robots usually appear in the form of robot swarms when they execute complex tasks. Given cost constraints that lead to insufficient computational capabilities in robots, they can offload computation-intensive tasks to mobile edge computing (MEC) servers via satellite-ground network, substantially improving their efficiency in real-world task execution. However, robots' mobility causes their positions relative to MEC servers to change continuously, resulting in dynamically evolving computing offloading environments. To address this issue, this paper aims to ensure the efficiency of multiple robots jointly completing a complex real-world task and at the same time minimize the average completion time of the robot's computing task. We consider a scenario in which multiple robots move to multiple target locations, where the destination of each robot is not assigned in advance. The robots need to move to one of the target locations individually, and at the same time, their own computing tasks can be offloaded to base stations or satellites around them. We conceptualize this problem as a multi-objective optimization framework, which is decoupled into two components: movement control and computation offloading, and propose the DAOMAN algorithm. Simulation results show that the proposed method minimizes the time for robots to reach their respective targets while also reducing the completion time of their computation tasks.
- 13 September 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 298
GSFF-SLAM: 3D semantic Gaussian splatting SLAM via feature field
- 13 September 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 298
GSFF-SLAM: 3D semantic Gaussian splatting SLAM via feature field
- 10 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (18) , 39077-39087
Optimal DoS Attack Energy Allocation in Cyber–Physical Systems Based on Deep Reinforcement Learning
The security of wireless cyber–physical systems (CPSs) faces significant challenges from channel congestion attacks, which disrupt data transmission and threaten system stability. Existing research on attack energy allocation primarily focuses on single-sensor, single-channel scenarios or assumes discrete energy distribution, limiting the development of optimal strategies. To address this, we model the remote state estimation problem in wireless CPSs as a Markov decision process (MDP) and propose an action mapping mechanism (AM). Based on these, we propose two reinforcement learning algorithms to address the continuous attack energy allocation problem in multisensor, multichannel environments. The first algorithm, genetic algorithm-driven model-based action mapping algorithm (GA-MB-AM), is a model-based reinforcement learning approach that uses a genetic algorithm for network initialization. The second algorithm is soft actor–critic-based action mapping algorithm (SAC-AM), which improves performance in dynamic environments, such as systems with energy harvesting. Simulations demonstrate the superiority of our approach over traditional methods.
- 10 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (18) , 39077-39087
Optimal DoS Attack Energy Allocation in Cyber–Physical Systems Based on Deep Reinforcement Learning
The security of wireless cyber–physical systems (CPSs) faces significant challenges from channel congestion attacks, which disrupt data transmission and threaten system stability. Existing research on attack energy allocation primarily focuses on single-sensor, single-channel scenarios or assumes discrete energy distribution, limiting the development of optimal strategies. To address this, we model the remote state estimation problem in wireless CPSs as a Markov decision process (MDP) and propose an action mapping mechanism (AM). Based on these, we propose two reinforcement learning algorithms to address the continuous attack energy allocation problem in multisensor, multichannel environments. The first algorithm, genetic algorithm-driven model-based action mapping algorithm (GA-MB-AM), is a model-based reinforcement learning approach that uses a genetic algorithm for network initialization. The second algorithm is soft actor–critic-based action mapping algorithm (SAC-AM), which improves performance in dynamic environments, such as systems with energy harvesting. Simulations demonstrate the superiority of our approach over traditional methods.
- Open Access
Safe Reinforcement Learning for Competitive Autonomous Racing: Integrated State–Action Mapping and Exploration Guidance Framework
Autonomous race driving has emerged as a challenging domain for reinforcement learning (RL) applications, requiring high-speed control while adhering to strict safety constraints. Existing RL-based racing methods often struggle to balance performance and safety, with limited adaptability in dynamic racing scenarios with multiple opponent vehicles. The high-dimensional state space and strict safety constraints pose significant challenges for efficient learning. To address these challenges, this paper proposes an integrated RL framework that combines three novel components: (1) a state mapping mechanism that dynamically transforms raw track observations into a consistent representation space; (2) an action mapping technique that rigorously enforces physical traction constraints; and (3) a safe exploration guidance method that combines conservative controllers with RL policies, significantly reducing off-track incidents during training. Extensive experiments conducted in our simulation environment with four test tracks demonstrate the effectiveness of our approach. In time trial scenarios, our method improves lap times by 12–26% and increases the training completion rate from 33.1% to 78.7%. In competitive racing, it achieves a 46–51% higher average speed compared to baseline methods. These results validate the framework’s ability to achieve both high performance and safety in autonomous racing tasks.
Open AccessSafe Reinforcement Learning for Competitive Autonomous Racing: Integrated State–Action Mapping and Exploration Guidance Framework
Autonomous race driving has emerged as a challenging domain for reinforcement learning (RL) applications, requiring high-speed control while adhering to strict safety constraints. Existing RL-based racing methods often struggle to balance performance and safety, with limited adaptability in dynamic racing scenarios with multiple opponent vehicles. The high-dimensional state space and strict safety constraints pose significant challenges for efficient learning. To address these challenges, this paper proposes an integrated RL framework that combines three novel components: (1) a state mapping mechanism that dynamically transforms raw track observations into a consistent representation space; (2) an action mapping technique that rigorously enforces physical traction constraints; and (3) a safe exploration guidance method that combines conservative controllers with RL policies, significantly reducing off-track incidents during training. Extensive experiments conducted in our simulation environment with four test tracks demonstrate the effectiveness of our approach. In time trial scenarios, our method improves lap times by 12–26% and increases the training completion rate from 33.1% to 78.7%. In competitive racing, it achieves a 46–51% higher average speed compared to baseline methods. These results validate the framework’s ability to achieve both high performance and safety in autonomous racing tasks.
- 13 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/CAA Journal of Automatica Sinica
- Vol. 12 (6) , 1283-1285
Reinforcement Learning-Based Spectral Performance Optimization for UAV-Assisted MIMO Communication System
Dear Editor, This letter is concerned with the problem of stable high-quality signal transmission of unmanned aerial vehicle (UAV)-assisted multiple-input multiple-output (MIMO) communication system. The particle swarm optimization (PSO) algorithm is used to achieve optimal beamforming and power allocation for this system. Additionally, sensitive particle (SP) and parameter adaptive adjustment are introduced into the traditional PSO algorithm, aiming to improve the performance of the PSO algorithm in dynamic environments with real-time changes in the UAV position. A reinforcement learning (RL)-based approach is proposed to obtain optimal UAV trajectory and adaptive adjustment strategy for PSO parameters, which combine with a specific obstacle avoidance scheme to achieve accurate UAV navigation while satisfying high-quality signal transmission. Simulation experiments show that our scheme provides higher and more stable spectral efficiency as well as more efficient UAV navigation than the currently commonly used scheme with a single RL approach.
- 13 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/CAA Journal of Automatica Sinica
- Vol. 12 (6) , 1283-1285
Reinforcement Learning-Based Spectral Performance Optimization for UAV-Assisted MIMO Communication System
Dear Editor, This letter is concerned with the problem of stable high-quality signal transmission of unmanned aerial vehicle (UAV)-assisted multiple-input multiple-output (MIMO) communication system. The particle swarm optimization (PSO) algorithm is used to achieve optimal beamforming and power allocation for this system. Additionally, sensitive particle (SP) and parameter adaptive adjustment are introduced into the traditional PSO algorithm, aiming to improve the performance of the PSO algorithm in dynamic environments with real-time changes in the UAV position. A reinforcement learning (RL)-based approach is proposed to obtain optimal UAV trajectory and adaptive adjustment strategy for PSO parameters, which combine with a specific obstacle avoidance scheme to achieve accurate UAV navigation while satisfying high-quality signal transmission. Simulation experiments show that our scheme provides higher and more stable spectral efficiency as well as more efficient UAV navigation than the currently commonly used scheme with a single RL approach.