{'fraction_non_alphanumeric': 0.016216216216216217, 'fraction_numerical': 0.0, 'mean_word_length': 5.567375886524823, '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}}
On the Lyapunov exponent of consensus algorithm

Nowadays, consensus of multi-agent systems (MAS) is an intriguing topic which receives increasing attention from various disciplines recently. Traditionally, the analysis of consensusability for a given MAS with switching topology can be attributed to some techniques such as eigenvalue analysis, convergence of Markov chain, Lyapunov candidate construction, and so on. However, all these techniques are based on some restrictive conditions and hardly be generalized to the case of general switching topology. This paper aims at providing an inner explanation that the general consensus problem of MAS with switching topology can be transformed into the numerical calculation of the Lyapunov exponent for a given set of matrices. Consequently, the consensus of MAS with general switching topology can be resolved by using the existing numerical algorithm of Lyapunov exponent.