A data resource scheduling method based on multi-agent game cooperation
By combining hierarchical agent modeling and multi-agent reinforcement learning, the problem of unbalanced and unstable resource scheduling in data centers and cloud computing platforms is solved, and efficient and stable data resource scheduling is achieved.
Patent Information
- Authority / Receiving Office
- CN ยท China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- XINGCHENSHUMENG (HANGZHOU) TECH CO LTD
- Filing Date
- 2025-10-13
- Publication Date
- 2026-06-26
AI Technical Summary
In existing data centers and cloud computing platforms, traditional data resource scheduling methods suffer from slow response speed, rigid scheduling results, and uneven resource allocation when faced with multi-task concurrency, resource heterogeneity, and dynamic environmental changes. Furthermore, existing multi-agent game theory methods lack hierarchical modeling and refined game analysis, resulting in high computational complexity and unstable scheduling strategies.
By employing hierarchical agent modeling, multi-agent reinforcement learning, and local Nash response policy derivation, a hierarchical agent structure is constructed, comprising task execution, resource allocation, and coordination control classes. Through distributed reinforcement learning and local Nash response policy derivation, collaborative decision-making and adaptive scheduling of multiple agents are achieved.
It achieves globally optimal scheduling in a large-scale, multi-source, heterogeneous data environment, improving scheduling accuracy, resource utilization, and system stability, while reducing scheduling conflict rate and system energy consumption.
Smart Images

Figure CN121277640B_ABST