{'fraction_non_alphanumeric': 0.01889763779527559, 'fraction_numerical': 0.0, 'mean_word_length': 5.989010989010989, '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}}
Finite-time consensus problem of multi-agent systems over switching jointly connected topologies

Finite-time consensus problem of multi-agent systems over switching jointly connected topologies is studied in this paper. Based on the graph theory, homogeneous property and LaSalle's invariance principle(LIP), some sufficient conditions are derived for the given consensus protocols even though the communication links between the agents dynamically change over time and the corresponding networks might be unconnected. Some examples and simulation results are given to illustrate the effectiveness of the obtained theoretical results.