Welcome to the InfoSci Platform
A Workflow Scheduling Strategy for Reasoning Tasks of Autonomous Driving

A Workflow Scheduling Strategy for Reasoning Tasks of Autonomous Driving

Jianbin Liao, Rongbin Xu, Kai Lin, Bing Lin, Xinwei Chen, Hongliang Yu
Copyright: © 2022 |Volume: 14 |Issue: 1 |Pages: 21
ISSN: 1938-0259|EISSN: 1938-0267|EISBN13: 9781683180524|DOI: 10.4018/IJGHPC.304907
Cite Article Cite Article

MLA

Liao, Jianbin, et al. "A Workflow Scheduling Strategy for Reasoning Tasks of Autonomous Driving." IJGHPC vol.14, no.1 2022: pp.1-21. http://doi.org/10.4018/IJGHPC.304907

APA

Liao, J., Xu, R., Lin, K., Lin, B., Chen, X., & Yu, H. (2022). A Workflow Scheduling Strategy for Reasoning Tasks of Autonomous Driving. International Journal of Grid and High Performance Computing (IJGHPC), 14(1), 1-21. http://doi.org/10.4018/IJGHPC.304907

Chicago

Liao, Jianbin, et al. "A Workflow Scheduling Strategy for Reasoning Tasks of Autonomous Driving," International Journal of Grid and High Performance Computing (IJGHPC) 14, no.1: 1-21. http://doi.org/10.4018/IJGHPC.304907

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In different periods of time, the real-time reasoning tasks generated by autonomous vehicles are scheduled within the tolerance time, which is an important problem to be solved in autonomous driving. Traditionally, tasks are arranged on the on-board unit (OBU), which results in a long time to complete. Heuristic algorithm is widely used in task scheduling, which often leads to premature convergence. Task scheduling in the edge environment can effectively reduce the completion time of tasks. A workflow scheduling strategy in edge environment is designed. To optimize the completion time of reasoning tasks, this paper proposes a Q-learning algorithm based on simulated annealing (SA-QL). Moreover, this paper comprehensively reflects the performance of SA-RL and PSO algorithm from four aspects. Experimental results show that SA-RL algorithm and PSO algorithm have good performance in feasibility and effectiveness. TD(0) algorithms show better performance of exploration, TD(λ) algorithms show that of convergence.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.