{'fraction_non_alphanumeric': 0.019696969696969695, 'fraction_numerical': 0.0, 'mean_word_length': 5.41747572815534, '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 of multi-agent systems with switched linear dynamics

This paper presents a sufficient condition for consensus of multi-agent systems whose agent dynamics are described by switched linear systems. It is shown that the sufficient condition is valid whether the communication topology is directed or undirected if the topology has a spanning tree. Distributed control strategies based on the linear matrix inequality (LMI) condition to achieve consensus are proposed for both directed and undirected communication topologies. Additionally, the group decision value i.e., the common value which the agents reach an agreement on, is further investigated.