{'fraction_non_alphanumeric': 0.024834437086092714, 'fraction_numerical': 0.0, 'mean_word_length': 5.173469387755102, '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 in Directed Networks of First-order Agents with Unknown High-frequency Gain Signs

In this paper, we study the consensus problem of first-order linearly parameterized agents with unknown high-frequency gain signs. We first propose a class of Nussbaum function based algorithms to deal with the unknown high-frequency gain signs. Then, under the assumption that the graph topology is strongly connected, it is shown that the first-order linearly parameterized agents with unknown high-frequency gain signs can achieve consensus. Finally, an example is provided to verify the proposed algorithms.