{'fraction_non_alphanumeric': 0.011986301369863013, 'fraction_numerical': 0.0, 'mean_word_length': 5.573033707865169, '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}}
Filtering of interaction rules in cooperation

Many cooperative control strategies focus on stability concerns to the deficit of global structure in a distributed cooperation task. We present a method of ensuring provable convergence of decentralized switching systems using ad-hoc definitions of proximity graphs, where convergence is measured by a potential function defined on the graph. The method depends on the proper filtering of the time-varying proximity graph structure so as to maintain convergence characteristics. We demonstrate the approach with an underactuated system.