Chenxi Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Chenxi Li has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Qingquan Lin
Department of Automation, Tsinghua University, Beijing, China
3 shared publications - Bin Liang
Tsinghua University
2 shared publications - Litong Meng
Department of Automation, Tsinghua University, Beijing, China
2 shared publications - Weining Lu
Beijing National Research Center for Information Science and Technology, Tsinghua University, Beijing, China
2 shared publications Bin Liang
1 shared publicationHaolu Li
School of Mechanical and Electrical Engineering, Beijing Information Science and Technology University, Beijing, China
1 shared publication
Latest Publications
- 16 December 2025
- Published by Elsevier in Neurocomputing
- Vol. 668
Enhancing multi-robot collaborative path planning via perception fusion in unknown environments
- 16 December 2025
- Published by Elsevier in Neurocomputing
- Vol. 668
Enhancing multi-robot collaborative path planning via perception fusion in unknown environments
- 29 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 20702-20712
Nav-SCOPE: Swarm Robot Cooperative Perception and Coordinated Navigation
This paper proposes a lightweight decentralized solution for multi-robot coordinated navigation with cooperative perception. First, we introduce a rapid way to process sensory data, thus obtaining safe directions and key environmental features. Then, an information flow is created to facilitate real-time perception sharing over wireless ad-hoc networks. Consequently, the environmental uncertainties of each robot are reduced by interaction fields that deliver complementary information. Finally, path optimization is achieved in a probabilistic way, enabling self-organized coordination with effective convergence, divergence, and collision avoidance. Our method is fully interpretable and ready for deployment without gaps. Comprehensive simulations and real-world experiments demonstrate reduced path redundancy, robust performance across various tasks, and minimal demands on computation and communication.
- 29 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 20702-20712
Nav-SCOPE: Swarm Robot Cooperative Perception and Coordinated Navigation
This paper proposes a lightweight decentralized solution for multi-robot coordinated navigation with cooperative perception. First, we introduce a rapid way to process sensory data, thus obtaining safe directions and key environmental features. Then, an information flow is created to facilitate real-time perception sharing over wireless ad-hoc networks. Consequently, the environmental uncertainties of each robot are reduced by interaction fields that deliver complementary information. Finally, path optimization is achieved in a probabilistic way, enabling self-organized coordination with effective convergence, divergence, and collision avoidance. Our method is fully interpretable and ready for deployment without gaps. Comprehensive simulations and real-world experiments demonstrate reduced path redundancy, robust performance across various tasks, and minimal demands on computation and communication.
- 19 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 72 (12) , 13617-13626
Collaborative Navigation of Multiple Autonomous Mobile Robots via Geometric Graph Neural Network
Multiple mobile robots play a crucial role in spatially distributed tasks. In unknown and nonrepetitive scenarios, reconstructing a global map is time-consuming and often unnecessary. Hence, research has focused on real-time collaborative planning without relying on a global map. This article introduces a novel multirobot collaborative path planning method based on geometric graph neural network (MRPP-GeoGNN). With all robots connected via local communication devices, the features of neighboring robot’s sensory data are transmitted to the ego-robot for reference. The GeoGNN layers acquire local surrounding features by integrating these sensory features with positional embeddings. We use a geometric function to project positional information into a high-dimensional space, which ensures the rotation invariance of different nodes in a relative coordinate system. An action mapper finally maps the integrated feature to multiple forward directions to guide the robot’s movement. Simulation results demonstrate an approximate 5% improvement in accuracy on expert datasets compared to convolutional neural network (CNN), along with a 4% increase in success rate and an 18% reduction in flowtime increase in robot operating system (ROS) tests, outperforming other GNN models. Real-world experiments further validate its ability to effectively leverage neighbor information, significantly improving path efficiency in practical applications.
- 19 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 72 (12) , 13617-13626
Collaborative Navigation of Multiple Autonomous Mobile Robots via Geometric Graph Neural Network
Multiple mobile robots play a crucial role in spatially distributed tasks. In unknown and nonrepetitive scenarios, reconstructing a global map is time-consuming and often unnecessary. Hence, research has focused on real-time collaborative planning without relying on a global map. This article introduces a novel multirobot collaborative path planning method based on geometric graph neural network (MRPP-GeoGNN). With all robots connected via local communication devices, the features of neighboring robot’s sensory data are transmitted to the ego-robot for reference. The GeoGNN layers acquire local surrounding features by integrating these sensory features with positional embeddings. We use a geometric function to project positional information into a high-dimensional space, which ensures the rotation invariance of different nodes in a relative coordinate system. An action mapper finally maps the integrated feature to multiple forward directions to guide the robot’s movement. Simulation results demonstrate an approximate 5% improvement in accuracy on expert datasets compared to convolutional neural network (CNN), along with a 4% increase in success rate and an 18% reduction in flowtime increase in robot operating system (ROS) tests, outperforming other GNN models. Real-world experiments further validate its ability to effectively leverage neighbor information, significantly improving path efficiency in practical applications.
- 11 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 10 (3) , 996-1010
Dynamic Resource Allocation for Real-Time Cloud XR Video Transmission: A Reinforcement Learning Approach
The extend reality (XR) applications are increasing rapidly alongside the development of mobile Internet. Wireless resource allocation faces a significant challenge due to the high reliability and ultra-low latency characteristics of XR applications. So it is crucial to implement a rational resource allocation program. However, the complex characteristics of multi-user channels, coupled with the huge solution space of the resource allocation optimization problem, prevent conventional methods from efficiently and reliably deriving resource block (RB) allocation schemes. Therefore, in this paper, we construct a low-latency, highly dynamic cloud XR video transmission model considering the randomness of video arrival misalignment for different users, and we resort to newly developed deep reinforcement learning (DRL) techniques for solutions. To deal with the dimensional disaster problem with exponential order of RB allocation, we propose a parallel multi-DRL framework as the foundation for introducing two dynamic RB allocation algorithms: multi noisy double dueling deep Q networks (M-Noisy-D3QN) and multi soft actor critic (M-SAC). Both of the proposed algorithms can improve resource utilization and can achieve the exploration ability and complexity trade-off. Moreover, to address the challenge that RB allocation actions and system goals are not directly related, we design a novel reward function combining external rewards and internal incentives to establish a coherent connection between the two, i.e., solve the reward sparsity problem in DRL. Simulation results show that the proposed dynamic RB allocation methods can successfully serve nearly twice as many users as other benchmarks in case of bandwidth resource constraints.
- 11 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 10 (3) , 996-1010
Dynamic Resource Allocation for Real-Time Cloud XR Video Transmission: A Reinforcement Learning Approach
The extend reality (XR) applications are increasing rapidly alongside the development of mobile Internet. Wireless resource allocation faces a significant challenge due to the high reliability and ultra-low latency characteristics of XR applications. So it is crucial to implement a rational resource allocation program. However, the complex characteristics of multi-user channels, coupled with the huge solution space of the resource allocation optimization problem, prevent conventional methods from efficiently and reliably deriving resource block (RB) allocation schemes. Therefore, in this paper, we construct a low-latency, highly dynamic cloud XR video transmission model considering the randomness of video arrival misalignment for different users, and we resort to newly developed deep reinforcement learning (DRL) techniques for solutions. To deal with the dimensional disaster problem with exponential order of RB allocation, we propose a parallel multi-DRL framework as the foundation for introducing two dynamic RB allocation algorithms: multi noisy double dueling deep Q networks (M-Noisy-D3QN) and multi soft actor critic (M-SAC). Both of the proposed algorithms can improve resource utilization and can achieve the exploration ability and complexity trade-off. Moreover, to address the challenge that RB allocation actions and system goals are not directly related, we design a novel reward function combining external rewards and internal incentives to establish a coherent connection between the two, i.e., solve the reward sparsity problem in DRL. Simulation results show that the proposed dynamic RB allocation methods can successfully serve nearly twice as many users as other benchmarks in case of bandwidth resource constraints.