{'fraction_non_alphanumeric': 0.010344827586206896, 'fraction_numerical': 0.0, 'mean_word_length': 5.006896551724138, '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}}
Determination of the itinerary of imprecise mobile agents using an adaptive approach

This paper discusses the use of mobile agents with timing requirements in a distributed system. The goal of this paper is to propose and to evaluate heuristics for imprecise mobile agents that should execute a mission while meeting firm deadlines. These heuristics are used to determine the itinerary of the mobile agents. They choose a behavior considering previous benefits collected by the mobile agent in past executions. The agent uses adaptation at the departure. Once chosen the behavior for a particular mission, the agent keeps this behavior until the end of the mission. In order to choose the behavior it is used conditional probability based on the characteristics of the environment and on the last events. The algorithms proposed here were evaluated through simulations.