AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Article Link
Collect
Submit Manuscript
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Regular Paper

CA-DTS: A Distributed and Collaborative Task Scheduling Algorithm for Edge Computing Enabled Intelligent Road Network

Key Laboratory of Water Big Data Technology of Ministry of Water Resources, Hohai University, Nanjing 210098, China
School of Computer and Information, Hohai University, Nanjing 210098, China
School of Information Science and Technology, Southwest Jiaotong University, Chengdu 611756, China
School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi 214122, China
Department of Computer and Information Sciences, University of Delaware, Newark, DE 19716, U.S.A.
National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210093, China
Show Author Information
An erratum to this article is available online at:

Abstract

Edge computing enabled Intelligent Road Network (EC-IRN) provides powerful and convenient computing services for vehicles and roadside sensing devices. The continuous emergence of transportation applications has caused a huge burden on roadside units (RSUs) equipped with edge servers in the Intelligent Road Network (IRN). Collaborative task scheduling among RSUs is an effective way to solve this problem. However, it is challenging to achieve collaborative scheduling among different RSUs in a completely decentralized environment. In this paper, we first model the interactions involved in task scheduling among distributed RSUs as a Markov game. Given that multi-agent deep reinforcement learning (MADRL) is a promising approach for the Markov game in decision optimization, we propose a collaborative task scheduling algorithm based on MADRL for EC-IRN, named CA-DTS, aiming to minimize the long-term average delay of tasks. To reduce the training costs caused by trial-and-error, CA-DTS specially designs a reward function and utilizes the distributed deployment and collective training architecture of counterfactual multi-agent policy gradient (COMA). To improve the stability of performance in large-scale environments, CA-DTS takes advantage of the action semantics network (ASN) to facilitate cooperation among multiple RSUs. The evaluation results of both the testbed and simulation demonstrate the effectiveness of our proposed algorithm. Compared with the baselines, CA-DTS can achieve convergence about 35% faster, and obtain average task delay that is lower by approximately 9.4%, 9.8%, and 6.7%, in different scenarios with varying numbers of RSUs, service types, and task arrival rates, respectively.

Electronic Supplementary Material

Download File(s)
JCST-2209-12839-Highlights.pdf (1.2 MB)

References

【1】
【1】
 
 
Journal of Computer Science and Technology
Pages 1113-1131

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Hu S-H, Luo Q-Y, Li G-H, et al. CA-DTS: A Distributed and Collaborative Task Scheduling Algorithm for Edge Computing Enabled Intelligent Road Network. Journal of Computer Science and Technology, 2023, 38(5): 1113-1131. https://doi.org/10.1007/s11390-023-2839-0

1213

Views

7

Crossref

8

Web of Science

9

Scopus

0

CSCD

Received: 19 September 2022
Accepted: 25 May 2023
Published: 30 September 2023
© Institute of Computing Technology, Chinese Academy of Sciences 2023