Skip to main navigation Skip to search Skip to main content

Multi-Agent Reinforcement Learning for URLLC Modern Random Access

  • Institut Polytechnique de Paris

Research output: Contribution to journal › Conference article › peer-review

Abstract

We tackle the problem of scheduling Ultra-Reliable Low-Latency Communications (URLLC) on the uplink by relying on Modern Random Access (MRA) and Multi-Agent Reinforcement Learning (MARL). We first formulate a URLLC MRA (uMRA) problem with a Decentralized Partially Observable Markov Decision Process (Dec-POMDP). We then propose uMRA-HAPPO, a MARL-based solution employing the Heterogeneous Agents Proximal Policy Optimization (HAPPO) algorithm. Finally, we assess the performance of our proposed algorithm in scenarios inspired by 3GPP use cases, showing higher reliability than deterministic and random traditional strategies under a strict latency constraint.

Original languageEnglish
Pages (from-to)2191-2196
Number of pages6
JournalIEEE Globecom Workshops, GC Wkshps
Issue number2025
DOIs
Publication statusPublished - 1 Jan 2025
Event2025 IEEE Globecom Workshops, GC Wkshps 2025 - Taipei, Taiwan, Province of China
Duration: 8 Dec 2025 → 12 Dec 2025

Keywords

  • Dec-POMDP
  • HAPPO
  • MARL
  • Modern Random Access
  • Multiple Access
  • URLLC
  • uplink scheduling

Fingerprint

Dive into the research topics of 'Multi-Agent Reinforcement Learning for URLLC Modern Random Access'. Together they form a unique fingerprint.

Cite this