Are Several Creatures More Efficient Than a Single One?

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.

[1]  D. Hilbert.  Ueber die stetige Abbildung einer Line auf ein Flächenstück , 1891 .

[2]  Hochberger,et al.  FPGA synthesis for cellular processing , 1995 .

[3]  Wolfgang Heenes,et al.  Optimizing the Behavior of a Moving Creature in Software and in Hardware , 2004, ACRI.

[4]  Stefan Waldschmidt,et al.  A Stream Processor Architecture Based on the Configurable CEPRA-S , 2000, FPL.

[5]  Bertrand Mesot,et al.  SOS++: finding smart behaviors using learning and evolution , 2002 .

[6]  Wolfgang Heenes,et al.  Implementation of the Massively Parallel Model GCA , 2004 .

[7]  Rolf Hoffmann,et al.  Implementing cellular automata in FPGA logic , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[8]  Christian Hochberger.  CDL: eine Sprache für die Zellularverarbeitung auf verschiedenen Zielplattformen , 1998 .

[9]  Rolf Hoffmann,et al.  Optimal Behavior of a Moving Creature in the Cellular Automata Model , 2005, PaCT.

[10]  Rolf Hoffmann,et al.  Optimal 6-State Algorithms for the Behavior of Several Moving Creatures , 2006, ACRI.

[11]  G. Peano.  Sur une courbe, qui remplit toute une aire plane , 1890 .

[12]  Rolf Hoffmann,et al.  Minimising the Hardware Resources for a Cellular Automaton with Moving Creatures , 2006, ARCS Workshops.

[13]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[14]  E. F. Codd,et al.  Cellular automata , 1968 .