{'fraction_non_alphanumeric': 0.02001906577693041, 'fraction_numerical': 0.0038131553860819827, 'mean_word_length': 5.481481481481482, '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}}
Sequentially updated Probability Collectives

Multi-agent coordination problems can be cast as distributed optimization tasks. Probability Collectives (PCs) are techniques that deal with such problems in discrete and continuous spaces [15]. In this paper we are going to propose a new variation of PCs, Sequentially updated Probability Collectives. Our objective is to show how standard techniques from the statistics literature, Sequential Monte Carlo methods and kernel regression, can be used as building blocks within PCs instead of the ad hoc approaches taken previously to produce samples and estimate values in continuous action spaces. We test our algorithm in three different simulation scenarios with continuous action spaces. Two classical distributed optimization functions, the three and six dimensional Hartman functions [6] and a vehicle target assignment type game [1]. The results for the Hartman functions were close to the global optimum, and the agents managed to coordinate to the optimal solution of the target assignment game.