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

Complexity modeling-based task offloading and edge resource optimization method for underground coal mine inspection

  • 摘要: 针对煤矿井下智能巡检中传统方法难以准确刻画任务计算开销、卸载决策不精准及资源受限下多目标优化困难的问题,提出一种基于复杂度建模的煤矿井下巡检任务卸载与边缘资源优化方法。巡检机器人本地卸载决策层根据任务复杂度、输入规模及井下移动边缘计算(MEC)节点实时资源状态,判定任务在机器人本地执行或卸载至边缘侧;多任务MEC资源调度层针对预卸载任务,采用加权满意度资源管理算法(WSRMA)优化带宽与算力分配,并通过局部搜索进一步提升分配效果。仿真分析结果表明:① 不同任务在本地计算与边缘卸载之间的性能差异主要由计算复杂度与数据量决定,高复杂度大上行量任务仅在规模超卸载阈值后卸载更优,轻量任务全场景下本地执行收益最高。② 在动态带宽场景下,WSRMA平均满意度较第二代非支配排序遗传算法(NSGA−II)、随机分配算法(Random)、轮询算法(RR)和深度确定性策略梯度(DDPG)分别提升18.85%,29.52%,38.21%和26.42%;不同算力场景下,WSRMA平均满意度分别提升21.88%,75.15%,36%,47.15%。③ WSRMA任务时延控制在0.295~0.314 s,能耗稳定在0.264~0.279 J,适用于煤矿井下资源受限场景。④ WSRMA的整体时间复杂度远低于NSGA−II与DDPG,可在极低的额外计算开销下实现系统性能大幅提升。

     

    Abstract: To address the problems that traditional methods in intelligent underground coal mine inspection have difficulty accurately characterizing task computation costs, making precise offloading decisions, and achieving multi-objective optimization under resource constraints, this paper proposed a complexity modeling-based task offloading and edge resource optimization method for underground coal mine inspection. The local offloading decision layer of the inspection robot determined whether a task should be executed locally on the robot or offloaded to the edge side according to task complexity, input size, and the real-time resource status of underground Mobile Edge Computing (MEC) nodes. For pre-offloaded tasks, the multi-task MEC resource scheduling layer adopted a Weighted Satisfaction Resource Management Algorithm (WSRMA) to optimize bandwidth and computing resource allocation, and further improved the allocation effect through local search. Simulation results showed that: ① the performance differences between local computation and edge offloading for different tasks were mainly determined by computational complexity and data volume. Tasks with high complexity and large uplink data volumes performed better with offloading only when their scale exceeded the offloading threshold, whereas lightweight tasks achieved the highest benefits from local execution in all scenarios. ② In dynamic bandwidth scenarios, the average satisfaction of WSRMA was improved by 18.85%, 29.52%, 38.21%, and 26.42% compared with the Non-Dominated Sorting Genetic Algorithm II (NSGA-II), Random Allocation Algorithm (Random), Round-Robin Algorithm (RR), and Deep Deterministic Policy Gradient (DDPG), respectively. Under different computing power scenarios, the average satisfaction of WSRMA was improved by 21.88%, 75.15%, 36%, and 47.15%, respectively. ③ The task delay of WSRMA was controlled within 0.295-0.314 s, and the energy consumption remained stable at 0.264-0.279 J, indicating its suitability for resource-constrained underground coal mine scenarios. ④ The overall time complexity of WSRMA was much lower than that of NSGA-II and DDPG, enabling substantial system performance improvement with extremely low additional computational overhead.

     

/

返回文章
返回