Comparison Of Different Cooperation Strategies in the Prey-Predator Problem

Abstract

The paper describes two cooperating strategies among several homogeneous agents to reach a given target. In our case we used the prey-predators paradigm in which a set of agents (predators) have the purpose to reach a target (prey). The problem is addressed as an optimization problem that has been faced with two different algorithms (a genetic algorithm and a particle swam optimization algorithm). The two approaches are evaluated by using a simulator for each strategy and the results show that the strategies are very different in terms of prey-predator successes. Genetic algorithm can be used by the prey to solve at the best the problem to reach the lair, otherwise the Particle Swarm Optimization method allows the predator to reach a target in a fast way.