The fast multipole method (FMM) performs fast approximate kernel summation to a specified tolerance ǫ by using a hierarchical division of the domain, which groups source and receiver points into regions that satisfy local separation and the well-separated pair decomposition properties. While square tilings and quadtrees are commonly used in 2D, we investigate alternative tilings and associated ...

We present an external-memory algorithm to compute a well-separated pair decomposition (WSPD) of a given point set S in Rd in O(sort(N)) I/Os, where N is the number of points in S and sort(N) denotes the I/O-complexity of sorting N items. (Throughout this paper, we assume that the dimension d is fixed). As applications of the WSPD, we show how to compute a linear-size t-spanner for S within the...

A method is given for the systematic generation of graphs representing known or hypothetical polyhedral topologies of crystals. The method is complete for some interesting types of polyhedral topologies insofar as all topologies which are possible under reasonable assumptions concerning crystal properties are generated. Restriction modules can be coupled with the enumeration algorithm such that...

This paper presents the three topologies of three-phase four-wire DSTATCOM for reduction of harmonics, reactive power compensation, increasing power factor, which occur due to a nonlinear load, environment problem and polluted grid. The performances of the above topologies have been compared for the magnitude of source current, power factor improvement, DC-link voltage regulation, and total har...

In this article we present EANT, “Evolutionary Acquisition of Neural Topologies”, a method that creates neural networks (NNs) by evolutionary reinforcement learning. The structure of NNs is developed using mutation operators, starting from a minimal structure. Their parameters are optimised using CMA-ES. EANT can create NNs that are very specialised; they achieve a very good performance while b...

Real-Time Strategy (RTS) games have become an attractive domain for AI research in recent years, due to their dynamic, multi-agent and multi-objective environments. Micromanagement, a core component of many RTS games, involves the control of multiple agents to accomplish goals that require fast, real time assessment and reaction. In this paper, we present the application and evaluation of a Neu...

We demonstrate that neural agents can evolve behavioral sequences of arbitrary length. In our framework, agents in a two-dimensional arena have to find the secure one among two possible patches, and which of them is secure changes over time. Evolution of arbitrarily long behavioral sequences is achieved by extending the neuroevolution method NEAT with two techniques: Only newly evolved network ...

In this paper, we examine the effect of fitness functions on the ability of a robot evolved with NEAT (NeuroEvolution of Augmenting Topologies) to find a light in a simple maze. By varying the fitness function used to determine a genotype’s likelihood of persisting in the next generation, we propose to look at how a robot’s solution to a task is influenced by the prevalence of intermediate and ...

Learning complex behaviour is a difficult task for any artificial agent. Decomposing a task into multiple sub-tasks, learning the sub-tasks separately, and then learning to use them as a whole is a natural way to reduce the dimensionality and complexity of the task function. This approach is demonstrated on a predator agent in the predator-prey-hunter domain. This extended domain has a new agen...