{'fraction_non_alphanumeric': 0.02666666666666667, 'fraction_numerical': 0.0033333333333333335, 'mean_word_length': 5.462365591397849, '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}}
Consensus tracking with a reference state using discrete-time algorithms

In this paper, we investigate the problem of consensus tracking with a reference state using discrete-time algorithm. We analyze two cases: 1) directed networks with fixed topology; and 2) directed networks with communication time-delays and fixed topology. We introduce two discrete-time consensus tracking protocols for networks with and without time-delays, and then present the conditions that the protocol solves the consensus tracking problem. Finally, simulations are provided that show the efficiency of these results.