Haiyuan Li

dblp:63/8369 · DBLP profile ↗
← Back
16ranked-venue papers
9as first author
11since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 7 · 2 first-author · 2 since 2021Computer networks · 7 · 6 first-author · 7 since 2021Systems, architecture and hardware · 5 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2026 Multi-Agentic AI for Conflict-Aware rApp Policy Orchestration in Open RAN
abstract
Open Radio Access Network (RAN) enables flexible, AI-driven control of mobile networks through disaggregated, multi-vendor components. In this architecture, xApps handle real-time functions, whereas rApps in the non-real-time controller generate strategic policies. However, current rApp development remains largely manual, brittle, and poorly scalable as xApp diversity proliferates. In this work, we propose a multi-agent Agentic AI framework to automate rApp policy generation and orchestration. The architecture integrates three specialized large language model (LLM)-based agents, Perception, Reasoning, and Refinement, supported by retrieval-augmented generation (RAG) and memory-based analogical reasoning. These agents collectively analyze potential conflicts, synthesize intent-aligned control pipelines, and incrementally refine deployment decisions. Experiments across diverse deployment scenarios demonstrate that the proposed system achieves over 70% improvement in deployment accuracy and 95% reduction in reasoning cost compared to baseline methods, while maintaining zero-shot generalization to unseen intents. These results establish a scalable and conflict-aware solution for fully autonomous, zero-touch rApp orchestration in Open RAN.
Haiyuan Li, Yulei Wu, Dimitra Simeonidou
ICC1
2026 A novel rapidly-exploring random tree algorithm with dynamic goal biasing and position-constrained sampling based on equal-interval nodes and cost optimization: application to mobile robots
Wei Zheng 0005, Haiyuan Li, Hak-Keung Lam, Fuchun Sun 0001, Chunhuan Yang, Shuhuan Wen
Eng. Appl. Artif. Intell.2
2026 Future Factories With 6G: Agentic AI and Cyber-Physical Digital Twins
abstract
Industry 5.0 envisions a cyber-physical future where humans and robots collaborate harmoniously, empowered by 6G connectivity and intelligent automation. Central to this vision is the ability to autonomously configure complex production pipelines based on diverse and evolving human intents. Existing orchestration technologies exhibit critical shortcomings in terms of self-learning, validation, error diagnosis, and rectification capabilities. To this end, we propose an Agentic AI orchestration framework that interprets human intents and dynamically assembles optimal technology pipelines using a self-improving, retrieval-augmented Large Language Model (LLM) and a Bayesian contextual-bandit selector. This enables dynamic adaptation in unpredictable factory environments. Our solution is validated in a cyber-physical testbed integrating Digital Twins (DTs), distributed AI, robotics, and real-world network infrastructure. Compared to baseline LLMs, our system reduces orchestration iterations by over 94% for a given intent and by around 90% for an unseen intent, showing rapid convergence and strong generalization. Real-world deployments mirror DT results, confirming both the fidelity of the simulation and the practical value of intent-driven orchestration for human-centric manufacturing.
Haiyuan Li, Hari Madhukumar, Nicholas Methley, Yulei Wu, Juan Marcelo Parra-Ullauri, Vishnu Sharma, Jeongran Lee, Arndt Ryo Koblitz, Matthew Andrews, Sige Liu, Yansha Deng, Oluwatayo Y. Kolawole, Andrea Tassi, Dimitra Simeonidou
IEEE Internet Things J.1
2026 WUSRVN: Wavelet U-shaped network and sensitivity refinement-based variational network for accelerated magnetic resonance imaging
Haiyuan Li, Jizhong Duan, Haibo Tao, Yu Liu 0004
Signal Process.1
2026 Incremental DRL-Based Resource Management for Dynamic Network Slicing in an Urban-Wide Testbed
abstract
Multi-access edge computing provides localized resources within mobile networks to address the requirements of emerging latency-sensitive and computing-intensive applications. At the edge, dynamic requests necessitate sophisticated resource management for adaptive network slicing. This involves optimizing resource allocations, scaling functions, and load balancing to utilize only essential resources under constrained network scenarios. However, existing solutions largely assume static slice counts, ignoring the re-optimization overhead associated with management algorithms when slices fluctuate. Moreover, many approaches rely on simplified energy models that overlook intertemporal resource scheduling and are predominantly evaluated through simulations, neglecting critical practical considerations. This paper presents an incremental cooperative Multi-Agent Deep Deterministic Policy Gradient (MADDPG) algorithm for resource management in dynamic edge slicing. The proposed approach optimizes long-term slicing benefits by reducing delay and energy consumption while minimizing retraining overhead in response to slice variations. Furthermore, we implement an urban-wide edge computing testbed based on OpenStack and Kubernetes to validate the algorithm’s performance. Experimental results demonstrate that our incremental MADDPG method outperforms benchmark strategies in aggregated slicing utility and reduces training energy consumption by up to 50% compared to the re-optimization approach.
Haiyuan Li, Yuelin Liu, Hari Madhukumar, Amin Emami, Xueqing Zhou, Yulei Wu, Xenofon Vasilakos, Shuangyi Yan, Dimitra Simeonidou
IEEE Trans. Netw. Serv. Manag.1
2025 Cooperative Task Offloading Through Asynchronous Deep Reinforcement Learning in Mobile Edge Computing for Future Networks
Yuelin Liu, Haiyuan Li, Xenofon Vasilakos, Rasheed Hussain, Dimitra Simeonidou
ICC2
2025 Mechanism Design, Optimization, and Experimental Validation of an Ultrasound-Guided Series-Parallel Hybrid Robot for Prostate Transperineal Puncture
abstract
Transperineal prostate puncture is challenging for the physician to manually place a needle and presents a steep learning curve. This paper proposes a novel ultrasound -guided series-parallel hybrid robot with the aim to enhance transperineal procedures. For maximum prostate coverage with flexibility and accuracy in needle placement, a 5 degrees of freedom series-parallel hybrid mechanism with two serial manipulators, a linear feeding unit, and an US probe positioning mechanism is be designed. In addition to mechanical design and kinematics modeling, an QPSO algorithm is proposed to optimize the mechanical parameters. Upon comprehensive comparison with alternative algorithms, the optimization outcomes fully align with clinical requirements. The prototype was fabricated and verified through needle insertion experiments in different scenarios to assess its feasibility. The absolute positioning error of the robot is 1.47 mm in water and 1.75 mm in gel phantom.
Haiyuan Li, Yilun Shi
IROS1
2025 NetMind+: Adaptive Baseband Function Placement With GCN Encoding and Incremental Maze-Solving DRL for Dynamic and Heterogeneous RANs
abstract
The disaggregated architecture of advanced Radio Access Networks (RANs) with diverse X-haul latencies, in conjunction with resource-limited multi-access edge computing networks, presents significant challenges in designing a general model in placing baseband and user plane functions to accommodate versatile 5G services. This paper proposes a novel approach, NetMind+, which leverages Deep Reinforcement Learning (DRL) to determine the function placement strategies in diverse and evolving RAN topologies, aiming at minimizing power consumption. NetMind+ resolves the problem with a maze-solving strategy, enabling a Markov Decision Process with standardized action space scales across different networks. Additionally, a Graph Convolutional Network (GCN) based encoding and an incremental learning mechanism are introduced, allowing features from different and dynamic networks to be aggregated into a single DRL agent. This facilitates the generalization capability of DRL and minimizes the negative retraining impact. In an example with three sub-networks, NetMind+ demonstrates a substantial 32.76% improvement in power savings and a 41.67% increase in service stability compared to benchmarks from the existing literature. Compared to traditional methods necessitating a dedicated DRL agent for each network, NetMind+ attains comparable performance with 70% of the training cost savings. Furthermore, it demonstrates robust adaptability during network variations, accelerating training speed by 50%.
Haiyuan Li, Peizheng Li, Karcius D. R. Assis, Juan Marcelo Parra-Ullauri, Adnan Aijaz, Shuangyi Yan, Dimitra Simeonidou
IEEE Trans. Netw. Serv. Manag.1
2024 NetMind: Adaptive RAN Baseband Function Placement by GCN Encoding and Maze-solving DRL
abstract
The dis aggregated and hierarchical architecture of advanced RAN presents significant challenges in efficiently placing baseband functions and user plane functions in conjunction with Multi-Access Edge Computing (MEC) to accommodate diverse 5G services. Therefore, this paper proposes a novel approach NetMind, which leverages Deep Reinforcement Learning (DRL) to determine the function placement strategies in RANs with diverse topologies, aiming at minimizing power consumption. NetMind formulates the function placement problem as a maze-solving task, enabling a Markov Decision Process with standardized action space scales across different networks. Additionally, a Graph Convolutional Network (GCN) based encoding mechanism is introduced, allowing features from different networks to be aggregated into a single RL agent. That facilitates the RL agent's generalization capability and minimizes the negative impact of retraining on power consumption. In an example with three sub-networks, NetMind achieves comparable performance to traditional methods that require a dedicated DRL agent for each network, resulting in a 70 % reduction in training costs. Furthermore, it demonstrates a substantial 32.76% improvement in power savings and a 41.67 % increase in service stability compared to benchmarks from the existing literature.
Haiyuan Li, Peizheng Li, Karcius Day Assis, Adnan Aijaz, Sen Shen, Reza Nejabati, Shuangyi Yan, Dimitra Simeonidou
WCNC1
2023 DRL-Driven Intelligent Access Traffic Management for Hybrid 5G-WiFi Multi-RAT Networks
abstract
Integrating mobile networks with Non-3GPP networks provides a promising solution to mitigate the wireless RF spectrum scarcity. Despite the maturity of integration technologies, a comprehensive approach for radio resource allocation in highly dynamic and complex multiple Radio Access Technologies (multi-RAT) networks is still lacking. To tackle this challenge, this paper proposes an Access Traffic Management (ATM) system that enhances radio resource allocation during access, transmission, and handover processes. The system features a scalable and concise ATM-supported multi-RAT network architecture, supported by a Deep Deterministic Policy Gradient (DDPG) based Intelligent ATM (IATM) algorithm. To evaluate the proposed system, a Network Simulator 3 (NS3) based network simulation is built with realistic 5G and WiFi modules, interacting with the IATM algorithm in real time for decision making and policy improvement. Numerical improvements of our solution demonstrate its superiority over conventional steering modes. Our solution achieves an increase in resource utilization efficiency by 45% and 70% compared to the Active-Standby and Load-Balance steering modes, respectively. Moreover, it enhances link quality by a factor of three and doubles throughput without incurring any additional costs. Additionally, our solution significantly enhances session stability under conditions involving network size dynamics and UE mobility.
Xueqing Zhou, Haiyuan Li, Anderson Bravalheri, Amin Emami, Reza Nejabati, Shuangyi Yan, Dimitra Simeonidou
PIMRC2
2022 DRL-Based Long-Term Resource Planning for Task Offloading Policies in Multiserver Edge Computing Networks
abstract
Multi-access edge computing (MEC) has been regarded as one of the essential technologies for mobile networks, by providing computing resources and services close to users, thereby, avoiding extra energy consumption and fitting the low-latency ultra-reliable requirements for emerging 5G applications. Task offloading policy plays a pivotal role in handling offloading requests and maximizing the network computing performance. Most recently developed offloading solutions are designed for instant rewards, therefore, neglecting the long-term computing resource optimization at the edge, which fail to deliver optimized network performance when a significant increase of computing requests appears. In this paper, with the objective of maximizing long-term offloading benefits on delay and energy consumption, task offloading policies are proposed to firstly avoid resource over-distribution through deep reinforcement learning (DRL) based resource reservation and server cooperation, and secondly maximize the average instant reward and the utilization of reserved resources by an optimization-based joint policy consisting of offloading decision, transmission power allocation and resource distribution. The DRL-based joint policy is evaluated in a simulated multi-server edge computing network. Compared to previous solutions, the DRL-based algorithms achieve higher and more reliable overall rewards. Of the implemented three DRL-based algorithms, fully cooperative multi-agent DRL accounts for cooperation between servers, achieving a 70.5% reduction in reward variance and a 13.4% increase in average rewards over 500 continuous operations. Resource balanced policies on long-term rewards help edge networks handle the explosive growth of 5G computing-intensive applications in the future.
Haiyuan Li, Karcius D. R. Assis, Shuangyi Yan, Dimitra Simeonidou
IEEE Trans. Netw. Serv. Manag.1
2016 New probabilistic approaches to the AX = XB hand-eye calibration without correspondence
abstract
The hand-eye calibration problem was first formulated decades ago and is widely applied in robotics, image guided therapy, etc. It is usually cast as the “AX = XB” problem where the matrices A, B, and X are rigid body transformations in SE(3). Many solvers have been proposed to recover X given data streams {Ai} and {Bi} with correspondence. However, exact correspondence might not be accessible in the real world due to the asynchronous sensors and missing data, etc. A probabilistic approach named “Batch method” was introduced in previous research of our lab, which doesn't require a prior knowledge of the correspondence between the two data streams {Ai} and {Bj}. Analogous to non-probabilistic approaches which require data selection to filter out ill-conditioned data pairs, the Batch method has restrictions on the data set {Ai} and {Bj} that can be used. We propose two new probabilistic approaches built on top of the Batch method by giving new definitions of the mean on SE(3), which alleviate the restrictions on the data set and significantly improve the calibration accuracy of X.
Qianli Ma 0002, Haiyuan Li, Gregory S. Chirikjian
ICRA2
2015 A novel soft manipulator based on beehive structure
abstract
This paper presents a novel design for the soft continuum manipulator based on beehive structure. Our design inspiration derives from the beehive hexagon structure, which has some characteristics of compact layout, low material consumption, thinner thickness of wall, and higher structure strength. The manipulator includes several same modules which composed of many hexagon cell units, the deformation of these cell units synthesize the module macroscopic movement. By installing several modules in series, we can form the manipulator arm. For module fabrication, we adopt 3D printing technology and use the silicone rubber as the flexible material; these measures ensure that the complex shape of the module can be achieved and make the module easier to deform elastically. Based on pneumatic technology, we build the control system and verify its operation via some experiments. In the gravity environment, three-section (about 180mm long at uninflated state) manipulator's maximum bending angle reaches about 90°, its elongation is close to 2:1. We also do a five-section experiment to acquire the manipulator's motion under different section combinations. The experiments verified that the manipulator has both good flexibility and operational capabilities.
Cai Meng, Weidong Xu, Haiyuan Li, Tianmiao Wang
IROS3
2015 Collective grasping for non-cooperative objects using modular self-reconfigurable robots
abstract
This paper presents modular self-reconfigurable robots for grasping an unknown object based on a grasp quality metric. The presented self-reconfiguration approach makes use of basic motions performed by individual robots to change the structure. The method to solve for forward kinematics as well as configuration representation is proposed based on relationship between robotic modules. This method can be used to update the estimated contact points in self-reconfiguration. Incorporating a grasp quality metric of form closure into self-reconfiguration, the structure for grasping can be evaluated until a desired metric is obtained. Grasping and self-reconfiguration simulation experiments are presented, showing the availability and effectiveness of the proposed approach.
Tianmiao Wang, Haiyuan Li, Cai Meng
IROS2
2015 Co-evolution framework of swarm self-assembly robots
Haiyuan Li, Hongxing Wei, Jiang-Yang Xiao, Tianmiao Wang
Neurocomputing1
2010 Sambot: A self-assembly modular robot for swarm robot
abstract
This paper presents a novel self-assembly modular robot (Sambot) that also shares characteristics with self-reconfigurable and self-assembly and swarm robots. Each Sambot can move autonomously and connect with the others. Multiple Sambot can be self-assembled to form a robotic structure, which can be reconfigured into different configurable robots and can locomote. A novel mechanical design is described to realize function of autonomous motion and docking. Introducing embedded mechatronics integrated technology, whole actuators, sensors, microprocessors, power and communication unit are embedded in the module. The Sambot is compact and flexble, the overall size is 80×80×102mm. The preliminary self-assembly and self-reconfiguration of Sambot is discussed, and several possible configurations consisting of multiple Sambot are designed in simulation environment. At last, the experiment of self-assembly and self-reconfiguration and locomotion of multiple Sambot has been implemented.
Hongxing Wei, Yingpeng Cai, Haiyuan Li, Dezhong Li, Tianmiao Wang
ICRA3