{'fraction_non_alphanumeric': 0.01386481802426343, 'fraction_numerical': 0.0034662045060658577, 'mean_word_length': 4.5576923076923075, '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}}
A variant of the cyclic pursuit scheme for consensus in multi-agent systems

In this paper, we present a solution to the rendezvous problem using a variant of the cyclic pursuit, in which agent i follows agent i +1 modulo η and in which agent i follows agent i-1 modulo n. With the variant of the cyclic pursuit, we aim to increase the convergence rate compared to the cyclic pursuit A generalized variant of the proposed strategy is also presented to guide mobile agents to rendezvous at a desired point We provide simulation results to illustrate the key theoretical results.