{'fraction_non_alphanumeric': 0.01569506726457399, 'fraction_numerical': 0.0, 'mean_word_length': 5.04054054054054, '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}}
Combining Idleness and Distance to Design Heuristic Agents for the Patrolling Task

A group of agents can be used to perform patrolling tasks in a variety of domains, especially in computer games. In a previous and pioneer work, we presented an initial discussion of multi-agent patrolling task issues. In this paper we deepen this study, including new architectures which use advanced heuristic techniques in order to achieve better performance.