Tianyu Zuo

Dr. Tianyu Zuo


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
3 August 2025 in CCF Transactions on High Performance Computing
Verified
Journal Article
Closed access
PDF file
KDKai Di
Kai Di
PLPan Li
Pan Li
TZTianyu Zuo
Tianyu Zuo
FCFulin Chen
Fulin Chen
YJYuanshuang Jiang
Yuanshuang Jiang
DCDan Chen
Dan Chen

1 September 2025
Verified
Conference Paper
Open access
PDF file
KDKai Di
Kai Di
TZTianyu Zuo
Tianyu Zuo
PLPan Li
Pan Li
YJYuanshuang Jiang
Yuanshuang Jiang
FCFulin Chen
Fulin Chen
YJYichuan Jiang
Yichuan Jiang
With the rapid development and deep integration of artificial intelligence and automation technologies, autonomous unmanned swarms dynamically organize into multiplex network structures based on diverse task requirements in adversarial environments. Frequent task variations lead to load imbalances among agents and between network layers, significantly increasing the risk of enemy detection and destruction. Existing approaches typically simplify multiplex networks into single-layer structures for task scheduling, failing to address these load imbalance issues. Moreover, the coupling between task dynamics and network multiplexity dramatically increases the complexity of designing task migration strategies, and it is proven NP-hard to achieve such load balancing. To address these challenges, this paper proposes a risk-aware task migration method that achieves dynamic load balancing by matching task requirements with both intra-layer agent capabilities and inter-layer swarm capabilities. Simulation results demonstrate that our approach significantly outperforms benchmark algorithms in task completion cost, task completion proportion, and system robustness. In particular, the algorithm achieves solutions statistically indistinguishable from the optimal solutions computed by the CPLEX solver, while exhibiting significantly reduced computational overhead.

1 August 2025 in Tsinghua Science and Technology
Verified
Journal Article
Open access
PDF file
KDKai Di
Kai Di
PLPan Li
Pan Li
TZTianyu Zuo
Tianyu Zuo
FCFulin Chen
Fulin Chen
YJYuanshuang Jiang
Yuanshuang Jiang
DCDan Chen
Dan Chen
Multirobot information gathering in adversarial environments, where enemies can destroy detected robots, presents unique challenges not addressed by existing algorithms designed for safe settings. The advent of multirobot systems enables collaborative risk-avoidance behavior, exemplified in pursuit-evasion scenarios, where concentrated robot groups enhance their ability to evade and overcome pursuing enemies. However, current multirobot information gathering algorithms have not yet integrated this collaborative risk-avoidance model, potentially leading to robot damage and reduced efficiency. This study adopts a decomposition-andgrafting mechanism to separate the problem into two weakly coupled subproblems: task execution and task allocation. For task execution, we propose an exact algorithm based on the branch-and-pricing method. Our task execution algorithms are seamlessly integrated with a novel task map composition algorithm designed to identify high-utility solutions with minimal computational overhead, addressing the task allocation problem. Extensive simulations demonstrate that our algorithms significantly outperform benchmarks by increasing the number of collaborative risk-avoidance activities conducted by robots during information gathering tasks in adversarial environments. This research advances multirobot information gathering by incorporating collaborative risk-avoidance, enhancing robot survivability and efficiency in hazardous settings.