{'fraction_non_alphanumeric': 0.02857142857142857, 'fraction_numerical': 0.0038095238095238095, 'mean_word_length': 4.971590909090909, '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}}
Ant Algorithms in a Graph Environment: a Meta-scheme for Coordination and Control

Ant algorithms already demonstrated their usefulness [2-7, 14] in today's multi-agent systems. This paper introduces a meta-scheme describing a high-level behavior for ant agents in a graph environment. Application of this meta-scheme makes the ant agents repeatedly visit the nodes in the graph that constitutes their environment. The main focus of the meta-scheme is on its reusability. The meta-scheme is used/extended by filling in the elements that decide about routing and cloning, as well as the retrieval and writing of information on information spaces attached to the nodes of environment. Two sample applications of the metascheme are described, called the "Flooding Walk Role" and "Emitting Walk Role" respectively. The research team applied these two applications of the meta-scheme to a case for communication networks and a case for manufacturing control. Finally, a conclusion is made on the utilization and the reusability of the proposed metascheme.