Daily Arxiv

This is a page that curates AI-related papers published worldwide.
All content here is summarized using Google Gemini and operated on a non-profit basis.
Copyright for each paper belongs to the authors and their institutions; please make sure to credit the source when sharing.

Oranits: Mission Assignment and Task Offloading in Open RAN-based ITS using Metaheuristic and Deep Reinforcement Learning

Created by
  • Haebom

Author

Ngoc Hung Nguyen, Nguyen Van Thieu, Quang-Trung Luu, Anh Tuan Nguyen, Senura Wanasekara, Nguyen Cong Luong, Fatemeh Kavehmadavani, Van-Dinh Nguyen

Outline

This paper addresses the problem of mission assignment and task offloading, where autonomous vehicles utilize mobile edge computing to perform efficient processing in an Open RAN-based Intelligent Transportation System (ITS). Existing studies have limitations, such as failing to consider inter-mission interdependencies and the cost of offloading tasks to edge servers, leading to suboptimal decision-making. To address these limitations, this paper proposes Oranits, a novel system model that optimizes performance through vehicle cooperation while explicitly considering mission dependencies and offloading costs. To achieve this, we first develop a metaheuristic-based evolutionary computing algorithm called Chaotic Gaussian-Based Global ARO (CGG-ARO) as a baseline for optimization within a single slot. Second, we design a reinforcement learning framework called Multi-Agent Double-Deep Q-Network (MA-DDQN) that integrates multi-agent coordination and multi-action selection mechanisms to reduce mission assignment time and improve adaptability compared to baseline methods. Extensive simulation results show that CGG-ARO improves the number of completed missions and overall profit by approximately 7.1% and 7.7%, respectively, while MA-DDQN improves the number of completed missions and overall profit by 11.0% and 12.5%, respectively. These results highlight Oranits's ability to enable faster, more adaptive, and more efficient task processing in dynamic ITS environments.

Takeaways, Limitations

Takeaways:
Presenting an efficient mission allocation and task offloading strategy that considers mission dependency and offloading costs in an Open RAN-based ITS.
CGG-ARO and MA-DDQN algorithms improve mission completion rates and overall profits compared to existing methods.
Presenting an effective task processing method based on multi-agent cooperation and reinforcement learning.
Verifying the possibility of fast and adaptive task processing in a dynamic ITS environment.
Limitations:
Dependency on the simulation environment: Performance verification in a real ITS environment is required.
Algorithmic Complexity: Further research is needed on the computational complexity and real-time feasibility of CGG-ARO and MA-DDQN.
Lack of consideration for edge server resource constraints: Consideration needs to be given to edge server processing power and network bandwidth constraints.
Lack of robustness verification against various error situations (e.g., communication failure, sensor failure)
👍