18,661 research outputs found
Genetic algorithms for the generation of models with micropopulations
Proceedings of: EvoWorkshops 2003: EvoBIO, EvoCOP, EvoIASP, EvoMUSART, EvoROB, and EvoSTIM Essex, UK, April 14–16, 2003The present article puts forward a method for an interactive model generation through the use of Genetic Algorithms applied to small populations. Micropopulations actually worsen the problem of the premature convergence of the algorithm, since genetic diversity is very limited. In addition, some key factors, which modify the changing likelihood of alleles, cause the likelihood of premature convergence to decrease. The present technique has been applied to the design of 3D models, starting from generic and standard pieces, using objective searches and searches with no defined objective
Creativity and Autonomy in Swarm Intelligence Systems
This work introduces two swarm intelligence algorithms -- one mimicking the behaviour of one species of ants (\emph{Leptothorax acervorum}) foraging (a `Stochastic Diffusion Search', SDS) and the other algorithm mimicking the behaviour of birds flocking (a `Particle Swarm Optimiser', PSO) -- and outlines a novel integration strategy exploiting the local search properties of the PSO with global SDS behaviour. The resulting hybrid algorithm is used to sketch novel drawings of an input image, exploliting an artistic tension between the local behaviour of the `birds flocking' - as they seek to follow the input sketch - and the global behaviour of the `ants foraging' - as they seek to encourage the flock to explore novel regions of the canvas. The paper concludes by exploring the putative `creativity' of this hybrid swarm system in the philosophical light of the `rhizome' and Deleuze's well known `Orchid and Wasp' metaphor
Automating control system design via a multiobjective evolutionary algorithm
This chapter presents a performance-prioritized computer aided control system design (CACSD) methodology using a multi-objective evolutionary algorithm. The evolutionary CACSD approach unifies different control laws in both the time and frequency domains based upon performance satisfactions, without the need of aggregating different design criteria into a compromise function. It is shown that control engineers' expertise as well as settings on goal or priority for different preference on each performance requirement can be easily included and modified on-line according to the evolving trade-offs, which makes the controller design interactive, transparent and simple for real-time implementation. Advantages of the evolutionary CACSD methodology are illustrated upon a non-minimal phase plant control system, which offer a set of low-order Pareto optimal controllers satisfying all the conflicting performance requirements in the face of system constraints
SEPIA: Search for Proofs Using Inferred Automata
This paper describes SEPIA, a tool for automated proof generation in Coq.
SEPIA combines model inference with interactive theorem proving. Existing proof
corpora are modelled using state-based models inferred from tactic sequences.
These can then be traversed automatically to identify proofs. The SEPIA system
is described and its performance evaluated on three Coq datasets. Our results
show that SEPIA provides a useful complement to existing automated tactics in
Coq.Comment: To appear at 25th International Conference on Automated Deductio
Mining State-Based Models from Proof Corpora
Interactive theorem provers have been used extensively to reason about
various software/hardware systems and mathematical theorems. The key challenge
when using an interactive prover is finding a suitable sequence of proof steps
that will lead to a successful proof requires a significant amount of human
intervention. This paper presents an automated technique that takes as input
examples of successful proofs and infers an Extended Finite State Machine as
output. This can in turn be used to generate proofs of new conjectures. Our
preliminary experiments show that the inferred models are generally accurate
(contain few false-positive sequences) and that representing existing proofs in
such a way can be very useful when guiding new ones.Comment: To Appear at Conferences on Intelligent Computer Mathematics 201
Adaptive Evolutionary Clustering
In many practical applications of clustering, the objects to be clustered
evolve over time, and a clustering result is desired at each time step. In such
applications, evolutionary clustering typically outperforms traditional static
clustering by producing clustering results that reflect long-term trends while
being robust to short-term variations. Several evolutionary clustering
algorithms have recently been proposed, often by adding a temporal smoothness
penalty to the cost function of a static clustering method. In this paper, we
introduce a different approach to evolutionary clustering by accurately
tracking the time-varying proximities between objects followed by static
clustering. We present an evolutionary clustering framework that adaptively
estimates the optimal smoothing parameter using shrinkage estimation, a
statistical approach that improves a naive estimate using additional
information. The proposed framework can be used to extend a variety of static
clustering algorithms, including hierarchical, k-means, and spectral
clustering, into evolutionary clustering algorithms. Experiments on synthetic
and real data sets indicate that the proposed framework outperforms static
clustering and existing evolutionary clustering algorithms in many scenarios.Comment: To appear in Data Mining and Knowledge Discovery, MATLAB toolbox
available at http://tbayes.eecs.umich.edu/xukevin/affec
Creative or Not? Birds and Ants Draw with Muscle
In this work, a novel approach of merging two swarm intelligence algorithms is considered – one mimicking the behaviour of ants foraging (Stochastic Diffusion Search [5]) and the other algorithm simulating the behaviour of birds flocking (Particle Swarm Optimisation [17]). This hybrid algorithm is assisted by a mechanism inspired from the behaviour of skeletal muscles activated by motor neurons. The operation of the swarm intelligence algorithms is first introduced via metaphor before the new hybrid algorithm is defined. Next, the novel behaviour of the hybrid algorithm is reflected through a cooperative attempt to make a drawing, followed by a discussion about creativity in general and the ’computational creativity’ of the swarm
- …