A mapping function to use cellular automata for solving MAS problems

Authors:
Andreas Goebels
Affiliations:
International Graduate School of Dynamic Intelligent Systems, Knowledge Based Systems, University of Paderborn, Germany
Venue:
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
Year:
2006

Citing 6
Cited 0

A vectorized "near neighbors" algorithm of order N using a monotonic logical grid

Journal of Computational Physics
Swarm intelligence: from natural to artificial systems

Swarm intelligence: from natural to artificial systems
Swarm intelligence

Swarm intelligence
Distributed Spanner with Bounded Degree for Wireless Ad Hoc Networks

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Discovery by genetic programming of a cellular automata rule that is better than any known rule for the majority classification problem

GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
Resource sharing and coevolution in evolving cellular automata

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cellular automata are a very powerful and well researched area in computer science. We use approaches from the cellular automata research to solve optimization problems in the multi agent system research area. For this purpose, we require a transformation from agents located in an Euclidean space into an abstract cell assignment for cellular automata. In this paper, a mapping function is presented and evaluated with a reverse function. This function can be calculated by each agent individually based only on local information. Additionally, we examine the performance of the function in inexact and non-deterministic environments.