{'fraction_non_alphanumeric': 0.02204928664072633, 'fraction_numerical': 0.0, 'mean_word_length': 5.225806451612903, '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}}
Sequential multi-agent task assignment using auction algorithm based on D∗ lite

In this paper, we study task assignment strategy for multi-agent systems in which the task space grows sequentially. Many task assignment algorithms are based on the heuristic schemes that result in optimal performance, but in time-varying conditions, real-time assignment techniques are needed. In order to maximize the real-time performance, an auction algorithm is adopted and modified with D* lite algorithm to handle various events and changes of environments. The numerical results show that the proposed approach can be solved in real-time for various scenario and can perform sequential tasks efficiently. The extensions and possible applications of the approach are also discussed.