betaFeedback

WorksComputer Science

Budgeted Decision-Model-Guided Joint-Action Search for Satellite Edge Computing

Abstract

Efficient task offloading in satellite edge computing requires coordinated allocation of communication and computing resources. Search methods based on large language models (LLMs) have been shown to generate high-quality resource allocations, but the latency of individual model requests and repeated model interactions can lead to substantial solver overhead. We propose budgeted joint-action search (BJAS), an integrated decision-model-guided solver that jointly optimizes satellite offloading and power allocation to minimize average task-completion latency under explicit search budgets. Its bounded candidate pools combine single-terminal updates with power-inheriting offload replacements for batched selection, retaining two-terminal coordination without enumerating additional power vectors. Across 60 completed runs per method under the workflows' respective configurations, BJAS reduces mean total solver time by 97.16% relative to LLM-generated offloading while achieving a mean task-completion latency close to that of the LLM baseline. BJAS also achieves lower mean task-completion latency than the tested genetic algorithm and deep deterministic policy gradient baselines.

Paper details

vlnc:W_z57km9ne
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…