Abstract
The goal of our investigation is to find automatically the absolutely best rule for a moving creature in a cellular field. The task of the creature is to visit all empty cells with a minimum number of steps. We call this problem creature’s exploration problem. The behaviour was modelled using a variable state machine represented by a state table. Input to the state table is the current state and the neighbour’s state in front of the creature’s moving direction. The problem is that the search space for the possible rules grows exponentially with the number of states, inputs and outputs. We could solve the problem for six states, two inputs and two outputs with the aid of a parallel hardware platform (FPGA technology). The set of all possible n-state algorithms was first reduced by discarding equivalent, reducible and not strongly connected ones. The algorithms which showed a certain performance for five initial configurations during simulation were extracted by the hardware and send to the host PC. Additional tests for robustness and the behaviour of several creatures was carried out in software. One creature with the best algorithm can visit 99.92 % of the empty cells of 26 test configurations. Several creatures up to 16 can perform the task more efficiently for the tested initial configuration.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Mesot, B., Sanchez, E., Pena, C.A., Perez-Uribe, A.: SOS++: Finding Smart Behaviors Using Learning and Evolution. In: Standish, Abbass, Bedau (eds.) Artificial Life VIII, p. 264. MIT Press, Cambridge (2002)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Halbach, M., Heenes, W., Hoffmann, R., Tisje, J.: Optimizing the Behavior of a Moving Creature in Software and in Hardware. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 841–850. Springer, Heidelberg (2004)
Halbach, M., Hoffmann, R.: Optimal Behavior of a Moving Creature in the Cellular Automata Model. In: Malyshkin, V.E. (ed.) PaCT 2005. LNCS, vol. 3606, pp. 129–140. Springer, Heidelberg (2005)
Halbach, M., Heenes, W., Hoffmann, R.: Implementation of the Massively Parallel Model GCA. In: Parallel Computing in Electrical Engineering (PARELEC), Parallel System Architectures (2004)
Halbach, M., Hoffmann, R.: Implementing Cellular Automata in FPGA Logic. In: International Parallel & Distributed Processing Symposium (IPDPS), Workshop on Massively Parallel Processing (WMPP), IEEE Computer Society, Los Alamitos (2004)
Hochberger, C.: CDL – Eine Sprache für die Zellularverarbeitung auf verschiedenen Zielplattformen. PhD thesis, TU Darmstadt, Darmstädter Dissertation D17 (1998)
Hilbert, D.: Ueber die stetige Abbildung einer Linie auf ein Flachenstück. In: Mathematische Annalen, vol. 38, pp. 459–460. Springer, Heidelberg (1891)
Peano, G.: Sur une courbe, qui remplit une aire plane. In: Mathematische Annalen, vol. 36, pp. 157–160. Springer, Heidelberg (1890)
Halbach, M., Hoffmann, R.: Minimising the Hardware Resources for a Cellular Automaton with Moving Creatures. In: PARS Newsletter (2006)
Hoffmann, R., Ulmann, B., Völkmann, K.P., Waldschmidt, S.: A Stream Processor Architecture Based on the Configurable CEPRA-S. In: Grünbacher, H., Hartenstein, R.W. (eds.) FPL 2000. LNCS, vol. 1896, Springer, Heidelberg (2000)
Waldschmidt, S., Hochberger, C.: FPGA synthesis for cellular processing. In: IEEE/ACM International Workshop on Logic Synthesis, pp. 9–55–9–63 (1995)
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
Halbach, M., Hoffmann, R., Both, L. (2006). Optimal 6-State Algorithms for the Behavior of Several Moving Creatures. In: El Yacoubi, S., Chopard, B., Bandini, S. (eds) Cellular Automata. ACRI 2006. Lecture Notes in Computer Science, vol 4173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11861201_66
Download citation
DOI: https://doi.org/10.1007/11861201_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40929-8
Online ISBN: 978-3-540-40932-8
eBook Packages: Computer ScienceComputer Science (R0)