基于复杂度建模的煤矿井下巡检任务卸载与边缘资源优化方法

An Edge Resource Optimization Method for Underground Coal Mine Inspection Tasks Based on Complexity Modeling

  • 摘要: 随着煤矿智能化与无人化进程的加快,井下巡检机器人在环境监测、设备巡查与安全保障中发挥着越来越重要的作用。井下巡检任务在数据规模与计算复杂度上均具有显著差异,表现出典型的双重异构特性。传统 MEC 卸载方法多将任务视为黑盒,难以准确刻画真实计算开销,从而限制了卸载决策的有效性。为此,本文首先基于任务的时间复杂度与数据规模构建可解释的计算负载模型,并据此推导任务本地计算与卸载的临界阈值,用于精准筛选卸载候选任务。在此基础上,本文提出一种双层优化框架:上层在资源充裕假设下完成预卸载判决,下层在实际资源约束下采用加权满意度资源管理算法(WSRMA)进行资源感知调度。WSRMA 结合加权满意度、资源惩罚与邻域搜索,以兼顾时延、能耗与负载均衡。实验结果表明,所提方法在多类双重异构任务场景中在系统加权满意度上提升9.49%,同时平均时延和能耗分别降低 7.63% 与 3.94%,均显著优于现有策略,并具备适用于在线调度的低复杂度优势。

     

    Abstract: With the accelerating trend toward intelligent and unmanned coal mines, underground inspection robots are playing an increasingly vital role in environmental monitoring, equipment inspection, and safety assurance. Inspection tasks in underground coal mines exhibit significant variations in both data volume and computational complexity, resulting in a typical dual heterogeneity. Traditional MEC (Multi-access Edge Computing) offloading methods often treat tasks as black boxes, making it difficult to accurately characterize actual computational costs, thereby limiting the effectiveness of offloading decisions.To address this, this paper first constructs an interpretable computational load model based on the task's time complexity and data volume, and derives a critical threshold to distinguish between local execution and offloading. This enables precise selection of offloading candidate tasks. Building on this, a two-layer optimization framework is proposed: the upper layer makes preliminary offloading decisions under the assumption of sufficient resources, while the lower layer performs resource-aware scheduling using a Weighted Satisfaction Resource Management Algorithm (WSRMA) under actual resource constraints. WSRMA integrates weighted satisfaction, resource penalties, and neighborhood search to jointly optimize latency, energy consumption, and load balancing.Experimental results demonstrate that the proposed method improves system-wide weighted satisfaction by 9.49%, while reducing average latency and energy consumption by 7.63% and 3.94%, respectively, across various dual-heterogeneous task scenarios. The method significantly outperforms existing strategies and offers low computational complexity, making it well-suited for online scheduling applications.

     

/

返回文章
返回