Allocating physical layer resources to users based on channel quality, buffer size, requirements and constraints represents one of the central optimization problems in the management of radio resources. The solution space grows combinatorially with the cardinality of each dimension making it hard to find optimal solutions using an exhaustive search or even classical optimization algorithms given the stringent time requirements. This problem is even more pronounced in MU-MIMO scheduling where the scheduler can assign multiple users to the same time-frequency physical resources. Traditional approaches thus resort to designing heuristics that trade optimality in favor of feasibility of execution. In this work we treat the MU-MIMO scheduling problem as a tree-structured combinatorial problem and, borrowing from the recent successes of AlphaGo Zero, we investigate the feasibility of searching for the best performing solutions using a combination of Monte Carlo Tree Search and Reinforcement Learning. To cater to the nature of the problem at hand, like the lack of an intrinsic ordering of the users as well as the importance of dependencies between combinations of users, we make fundamental modifications to the neural network architecture by introducing the self-attention mechanism. We then demonstrate that the resulting approach is not only feasible but vastly outperforms state-of-the-art heuristic-based scheduling approaches in the presence of measurement uncertainties and finite buffers.
Hybrid intelligence for dynamic job-shop scheduling with deep reinforcement learning and attention mechanism
Shenzhen International Graduate School, Tsinghua University（清华大学深圳国际研究生院）；School of Intelligent Systems Science and Engineering, Jinan University（暨南大学智能系统科学与工程学院）
Learning Topological Representations with Bidirectional Graph Attention Network for Solving Job Shop Scheduling Problem
Nanyang Technological University（南洋理工大学）；Singapore Management University（新加坡管理大学）；Eindhoven University of Technology（埃因霍温理工大学）；Institute of Marine Science and Technology, Shandong University（山东大学海洋科学与技术研究院）
Cost-Aware Dynamic Cloud Workflow Scheduling using Self-Attention and Evolutionary Reinforcement Learning
Centre for Data Science and Artificial Intelligence（数据科学与人工智能中心）；School of Engineering and Computer Science（工程与计算机科学学院）；Victoria University of Wellington（惠灵顿维多利亚大学）
Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling Problems
Eindhoven University of Technology（埃因霍温理工大学）；Eindhoven Artificial Intelligence Systems Institute（埃因霍温人工智能系统研究所）；Delmia R&D, Dassault Systèmes（达索系统Delmia研发部）
Safe Hierarchical Reinforcement Learning for CubeSat Task Scheduling Based on Energy Consumption
Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg (UL)（卢森堡大学跨学科安全、可靠性与信任中心（SnT））；Automation and Robotics Research Group (ARG)（自动化与机器人研究组）；Space Systems Research Group (SpaSys)（空间系统研究组）
Stacked Auto Encoder Based Deep Reinforcement Learning for Online Resource Scheduling in Large-Scale MEC Networks
Hunan Normal University（湖南师范大学）；Northumbria University（诺森比亚大学）；Hunan University of Technology and Business（湖南工商大学）；Queen Mary University of London（伦敦玛丽女王大学）；Changchun Institute of Technology（长春工程学院）；University of Essex（埃塞克斯大学）
