{'fraction_non_alphanumeric': 0.017942583732057416, 'fraction_numerical': 0.0, 'mean_word_length': 5.438461538461539, '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}}
Agreeing Asynchronously: Announcement of Results

This paper formulates and solves a continuous-time version of the widely studied Vicsek consensus problem in which each agent independently updates its heading at times determined by its own clock. It is not assumed that the agents' clocks are synchronized or that the "event" times between which any one agent updates its heading are evenly spaced. Heading updates need not occur instantaneously. Using the concept of "analytic synchronization" together with several key results concerned with properties of "compositions" of directed graphs, it is shown that the conditions under which a consensus is achieved are essentially the same as those applicable in the synchronous discrete-time case provided the notion of an agent's neighbor between its event times is appropriately defined