mlsanityData to 7 Oct 2026

Computation Offloading for Uncertain Marine Tasks by Cooperation of UAVs and Vessels

arXiv 2302.06055 ↗First posted 13 Feb 2023cs.NI cs.AI cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

With the continuous increment of maritime applications, the development of marine networks for data offloading becomes necessary. However, the limited maritime network resources are very difficult to satisfy real-time demands. Besides, how to effectively handle multiple compute-intensive tasks becomes another intractable issue. Hence, in this paper, we focus on the decision of maritime task offloading by the cooperation of unmanned aerial vehicles (UAVs) and vessels. Specifically, we first propose a cooperative offloading framework, including the demands from marine Internet of Things (MIoTs) devices and resource providers from UAVs and vessels. Due to the limited energy and computation ability of UAVs, it is necessary to help better apply the vessels to computation offloading. Then, we formulate the studied problem into a Markov decision process, aiming to minimize the total execution time and energy cost. Then, we leverage Lyapunov optimization to convert the long-term constraints of the total execution time and energy cost into their short-term constraints, further yielding a set of per-time-slot optimization problems. Furthermore, we propose a Q-learning based approach to solve the short-term problem efficiently. Finally, simulation results are conducted to verify the correctness and effectiveness of the proposed algorithm.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 2 of its 14 references that are in the map. First posted on arXiv 13 Feb 2023.

Builds on

2 of 14 references.

References · 2

  1. 2022Hierarchical Aerial Computing for Internet of Things via Cooperation of HAPs and UAVscited by 9
  2. 2020UAVs as a Service: Boosting Edge Intelligence for Air-Ground Integrated Networkscited by 4

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 0; 2025: 1.

2 papers.