Strongly Typed Genetic Programming in Evolving Cooperation Strategies
نویسندگان
چکیده
A key concern in genetic programming GP is the size of the state space which must be searched for large and complex problem do mains One method to reduce the state space size is by using Strongly Typed Genetic Programming STGP We applied both GP and STGP to construct cooperation strate gies to be used by multiple predator agents to pursue and capture a prey agent on a grid world This domain has been extensively studied in Distributed Arti cial Intelligence DAI as an easy to describe but di cult to solve cooperation problem The evolved programs from our systems are competitive with manually derived greedy algorithms In particular the STGP paradigm evolved strategies in which the predators were able to achieve their goal without explicitly sens ing the location of other predators or com municating with other predators This is an improvement over previous research in this area The results of our experiments indicate that STGP is able to evolve programs that perform signi cantly better than GP evolved programs In addition the programs gener ated by STGP were easier to understand
منابع مشابه
Evolving Teleo-Reactive Programs for Block Stacking using Indexicals through Genetic Programming
This paper demonstrates how strongly-typed genetic programming may be used to evolve valid teleo-reactive programs that solve the general block-stacking problem using indexicals.
متن کاملDesigning Pheromone Update Strategies with Strongly Typed Genetic Programming
Ant Colony algorithms are population-based methods widely used in combinatorial optimization problems. We propose a strongly typed genetic programming approach to automatically evolve the communication mechanism that allows ants to cooperatively solve a given problem. Results obtained with several TSP instances show that the evolved pheromone update strategies are effective, exhibit a good gene...
متن کاملFunctional genetic programming and exhaustive program search with combinator expressions
Using a strongly typed functional programming language for genetic programming has many advantages, but evolving functional programs with variables requires complex genetic operators with special cases to avoid creating ill-formed programs. We introduce combinator expressions as an alternative program representation for genetic programming, providing the same expressive power as strongly typed ...
متن کاملEvolving Control Laws for a Network of Traffic Signals
Optimally controlling the timings of traffic signals within a network of intersections is a difficult but important problem. Because the traffic signals need to coordinate their behavior to achieve the common goal of optimizing traffic flow through the network, this is a problem in collective intelligence. We apply a hybrid of a genetic algorithm and strongly typed genetic programming (STGP) to...
متن کاملEvolving High-Level Imperative Program Trees with Strongly Formed Genetic Programming
We present a set of extensions to Montana’s popular Strongly Typed Genetic Programming system that introduce constraints on the structure of program trees. It is demonstrated that these constraints can be used to evolve programs with a naturally imperative structure, using common high-level imperative language constructs such as loops. A set of three problems including factorial and the general...
متن کامل