{'fraction_non_alphanumeric': 0.014157014157014158, 'fraction_numerical': 0.0, 'mean_word_length': 5.884955752212389, '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 Bipartite Consensus in Networks of Singular Agents Over Signed Graphs

This brief focuses on the network of singular agents with unknown disturbances. An admissible bipartite consensus problem is considered under cooperative-competitive interactions modeled by signed graphs. A distributed control algorithm derived by the extended state observer is designed, based on which singular multi-agent systems achieve not only disturbance rejection but also admissible bipartite consensus. It is shown that, by using singular system theory and matrix theory, the designed controller is solvable for admissible bipartite consensus under the assumption of connection and structural balance. Finally, the simulation example illustrates the feasibility of the proposed method.