{'fraction_non_alphanumeric': 0.028310502283105023, 'fraction_numerical': 0.0009132420091324201, 'mean_word_length': 5.335260115606936, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Workflow Scheduling Strategy for Reasoning Tasks of Autonomous Driving

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.