With the increasing demand for lunar exploration missions and the surge in communication and computing requirements, satellite-based Non-Terrestrial Network (NTN) has emerged as critical infrastructure. However, existing computing architectures are challenged by the Moon's complex environment. Although extreme temperature and radiation pose hardware-layer threats, this study focuses on the algorithmic challenges of communication and energy constraints. Specifically, existing task scheduling paradigms are inefficient in leveraging computing power resources, and existing resource allocation algorithms exhibit high deployment costs and poor dynamic adaptability. This paper proposes a collaborative cislunar computing architecture that orchestrates heterogeneous computational resources spanning lunar surface devices, Lunar Orbit Satellites (LOS), and Earth Orbit Satellites (EOS), incorporating the Two-phase Proactive Selection Multi-Agent Group Relative Policy Optimization (TPS-MAGRPO) algorithm. At its core, the algorithm's Two-phase Proactive Selection (TPS) scheduler—a two-stage task scheduling mechanism—harnesses fragmented resources via initial monolithic scheduling and adaptive task decomposition, while integrating a lightweight multi-agent reinforcement learning algorithm to enable efficient task scheduling and computing power coordination. Simulation results demonstrate improvements in task completion rate and task completion efficiency compared with conventional algorithms, providing an effective solution for the efficient task computation requirements in future lunar exploration.
A Collaborative Cislunar Computing Architecture for Task Scheduling and Resource Coordination Via Multi-Agent Reinforcement Learning / Zhao, L., Zhang, D., Hawbani, A., Tan, Z., Liu, Z., Geng, S., Tarchi, D.. - In: IEEE TRANSACTIONS ON MOBILE COMPUTING. - ISSN 1536-1233. - ELETTRONICO. - (2026), pp. 1-15. [10.1109/tmc.2026.3725949]
A Collaborative Cislunar Computing Architecture for Task Scheduling and Resource Coordination Via Multi-Agent Reinforcement Learning
Tarchi, Daniele
2026
Abstract
With the increasing demand for lunar exploration missions and the surge in communication and computing requirements, satellite-based Non-Terrestrial Network (NTN) has emerged as critical infrastructure. However, existing computing architectures are challenged by the Moon's complex environment. Although extreme temperature and radiation pose hardware-layer threats, this study focuses on the algorithmic challenges of communication and energy constraints. Specifically, existing task scheduling paradigms are inefficient in leveraging computing power resources, and existing resource allocation algorithms exhibit high deployment costs and poor dynamic adaptability. This paper proposes a collaborative cislunar computing architecture that orchestrates heterogeneous computational resources spanning lunar surface devices, Lunar Orbit Satellites (LOS), and Earth Orbit Satellites (EOS), incorporating the Two-phase Proactive Selection Multi-Agent Group Relative Policy Optimization (TPS-MAGRPO) algorithm. At its core, the algorithm's Two-phase Proactive Selection (TPS) scheduler—a two-stage task scheduling mechanism—harnesses fragmented resources via initial monolithic scheduling and adaptive task decomposition, while integrating a lightweight multi-agent reinforcement learning algorithm to enable efficient task scheduling and computing power coordination. Simulation results demonstrate improvements in task completion rate and task completion efficiency compared with conventional algorithms, providing an effective solution for the efficient task computation requirements in future lunar exploration.| File | Dimensione | Formato | |
|---|---|---|---|
|
A_Collaborative_Cislunar_Computing_Architecture_for_Task_Scheduling_and_Resource_Coordination_Via_Multi-Agent_Reinforcement_Learning.pdf
accesso aperto
Tipologia:
Versione finale referata (Postprint, Accepted manuscript)
Licenza:
Open Access
Dimensione
2.7 MB
Formato
Adobe PDF
|
2.7 MB | Adobe PDF |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.



