Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
The evolution of mental models
Advances in genetic programming
Concurrent Genetic Programming, Tartarus and Dancing Agents
Proceedings of the Second European Workshop on Genetic Programming
Strongly typed genetic programming
Evolutionary Computation
Sustaining diversity using behavioral information distance
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part I
Genetic programming needs better benchmarks
Proceedings of the 14th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
Recent work in genetic programming (GP) has highlighted the need for stronger benchmark problems. For benchmarking planning scenarios, the artificial ant problem is often used. With a limited number of test cases, this problem is often fairly simple to solve. A more complex planning problem is Tartarus, but as of yet no standard representation for Tartarus exists for GP. This paper examines an existing parse tree representation for Tartarus, and identifies weaknesses in the way in which it manipulates environmental information. Through this analysis, an alternative representation is proposed for Tartarus that shares many similarities with those already used in GP for planning problems. Empirical analysis suggests that the proposed representation has qualities that make it a suitable benchmark problem.