期刊检索

  • 2026年第58卷
  • 2025年第57卷
  • 2024年第56卷
  • 2023年第55卷
  • 2022年第54卷
  • 2021年第53卷
  • 2020年第52卷
  • 2019年第51卷
  • 2018年第50卷
  • 2017年第49卷
  • 2016年第48卷
  • 2015年第47卷
  • 2014年第46卷
  • 2013年第45卷
  • 2012年第44卷
  • 2011年第43卷
  • 2010年第42卷
  • 第1期
  • 第2期

主管单位 中华人民共和国工业和信息化部 主办单位 哈尔滨工业大学 主编 李隆球 国际刊号ISSN 0367-6234 国内刊号CN 23-1235/T

期刊网站二维码
微信公众号二维码
引用本文:黄腾飞,杜永文,刘帅,丁元,王欢.边缘计算中时延敏感的启发式任务卸载方法[J].哈尔滨工业大学学报,2026,58(3):205.DOI:10.11918/202310003
HUANG Tengfei,DU Yongwen,LIU Shuai,DING Yuan,WANG Huan.Latency-sensitive heuristic task offloading method in edge computing[J].Journal of Harbin Institute of Technology,2026,58(3):205.DOI:10.11918/202310003
【打印本页】   【HTML】   【下载PDF全文】   查看/发表评论  下载PDF阅读器  关闭
过刊浏览    高级检索
本文已被:浏览 162次   下载 25 本文二维码信息
码上扫一扫!
分享到: 微信 更多
边缘计算中时延敏感的启发式任务卸载方法
黄腾飞,杜永文,刘帅,丁元,王欢
(兰州交通大学 电子与信息工程学院,兰州 730070)
摘要:
针对移动边缘计算在多用户环境中卸载决策设计困难导致负载失衡、总时延过高和响应延迟问题,提出一种时延敏感的启发式任务卸载方法。首先,为解决边缘设备计算资源匮乏和电量不足的问题,建立以边缘服务器为主体的卸载架构,构建系统模型与时延优化模型;其次,提出一种改进的近端策略优化算法I-PPO,通过增加离线训练阶段、设计考虑多智能体决策影响的奖励机制、在特征中融入基于特定智能体的全局信息,使算法能够适用于多用户场景;进一步,在I-PPO的基础上,在任务卸载执行过程中引入任务优先级调度决策,构造时延敏感的轻量级启发式任务卸载算法,以降低系统时延,并提升用户体验。仿真实验表明,相比同类算法,所提I-PPO算法在收敛速度、寻优能力和鲁棒性方面表现更优,且适用于多智能体环境;所提算法在系统总时延和边缘服务器负载均衡方面优于对比算法,并具有良好的稳定性。
关键词:  边缘计算  深度强化学习  任务卸载  多智能体  启发式算法
DOI:10.11918/202310003
分类号:TP391
文献标识码:A
基金项目:甘肃省自然科学基金(1610RJZA056)
Latency-sensitive heuristic task offloading method in edge computing
HUANG Tengfei,DU Yongwen,LIU Shuai,DING Yuan,WANG Huan
(College of Electronic and Information Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China)
Abstract:
In order to address the challenge of designing reasonable offloading decisions for mobile edge computing (MEC) in multi-user environments, which leads to load imbalance, excessive total latency, and response delays, this paper proposed a latency-sensitive heuristic task offloading method. Firstly, to address the issues of limited computational resources and insufficient battery power of edge devices during computation task processing, the paper introduced an edge server-centric offloading paradigm and established a system model and a latency optimization model. Subsequently, it introduced an improved proximal policy optimization algorithm (I-PPO), which extended the offline training process, designed a reward mechanism that considers the impact of multi-agent decisions, and incorporated global information based on specific agents into the features, enabling the algorithm to be suitable for multi-user environments. Furthermore, building upon I-PPO, the paper introduced task priority scheduling decisions into the task offloading execution process, resulting in the development of a latency-sensitive lightweight heuristic task offloading algorithm, denoted as HTAI. This further optimized system latency and enhanced user satisfaction. Simulation experiments demonstrate that the I-PPO algorithm proposed in this paper, compared to similar algorithms, effectively improves convergence speed, optimization capability, and robustness, and it can be applied in multi-agent environments. Moreover, the algorithm proposed herein outperforms other algorithms in terms of total system latency and edge server load balance, exhibiting strong stability.
Key words:  edge computing  deep reinforcement learning  task offloading  multi-agent  heuristic algorithm

友情链接LINKS