{'fraction_non_alphanumeric': 0.012282497441146366, 'fraction_numerical': 0.0, 'mean_word_length': 5.698630136986301, '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}}
Bipartite Consensus of Multi-Agent Systems With Intermittent Interaction

This paper studies the bipartite consensus problem of multi-agent systems with intermittent interaction under signed directed graph. It is assumed that each agent receives its states information relative to its neighbors at the sampling time and updates the control input by using the states information, and the period of each agent updates control input is equal to a positive integer multiple of its sampling period. Cooperation and competition between agents are represented by positive and negative weights of edge respectively in the signed topology. The sufficient condition for achieving bipartite consensus is obtained by Shure-Cohen stability criterion, which reveals the relationship among sampling period, update control input period and controller gain of system. Finally, simulation tests show the bipartite consensus performances of agents under intermittent protocol and signed topology.