{'fraction_non_alphanumeric': 0.019469026548672566, 'fraction_numerical': 0.0, 'mean_word_length': 5.21978021978022, '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}}
Agreement over networks of mobile agents

In a consensus problem, autonomous agents constituting a dynamical system communicate with one another to reach agreement on certain quantities of interest such as heading, attitude, opinion, etc. In this paper, we consider the consensus problem for autonomous agents meandering as random walkers in a discrete lattice. Agents can share information if they reside at the same site in the lattice. We formulate consensus among the agents as a consequence of the disagreement among the agents approaching zero, almost-surely.