Are Several Creatures More Efficient Than a Single One?

  • Rolf Hoffmann
  • Mathias Halbach
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4173)


We are presenting results from our project “Creature’s exploration problem”. The problem is the following: p creatures move around in an environment in order to visit all reachable empty cells in shortest time. All creatures behave according to the same rule.


State Machine Cellular Automaton Cooperative Work Good Algorithm Empty Cell 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)Google Scholar
  2. 2.
    Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)MATHGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    Halbach, M., Heenes, W., Hoffmann, R.: Implementation of the Massively Parallel Model GCA. In: Parallel Computing in Electrical Engineering (PARELEC), Parallel System Architectures (2004)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Hochberger, C.: CDL – Eine Sprache für die Zellularverarbeitung auf verschiedenen Zielplattformen. PhD thesis, TU Darmstadt, Darmstädter Dissertation D17 (1998)Google Scholar
  8. 8.
    Hilbert, D.: Ueber die stetige Abbildung einer Linie auf ein Flachenstück. In: Mathematische Annalen, vol. 38, pp. 459–460. Springer, Heidelberg (1891)Google Scholar
  9. 9.
    Peano, G.: Sur une courbe, qui remplit une aire plane. In: Mathematische Annalen, vol. 36, pp. 157–160. Springer, Heidelberg (1890)Google Scholar
  10. 10.
    Halbach, M., Hoffmann, R.: Minimising the Hardware Resources for a Cellular Automaton with Moving Creatures. In: PARS Newsletter (2006)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    Waldschmidt, S., Hochberger, C.: FPGA synthesis for cellular processing. In: IEEE/ACM International Workshop on Logic Synthesis, pp. 9–55–9–63 (1995)Google Scholar
  13. 13.
    Halbach, M., Hoffmann, R., Both, L.: Optimal 6-State Algorithms for the Behavior of Several Moving Creatures. In: El Yacoubi, S., Chopard, B., Bandini, S. (eds.) ACRI 2006. LNCS, vol. 4173, pp. 571–581. Springer, Heidelberg (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Rolf Hoffmann
    • 1
  • Mathias Halbach
    • 1
  1. 1.FB Informatik, FG RechnerarchitekturTU DarmstadtDarmstadtGermany

Personalised recommendations