Automatic Discovery of Algorithms for Multi-Agent Systems
Delft University of Technology, Delft, The Netherlands
EcoMASS Workshop at GECCO, 2012
@article{van2012automatic,
title={Automatic Discovery of Algorithms for Multi-Agent Systems},
author={van Berkel, S. and Turi, D. and Pruteanu, A. and Dulman, S.},
year={2012}
}
Automatic algorithm generation for large-scale distributed systems is one of the holy grails of artificial intelligence and agent-based modeling. It has direct applicability in future engineered (embedded) systems, such as mesh networks of sensors and actuators where there is a high need to harness their capabilities via algorithms that have good scalability characteristics. NetLogo has been extensively used as a teaching and research tool by computer scientists, for example for exploring distributed algorithms. Inventing such an algorithm usually involves a tedious reasoning process for each individual idea. In this paper, we report preliminary results in our effort to push the boundary of the discovery process even further, by replacing the classical approach with a guided search strategy that makes use of genetic programming targeting the NetLogo simulator. The effort moves from a manual model implementation to an automated discovery process. The only activity that is required is the implementation of primitives and the configuration of the tool-chain. In this paper, we explore the capabilities of our framework by re-inventing five well-known distributed algorithms.
May 9, 2012 by hgpu
