Multi-Agent Learning with a Distributed Genetic Algorithm
AAMAS 2008: ALAMAS+ALAg Workshop, Estoril, Portugal, May 12-16, 2008
8 Pages Posted: 21 May 2011
Date Written: 2008
Lightweight agents distributed in space have the potential to solve many complex problems. In this paper, we examine a model where agents represent individuals in a genetic algorithm (GA) solving a shared problem. We examine two questions: (1) How does the network density of connections between agents affect the performance of the systems? (2) How does the interaction topology aaffect the performance of the system? In our model, agents exist in either a random network topology with long-distance communication, or a location-based topology, where agents only communicate with near neighbors. We examine both fixed and dynamic networks. Within the context of our investigation, our initial results indicate that relatively low network density achieves the same results as a panmictic, or fully connected, population. Additionally, we find that dynamic networks outperform fixed networks, and that random network topologies outperform proximity-based network topologies. We conclude by showing how this model can be useful not only for multi-agent learning, but also for genetic algorithms, agent-based simulation and models of diffusion of innovation.
Keywords: multi-agent learning, genetic algorithms, networks, innovation, diffusion
Suggested Citation: Suggested Citation
Do you have negative results from your research you’d like to share?
By William Rand