Santa Fe Trail for Artificial Ant with Analytic Programming and Three Evolutionary Algorithms

The paper deals with a novelty tool for symbolic regression - analytic programming (AP) which is able to solve various problems from the symbolic regression domain. One of the tasks for it can be a setting an optimal trajectory for an artificial ant on Santa Fe trail which is the main application of analytic programming in this paper. In this contribution main principles of AP are described and explained. In the second part of the article how AP was used for a setting an optimal trajectory for the artificial ant according the user requirements is in detail described. An ability to create so called programs, as well as genetic programming (GP) or grammatical evolution (GE) do, is shown in that part. AP is a superstructure of evolutionary algorithms which are necessary to run AP. In this contribution 3 evolutionary algorithms were used - self organizing migrating algorithm, differential evolution and simulated annealing. The results show that the first two used algorithms were more successful than not so robust Simulated Annealing

[1]  John R. Koza,et al.  Genetic Programming II , 1992 .

[2]  Zuzana Kominkova Oplatkova.  Optimal trajectory of robots using symbolic regres... , 2005 .

[3]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[4]  Maarten Keijzer,et al.  Improving Symbolic Regression with Interval Arithmetic and Linear Scaling , 2003, EuroGP.

[5]  Colin G. Johnson.  Artificial Immune System Programming for Symbolic Regression , 2003, EuroGP.

[6]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[7]  Ivan Zelinka,et al.  Mechanical engineering design optimization by differential evolution , 1999 .

[8]  Conor Ryan,et al.  Grammatical Evolution , 2001, Genetic Programming Series.

[9]  Michael O'Neill,et al.  Grammatical evolution - evolutionary automatic programming in an arbitrary language , 2003, Genetic programming.

[10]  Vidroha Debroy,et al.  Genetic Programming , 1998, Lecture Notes in Computer Science.

[11]  Corso Elvezia.  Probabilistic Incremental Program Evolution , 1997 .

[12]  Michèle Sebag,et al.  Genetic Programming and Domain Knowledge: Beyond the Limitations of Grammar-Guided Machine Discovery , 2000, PPSN.

[13]  Ivan Zelinka,et al.  Boolean symmetry function synthesis by means of arbitrary evolutionary algorithms - comparative study , 2004 .

[14]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

[15]  Conor Ryan,et al.  An Investigation into the Use of Different Search Strategies with Grammatical Evolution , 2002, EuroGP.