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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Goebels, A., Weimer, A., Priesterjahn, S.: Using cellular automata with evolutionary learned rules to solve the online partitioning problem. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2005), Edinburgh, pp. 837–843 (2005)
Panait, L., Luke, S.: Cooperative multi-agent learning: The state of the art. In: Technical Report GMU-CS-TR-2003-1, George Mason University, USA (2003)
Gacs, P., Kurdyumov, G.L., Levin, L.: One-dimensional uniform arrays that wash out finite islands. In: Problemy Peredachi Informatsii, vol. 12, pp. 92–98 (1978)
Goebels, A., Büning, H.K., Priesterjahn, S., Weimer, A.: Towards online partitioning of agent sets based on local information. In: Proceedings of the International Conference on Parallel and Distributed Computing and Networks (PDCN), Innsbruck, Austria (2005)
Mitchell, M., Hraber, P.T., Crutchfield, J.P.: Revisiting the edge of chaos: Evolving cellular automata to perform computations (1993)
Boris, J.: A vectorized ’near neighbors’ algorithm of order n using a monotonic logical grid. J. Comput. Phys. 66, 1–20 (1986)
Andre, D., Bennett III, F., Koza, J.: Discovery by genetic programming of a cellular automata rule that is better than any known rule for the majority classification problem. In: Proceedings of the First Annual Conference on Genetic Programming. MIT Press, Cambridge (1996)
Juille, H., Pollack, J.: Coevolving the ideal trainer: Application to the discovery of cellular automata rules. In: Proceedings of the Third Annual Genetic Programming Conference (GP 1998) (1998)
Pagie, L., Mitchell, M.: A comparison of evolutionary and coevolutionary search. In: Belew, R.K., Juillé, H. (eds.) Coevolution: Turning Adaptive Algorithms upon Themselves, USA, pp. 20–25 (2001)
Werfel, J., Mitchell, M., Crutchfield, J.: Resource sharing and coevolution in evolving cellular automata. IEEE Transactions on Evolutionary Computation 4(4), 388 (2000)
Kirchner, M.: Genetisch gesteuertes Lernen von Regeln für eindimensionale zelluläre Automaten. Bachelor thesis, Universität Paderborn (2005)
Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence - From natural to artificial Systems. Oxford University Press, Oxford (1999)
Kennedy, J., Eberhart, R.C.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001)
Wang, Y., Li, X.Y.: Distributed spanner with bounded degree for wireless ad hoc networks. In: Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing (2002)
Eppstein, D.: Spanning trees and spanners. Technical Report Technical Report 96-16, University of California, Dept. Information and Computer Science (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goebels, A. (2006). A Mapping Function to Use Cellular Automata for Solving MAS Problems. In: Jiao, L., Wang, L., Gao, X., Liu, J., Wu, F. (eds) Advances in Natural Computation. ICNC 2006. Lecture Notes in Computer Science, vol 4222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881223_8
Download citation
DOI: https://doi.org/10.1007/11881223_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45907-1
Online ISBN: 978-3-540-45909-5
eBook Packages: Computer ScienceComputer Science (R0)