Autonomous Evolution of Digital Art Using Genetic Algorithms

2016 ◽  
Vol 25 (3) ◽  
pp. 319-333 ◽  
Author(s):  
Amanda House ◽  
Arvin Agah
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Fitness Function ◽  
Digital Art ◽  
Human In The Loop ◽  
Fitness Functions ◽  
Wide Range ◽  
Autonomous Evolution

AbstractThis paper applies a genetic algorithm (GA) to the autonomous evolution of digital art, eliminating the need for a human in the loop. Creative applications of GAs face the challenge of producing art or music to fit a wide range of human tastes. One approach is to use a human in the loop to determine the fitness function in order to direct the selection and evolution. Another approach, which this paper explores, is to define an objective fitness function to automate evolution without the need for human input. In this paper, several features of digital art are identified and used as the basis for fitness functions. The resulting images are recognizable for the intended evolution of the fitness function used. This indicates the potential of an approach to create more robust algorithmic fitness functions capable of evolving creative applications autonomously.

scholarly journals ABOUT FEATURES OF MUTATION APPLICATION IN A MODIFIED OPERATOR GENETIC ALGORITHM

2020 ◽  
Author(s):  
Leonid Oliinyk ◽  
Stanislav Bazhan
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Optimization Problems ◽  
Fitness Function ◽  
Stochastic Matrices ◽  
Global Extremum ◽  
Modified Genetic Algorithm ◽  
Wide Range ◽  
Search Field ◽  
The Impact

Genetic algorithm is a method of optimization based on the concepts of natural selection and genetics. Genetic algorithms are used in software development, in artificial intelligence systems, a wide range of optimization problems and in other fields of knowledge.One of the important issues in the theory of genetic algorithms and their modified versions is the search for the best balance between performance and accuracy. The most difficult in this sense are problems where the fitness function in the search field has many local extremes and one global or several global extremes that coincide.The effectiveness of the genetic algorithm depends on various factors, such as the successful creation of the primary population. Also in the theory of genetic algorithms, recombination methods play an important role to obtain a better population of offspring. The aim of this work is to study some types of mutations using a modified genetic algorithm to find the minimum function of one variable.The article presents the results of research and analysis of the impact of some mutation procedures. Namely, the effect of mutation on the speed of achieving the solution of the problem of finding the global extremum of a function of one variable. For which a modified genetic algorithm is used, where the operators of the "generalized crossover" are stochastic matrices

scholarly journals Application of Genetic Algorithm Elements to Modelling of Rotation Processes in Motion Transmission Including a Long Shaft

Energies ◽  
2020 ◽  
Vol 14 (1) ◽  
pp. 115
Author(s):  
Andriy Chaban ◽  
Marek Lis ◽  
Andrzej Szafraniec ◽  
Radoslaw Jedynak
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Fitness Function ◽  
Least Square ◽  
Distributed Parameter ◽  
Parameter Method ◽  
Analytical Mechanics ◽  
Parameter System ◽  
Rotational Systems ◽  
Elastic Elements

Genetic algorithms are used to parameter identification of the model of oscillatory processes in complicated motion transmission of electric drives containing long elastic shafts as systems of distributed mechanical parameters. Shaft equations are generated on the basis of a modified Hamilton–Ostrogradski principle, which serves as the foundation to analyse the lumped parameter system and distributed parameter system. They serve to compute basic functions of analytical mechanics of velocity continuum and rotational angles of shaft elements. It is demonstrated that the application of the distributed parameter method to multi-mass rotational systems, that contain long elastic elements and complicated control systems, is not always possible. The genetic algorithm is applied to determine the coefficients of approximation the system of Rotational Transmission with Elastic Shaft by equivalent differential equations. The fitness function is determined as least-square error. The obtained results confirm that application of the genetic algorithms allow one to replace the use of a complicated distributed parameter model of mechanical system by a considerably simpler model, and to eliminate sophisticated calculation procedures and identification of boundary conditions for wave motion equations of long elastic elements.

scholarly journals Strategic Team AI Path Plans: Probabilistic Pathfinding

2008 ◽  
Vol 2008 ◽  
pp. 1-6 ◽  
Author(s):  
Tng C. H. John ◽  
Edmond C. Prakash ◽  
Narendra S. Chaudhari
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Computer Games ◽  
Fitness Function ◽  
New Method ◽  
High Quality ◽  
Plan Generation ◽  
Novel Method ◽  
Games And Simulations

This paper proposes a novel method to generate strategic team AI pathfinding plans for computer games and simulations using probabilistic pathfinding. This method is inspired by genetic algorithms (Russell and Norvig, 2002), in that, a fitness function is used to test the quality of the path plans. The method generates high-quality path plans by eliminating the low-quality ones. The path plans are generated by probabilistic pathfinding, and the elimination is done by a fitness test of the path plans. This path plan generation method has the ability to generate variation or different high-quality paths, which is desired for games to increase replay values. This work is an extension of our earlier work on team AI: probabilistic pathfinding (John et al., 2006). We explore ways to combine probabilistic pathfinding and genetic algorithm to create a new method to generate strategic team AI pathfinding plans.

scholarly journals Application of the genetic algorithm to the task of compiling the curriculum

2018 ◽  
Author(s):  
V. A. Turchina ◽  
D. O. Tanasienko
Keyword(s):  
Higher Education ◽  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Necessary Conditions ◽  
Fitness Function ◽  
Educational Process ◽  
Heuristic Methods ◽  
Educational Groups ◽  
The Individual ◽  
Negative Property

One of the main tasks in organizing the educational process in higher education is the drawing up of a schedule of classes. It reflects the weekly student and faculty load. At the same time, when compiling, there are a number of necessary conditions and a number of desirable. The paper considers seven required and four desirable conditions. In this paper, one of the well-known approaches that can be used in drawing up a curriculum is consid-ered. The proposed scheme of the genetic algorithm, the result of which is to obtain an approximate solution to the problem of scheduling with the need to further improve it by other heuristic methods. To solve the problem, an island model of the genetic algorithm was selected and its advantages were considered. In the paper, the author's own structure of the individual, which includes chromosomes in the form of educational groups and genes as a lesson at a certain time, is presented and justified. The author presents his own implementations of the genetic algorithms. During the work, many variants of operators were tested, but they were rejected due to their inefficiency. The biggest problem was to maintain the consistency of information encoded in chromosomes. Also, two post-steps were added: to try to reduce the number of teacher conflict conflicts and to normalize the schedule - to remove windows from the schedule. The fitness function is calculated according to the following principles: if some desired or desired property is present in the individual, then a certain number is deducted from the individual's assessment, if there is a negative property, then a certain number is added to the assessment. Each criterion has its weight, so the size of the fine or rewards may be different. In this work, fines were charged for non-fulfillment of mandatory conditions, and rewards for fulfilling the desired

scholarly journals PENENTUAN PARAMETER LEARNING RATE SELAMA PEMBELAJARAN JARINGAN SYARAF TIRUAN BACKPROPAGATION MENGGUNAKAN ALGORITMA GENETIKA

2020 ◽  
Vol 14 (2) ◽  
pp. 202-212
Author(s):  
Ade chandra Saputra
Keyword(s):  
Neural Network ◽  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Fitness Function ◽  
Learning Rate ◽  
Local Minima ◽  
Rate Parameter ◽  
Neural Network Learning ◽  
Value Of Learning ◽  
Backpropagation Learning

One of the weakness in backpropagation Artificial neural network(ANN) is being stuck in local minima. Learning rate parameter is an important parameter in order to determine how fast the ANN Learning. This research is conducted to determine a method of finding the value of learning rate parameter using a genetic algorithm when neural network learning stops and the error value is not reached the stopping criteria or has not reached the convergence. Genetic algorithm is used to determine the value of learning rate used is based on the calculation of the fitness function with the input of the ANN weights, gradient error, and bias. The calculation of the fitness function will produce an error value of each learning rate which represents each candidate solutions or individual genetic algorithms. Each individual is determined by sum of squared error value. One with the smallest SSE is the best individual. The value of learning rate has chosen will be used to continue learning so that it can lower the value of the error or speed up the learning towards convergence. The final result of this study is to provide a new solution to resolve the problem in the backpropagation learning that often have problems in determining the learning parameters. These results indicate that the method of genetic algorithms can provide a solution for backpropagation learning in order to decrease the value of SSE when learning of ANN has been static in large error conditions, or stuck in local minima

A Multiple Objective Fitness Function Design Scheme for GA-Based Cognitive Engines

2015 ◽  
Vol 764-765 ◽  
pp. 444-447
Author(s):  
Keun Hong Chae ◽  
Hua Ping Liu ◽  
Seok Ho Yoon
Keyword(s):  
Genetic Algorithm ◽  
Parameter Optimization ◽  
Fitness Function ◽  
Multiple Objective ◽  
Cognitive Engine ◽  
Fitness Functions ◽  
Design Scheme ◽  
Transmission Parameter ◽  
Function Design ◽  
Single Objective

In this paper, we propose a multiple objective fitness function for cognitive engines by using the genetic algorithm (GA). Specifically, we propose four single objective fitness functions, and finally, we propose a multiple objective fitness function based on the single objective fitness functions for transmission parameter optimization. Numerical results demonstrate that we can obtain transmission parameter sets optimized for given transmission scenarios with the GA-based cognitive engine incorporating the proposed objective fitness function.

Where Genetic Algorithms Excel

2001 ◽  
Vol 9 (1) ◽  
pp. 93-124 ◽  
Author(s):  
Eric B. Baum ◽  
Dan Boneh ◽  
Charles Garrett
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Selective Breeding ◽  
Population Distribution ◽  
Fitness Function ◽  
Mean Field ◽  
Search Problem ◽  
Parallel Search ◽  
Type Algorithm ◽  
Insight Into

We analyze the performance of a genetic algorithm (GA) we call Culling, and a variety of other algorithms, on a problem we refer to as the Additive Search Problem (ASP). We show that the problem of learning the Ising perceptron is reducible to a noisy version of ASP. Noisy ASP is the first problem we are aware of where a genetic-type algorithm bests all known competitors. We generalize ASP to k-ASP to study whether GAs will achieve “implicit parallelism” in a problem with many more schemata. GAs fail to achieve this implicit parallelism, but we describe an algorithm we call Explicitly Parallel Search that succeeds. We also compute the optimal culling point for selective breeding, which turns out to be independent of the fitness function or the population distribution. We also analyze a mean field theoretic algorithm performing similarly to Culling on many problems. These results provide insight into when and how GAs can beat competing methods.

QoS Routing Optimization Based on Improved Genetic Algorithm

2014 ◽  
Vol 998-999 ◽  
pp. 1169-1173
Author(s):  
Chang Lin He ◽  
Yu Fen Li ◽  
Lei Zhang
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Computational Complexity ◽  
Fitness Function ◽  
Qos Routing ◽  
Experimental Results ◽  
Improved Genetic Algorithm ◽  
Coding Schemes ◽  
Routing Optimization

A improved genetic algorithm is proposed to QoS routing optimization. By improving coding schemes, fitness function designs, selection schemes, crossover schemes and variations, the proposed method can effectively reduce computational complexity and improve coding accuracy. Simulations are carried out to compare our algorithm with the traditional genetic algorithms. Experimental results show that our algorithm converges quickly and is reliable. Hence, our method vastly outperforms the traditional algorithms.

scholarly journals Optimasi Pendistribusian Kelas Pada Dosen di STMIK STIKOM Indonesia Menggunakan Algoritma Genetika

2019 ◽  
Vol 2 (1) ◽  
pp. 145-154
Author(s):  
Aniek Suryanti Kusuma ◽  
Komang Sri Aryati
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Genetic Parameters ◽  
Fitness Function ◽  
Genetic Process ◽  
Fitness Value ◽  
Distribution Process ◽  
Class Scheduling ◽  
System Requirements

The stage of class scheduling starts from scheduling courses in classes, then distributing the class to lecturers. The process of distributing classes to lecturers becomes an obstacle for the STMIK STIKOM Indonesia academic body because the academic body must adjust the existing class with the lecturer who is interested in it as well as the lecturer chosen to support a class so that it does not have classes that have a time conflict. One method for solving these problems is by using genetic algorithms that work by generating a number of random solutions and then processing the collection of solutions in a genetic process. There are eight genetic algorithm procedures, which are random chromosome generation procedures, chromosome repair to validate chromosomes from their limits, fitness function to calculate the feasibility of a solution, crossover, mutation, child repair and elitism. The output of this research is in the form of an analysis and determination of the system requirements that must exist. In addition, it produces a trial report on the effect of genetic parameters to determine the effect of changes in the value of genetic parameters on the fitness value and the time used to carry out the distribution process.  

scholarly journals Using computation to enhance diagnosis and therapy: a novel mutation operator for real-coded adaptive genetic algorithms

F1000Research ◽  
2013 ◽  
Vol 2 ◽  
pp. 139
Author(s):  
Maxinder S Kanwal ◽  
Avinash S Ramesh ◽  
Lauren A Huang
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Mutation Rate ◽  
Novel Mutation ◽  
Fitness Function ◽  
Genetic Disorders ◽  
Optimal Solution ◽  
Global Optimum ◽  
Adaptive Mutation ◽  
Local Optima

The fields of molecular biology and neurobiology have advanced rapidly over the last two decades. These advances have resulted in the development of large proteomic and genetic databases that need to be searched for the prediction, early detection and treatment of neuropathologies and other genetic disorders. This need, in turn, has pushed the development of novel computational algorithms that are critical for searching genetic databases. One successful approach has been to use artificial intelligence and pattern recognition algorithms, such as neural networks and optimization algorithms (e.g. genetic algorithms). The focus of this paper is on optimizing the design of genetic algorithms by using an adaptive mutation rate based on the fitness function of passing generations. We propose a novel pseudo-derivative based mutation rate operator designed to allow a genetic algorithm to escape local optima and successfully continue to the global optimum. Once proven successful, this algorithm can be implemented to solve real problems in neurology and bioinformatics. As a first step towards this goal, we tested our algorithm on two 3-dimensional surfaces with multiple local optima, but only one global optimum, as well as on the N-queens problem, an applied problem in which the function that maps the curve is implicit. For all tests, the adaptive mutation rate allowed the genetic algorithm to find the global optimal solution, performing significantly better than other search methods, including genetic algorithms that implement fixed mutation rates.

Sign in / Sign up

Export Citation Format

Share Document