Virtual player design using self-learning via competitive coevolutionary algorithms

The Google Artificial Intelligence (AI) Challenge is an international contest the objective of which is to program the AI in a two-player real time strategy (RTS) game. This AI is an autonomous computer program that governs the actions that one of the two players executes during the game according to the state of play. The entries are evaluated via a competition mechanism consisting of two-player rounds where each entry is tested against others. This paper describes the use of competitive coevolutionary (CC) algorithms for the automatic generation of winning game strategies in Planet Wars, the RTS game associated with the 2010 contest. Three different versions of a prime algorithm have been tested. Their common nexus is not only the use of a Hall-of-Fame (HoF) to keep note of the winners of past coevolutions but also the employment of an archive of experienced players, termed the hall-of-celebrities (HoC), that puts pressure on the optimization process and guides the search to increase the strength of the solutions; their differences come from the periodical updating of the HoF on the basis of quality and diversity metrics. The goal is to optimize the AI by means of a self-learning process guided by coevolutionary search and competitive evaluation. An empirical study on the performance of a number of variants of the proposed algorithms is described and a statistical analysis of the results is conducted. In addition to the attainment of competitive bots we also conclude that the incorporation of the HoC inside the primary algorithm helps to reduce the effects of cycling caused by the use of HoF in CC algorithms.This work is partially supported by Spanish MICINN under Project ANYSELF (TIN2011-28627-C04-01),3 by Junta de Andalucía under Project P10-TIC-6083 (DNEMESIS) and by Universidad de Málaga, Campus de Excelencia Internacional Andalucía Tech

Phylogenetic congruence between subtropical trees and their associated fungi.

Recent studies have detected phylogenetic signals in pathogen-host networks for both soil-borne and leaf-infecting fungi, suggesting that pathogenic fungi may track or coevolve with their preferred hosts. However, a phylogenetically concordant relationship between multiple hosts and multiple fungi in has rarely been investigated. Using next-generation high-throughput DNA sequencing techniques, we analyzed fungal taxa associated with diseased leaves, rotten seeds, and infected seedlings of subtropical trees. We compared the topologies of the phylogenetic trees of the soil and foliar fungi based on the internal transcribed spacer (ITS) region with the phylogeny of host tree species based on matK, rbcL, atpB, and 5.8S genes. We identified 37 foliar and 103 soil pathogenic fungi belonging to the Ascomycota and Basidiomycota phyla and detected significantly nonrandom host-fungus combinations, which clustered on both the fungus phylogeny and the host phylogeny. The explicit evidence of congruent phylogenies between tree hosts and their potential fungal pathogens suggests either diffuse coevolution among the plant-fungal interaction networks or that the distribution of fungal species tracked spatially associated hosts with phylogenetically conserved traits and habitat preferences. Phylogenetic conservatism in plant-fungal interactions within a local community promotes host and parasite specificity, which is integral to the important role of fungi in promoting species coexistence and maintaining biodiversity of forest communities

Open-ended Search through Minimal Criterion Coevolution

Search processes guided by objectives are ubiquitous in machine learning. They iteratively reward artifacts based on their proximity to an optimization target, and terminate upon solution space convergence. Some recent studies take a different approach, capitalizing on the disconnect between mainstream methods in artificial intelligence and the field\u27s biological inspirations. Natural evolution has an unparalleled propensity for generating well-adapted artifacts, but these artifacts are decidedly non-convergent. This new class of non-objective algorithms induce a divergent search by rewarding solutions according to their novelty with respect to prior discoveries. While the diversity of resulting innovations exhibit marked parallels to natural evolution, the methods by which search is driven remain unnatural. In particular, nature has no need to characterize and enforce novelty; rather, it is guided by a single, simple constraint: survive long enough to reproduce. The key insight is that such a constraint, called the minimal criterion, can be harnessed in a coevolutionary context where two populations interact, finding novel ways to satisfy their reproductive constraint with respect to each other. Among the contributions of this dissertation, this approach, called minimal criterion coevolution (MCC), is the primary (1). MCC is initially demonstrated in a maze domain (2) where it evolves increasingly complex mazes and solutions. An enhancement to the initial domain (3) is then introduced, allowing mazes to expand unboundedly and validating MCC\u27s propensity for open-ended discovery. A more natural method of diversity preservation through resource limitation (4) is introduced and shown to maintain population diversity without comparing genetic distance. Finally, MCC is demonstrated in an evolutionary robotics domain (5) where it coevolves increasingly complex bodies with brain controllers to achieve principled locomotion. The overall benefit of these contributions is a novel, general, algorithmic framework for the continual production of open-ended dynamics without the need for a characterization of behavioral novelty

Evolution of Swarm Robotics Systems with Novelty Search

Novelty search is a recent artificial evolution technique that challenges traditional evolutionary approaches. In novelty search, solutions are rewarded based on their novelty, rather than their quality with respect to a predefined objective. The lack of a predefined objective precludes premature convergence caused by a deceptive fitness function. In this paper, we apply novelty search combined with NEAT to the evolution of neural controllers for homogeneous swarms of robots. Our empirical study is conducted in simulation, and we use a common swarm robotics task - aggregation, and a more challenging task - sharing of an energy recharging station. Our results show that novelty search is unaffected by deception, is notably effective in bootstrapping the evolution, can find solutions with lower complexity than fitness-based evolution, and can find a broad diversity of solutions for the same task. Even in non-deceptive setups, novelty search achieves solution qualities similar to those obtained in traditional fitness-based evolution. Our study also encompasses variants of novelty search that work in concert with fitness-based evolution to combine the exploratory character of novelty search with the exploitatory character of objective-based evolution. We show that these variants can further improve the performance of novelty search. Overall, our study shows that novelty search is a promising alternative for the evolution of controllers for robotic swarms.Comment: To appear in Swarm Intelligence (2013), ANTS Special Issue. The final publication will be available at link.springer.co

Coevolutionary algorithms for the optimization of strategies for red teaming applications

Red teaming (RT) is a process that assists an organization in finding vulnerabilities in a system whereby the organization itself takes on the role of an “attacker” to test the system. It is used in various domains including military operations. Traditionally, it is a manual process with some obvious weaknesses: it is expensive, time-consuming, and limited from the perspective of humans “thinking inside the box”. Automated RT is an approach that has the potential to overcome these weaknesses. In this approach both the red team (enemy forces) and blue team (friendly forces) are modelled as intelligent agents in a multi-agent system and the idea is to run many computer simulations, pitting the plan of the red team against the plan of blue team. This research project investigated techniques that can support automated red teaming by conducting a systematic study involving a genetic algorithm (GA), a basic coevolutionary algorithm and three variants of the coevolutionary algorithm. An initial pilot study involving the GA showed some limitations, as GAs only support the optimization of a single population at a time against a fixed strategy. However, in red teaming it is not sufficient to consider just one, or even a few, opponent‟s strategies as, in reality, each team needs to adjust their strategy to account for different strategies that competing teams may utilize at different points. Coevolutionary algorithms (CEAs) were identified as suitable algorithms which were capable of optimizing two teams simultaneously for red teaming. The subsequent investigation of CEAs examined their performance in addressing the characteristics of red teaming problems, such as intransitivity relationships and multimodality, before employing them to optimize two red teaming scenarios. A number of measures were used to evaluate the performance of CEAs and in terms of multimodality, this study introduced a novel n-peak problem and a new performance measure based on the Circular Earth Movers‟ Distance. Results from the investigations involving an intransitive number problem, multimodal problem and two red teaming scenarios showed that in terms of the performance measures used, there is not a single algorithm that consistently outperforms the others across the four test problems. Applications of CEAs on the red teaming scenarios showed that all four variants produced interesting evolved strategies at the end of the optimization process, as well as providing evidence of the potential of CEAs in their future application in red teaming. The developed techniques can potentially be used for red teaming in military operations or analysis for protection of critical infrastructure. The benefits include the modelling of more realistic interactions between the teams, the ability to anticipate and to counteract potentially new types of attacks as well as providing a cost effective solution

Grammaticalization and phonological reidentification in White Hmong

The “dynamic coevolution of meaning and form” of Bybee et al. ( 1994 : 20) has been the subject of significant discussion as regards the languages of Mainland Southeast Asia. However, little work has focused on the mechanisms through which this coevolution occurs when it does surface in these languages. The current work considers phonological reidentification resulting from phonetic reduction in White Hmong (Hmong-Mien, Laos) involving four morphemes, ntshai/ntshe ‘maybe’, saib/seb ‘see if/whether; COMP.CFACT’, puag/pug ‘LOCL;INTS’, and niaj/nej ‘each, every’. These morphemes exhibit an alternation where a rime is phonologically reidentified in a manner consistent with typical phonetic underarticulation patterns, such that an exemplar-model approach (Pierrehumbert 2001 , inter alia) provides a straightforward explanation. Furthermore, the data show that the phonological reidentification patterns found in White Hmong exhibit parallels in other languages in the region, confirming that an areal approach to grammaticalization provides greater descriptive adequacy cross-linguistically as regards this phenomenon

Isolation and identification of bacterial endosymbionts in the brooding brittle star Amphipholis squamata

Symbiotic associations with subcuticular bacteria (SCB) have been identified and studied in numerous echinoderms, including the SCB of the brooding brittle star, Amphipholis squamata. These SCB, however, have not been studied using current next generation sequencing technologies. Previous studies on the SCB of A. squamata placed these bacteria in the genus Vibrio (γ-Proteobacteria), but subsequent studies suggested that the SCB are primarily composed of α-Proteobacteria. The present study examines the taxonomic composition of SCB associated with A. squamata from the Northwest Atlantic. DNA was extracted using a CTAB protocol and 16S rRNA sequences were amplified using gene-targeted PCR on an Illumina HiSeq at the UNH Genomics Center. Results show the presence of a single dominant bacterial type, within the family Rhodobacteraceae, which composes 70-80% of the A. squamata microbiome. The majority of sequences recovered from A. squamata were identified as members of the genus Octadecabacter (97% similarity). By comparison, adjacent seawater and sediment bacterial communities were significantly more diverse, hosting bacteria in the phyla Proteobacteria, Bacteroidetes, Cyanobacteria, Verrucomicrobia, and Actinobacteria. Thus, a distinct SCB community is clearly evident in A. squamata. Here, we hypothesize the potential functions of this symbiotic community, in addition to what may be driving the unique dominance of a member of the family Rhodobacteraceae. Although metatranscriptome studies are needed to characterize the functional attributes of the SCB community, we have identified a specific and potentially beneficial symbiont that may support metabolic requirements and nutrient uptake vital to the reproduction of A. squamata

Application of cooperative neuro - evolution of Elman recurrent networks for a two - dimensional cyclone track prediction for the South Pacific region

This paper presents a two-dimensional time series prediction approach for cyclone track prediction using cooperative neuro-evolution of Elman recurrent networks in the South Pacific region. The latitude and longitude of tracks of cyclone lifetime is taken into consideration for past three decades to build a robust forecasting system. The proposed method performs one step ahead prediction of the cyclone position which is essentially a two-dimensional time series prediction problem. The results show that the Elman recurrent network is able to achieve very good accuracy in terms of prediction of the tracks which can be used as means of taking precautionary measures