{'fraction_non_alphanumeric': 0.03222222222222222, 'fraction_numerical': 0.0, 'mean_word_length': 5.877862595419847, '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}}
CEVOP : A Coevolutionary Planning Methodology

The planning process of multiple autonomous agents is influenced by various factors, such as homogeneity/heterogeneity, co-operation/competition, cardinality, and communication syntax/semantics. Analytical planning approaches were usually designed for specific domains and therefore are relative domain-depend. In this work, these difficulties are addressed through a generic algorithmic approach, namely the Co-evolutionary Planning (CEVOP) methodology, which provides a planning mechanism for multiple co-operating and/or competing homogeneous and/or heterogeneous agents through a single co-evolutionary algorithm. CEVOP is rather a framework for mapping the planning problem from the multi-agent domain onto the co-evolutionary algorithm domain, in order to find concrete plans to be executed later by the agents co-operatively and/or competitively.