Genetic programming (videotape): the movie
Genetic programming (videotape): the movie
Mechanical engineering design optimization by differential evolution
New ideas in optimization
Genetic Programming III: Darwinian Invention & Problem Solving
Genetic Programming III: Darwinian Invention & Problem Solving
An Investigation into the Use of Different Search Strategies with Grammatical Evolution
EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language
Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Investigation on artificial ant using analytic programming
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Probabilistic incremental program evolution
Evolutionary Computation
Artificial immune system programming for symbolic regression
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Hi-index | 0.00 |
This paper deals with usage of an alternative tool for symbolic regression--analytic programming which is able to solve various problems from the symbolic domain, as well as genetic programming and grammatical evolution. This paper describes a setting of an optimal trajectory for a robot (originally designed as an artificial ant on Santa Fe trail) solved by means of analytic programming. Firstly, main principles of analytic programming are described and explained. The second part shows how analytic programming was used for the application of finding a suitable trajectory step by step. Because analytic programming needs evolutionary algorithms for its run, three evolutionary algorithms were used--self-organizing migrating algorithm, differential evolution, and simulated annealing--to show that anyone can be used. The total number of simulations was 150 and results show that the first two used algorithms were more successful than not so robust simulated annealing.