From Reactive Multi-Agent models to Cellular Automata - Illustration on a Diffusion-Limited Aggregation model

International audienceThis paper deals with the synchronous implementation of situated Multi-Agent Systems (MAS) in order to have no execution bias and to allow their programming on massively parallel computing devices. For this purpose we investigate the translation of discrete MAS into Cellular Automata (CA). Contrarily to the sequential scheduling generally used in MAS simulations, CA is a model for massively parallel computing where the updating of the components is synchronous. However, CA expressivity is limited and not adapted to build models where independent entities may move and act on neighbor cells. After illustrating these issues on a simple example, we propose a generic method to translate discrete MAS into CA, called transactional CA. Our approach consists in translating MAS specified with the influence-reaction model into a transactional CA

Proceedings of AUTOMATA 2010: 16th International workshop on cellular automata and discrete complex systems

International audienceThese local proceedings hold the papers of two catgeories: (a) Short, non-reviewed papers (b) Full paper