{'fraction_non_alphanumeric': 0.014028056112224449, 'fraction_numerical': 0.0, 'mean_word_length': 5.756756756756757, '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}}
Admissible consensualization of heterogeneous singular multi-agent systems

The admissible consensualization problem of heterogeneous singular multi-agent systems is discussed. Based on the stability of lower triangular matrix, a weak sufficient condition to achieve admissible consensualization is provided. At the same time a constructive algorithm is presented to design the gain matrices of protocols. A numerical example is given to show the effectiveness of the proposed theorem and algorithm.