{'fraction_non_alphanumeric': 0.016414141414141416, 'fraction_numerical': 0.0, 'mean_word_length': 5.0534351145038165, '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}}
Reaching cluster consensus in multi-agent systems

In this paper, the cluster consensus problem of linearly coupled multi-agent systems in directed networks is studied by constructing a Laplacian of a directed graph. Different from the former work in which the clusters are divided artificially, in this paper, the relationship between the number of the clusters and the Laplacian is revealed. It is obtained that the number of clusters equals to the multiplicity of the zero eigenvalue of the Laplacian. Based on the Algebraic Graph Theory, the Matrix Theory and the Modern Control Theory, a sufficient and necessary condition about the global stability of the cluster consensus in multi-agent system is derived. A numerical example is proposed to illustrate the effectiveness of the method.