Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Cellular automata for reaction-diffusion systems
Parallel Computing - Special issue: cellular automata
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
Communications of the ACM
Computing in nonlinear media and automata collectives
Computing in nonlinear media and automata collectives
Very Large Scale Spatial Computing
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Gathering of asynchronous robots with limited visibility
Theoretical Computer Science
Impossibility of gathering by a set of autonomous mobile robots
Theoretical Computer Science
| Hi-index | 0.00 |
We consider here the feasibility of gathering multiple computational resources by means of decentralized and simple local rules. We study such decentralized gathering by means of a stochastic model inspired from biology: the aggregation of the Dictyostelium discoideum cellular slime mold. The environment transmits information according to a reaction-diffusion mechanism and the agents move by following excitation fronts. Despite its simplicity this model exhibits interesting properties of self-organization and robustness to obstacles. We first describe the FPGA implementation of the environment alone, to perform large scale and rapid simulations of the complex dynamics of this reaction-diffusion model. Then we describe the FPGA implementation of the environment together with the agents, to study the major challenges that must be solved when designing a fast embedded implementation of the decentralized gathering model. We analyze the results according to the different goals of these hardware implementations.