Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
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)
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)
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
Hoffmann, R., Halbach, M. (2006). Are Several Creatures More Efficient Than a Single One?. 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_84
Download citation
DOI: https://doi.org/10.1007/11861201_84
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)