Abstract
We are presenting results of the creature’s exploration problem with several creatures. The task of the creatures is to visit all empty cells in an environment with obstacles in shortest time and with a maximum of efficiency. The cells are arranged in a regular 2D grid and the underlying processing model is a Cellular Automaton (CA). We have investigated the question how many creatures and which algorithm should be used in order to fulfill the task most efficiently with lowest cost. We use a set of 10 different behaviors (algorithms) for the creature which have proved to be very efficient in the case where only one creature explores the environment. These algorithms were found by exhaustive search and evaluation by the aid of hardware (FPGA) implementation. Different environments and a varying number (1 to 64) of creatures were used in simulations in order to evaluate the cooperative work and efficiency. It turned out that for each environment a certain number of creatures and a certain algorithm is cost optimal in terms of work units. The total amount of work using one creature with the best algorithm X is many cases higher than the work using n creature with an adequate algorithm Y. Using several creatures, positive conflicts arise which may help to solve the problem more efficiently.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Mesot, B., Sanchez, E., Pena, C.A., Perez-Uribe, A.: SOS++: Finding Smart Behaviors Using Learning and Evolution. In: 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. (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 (1998)
Hilbert, D.: Ueber die stetige Abbildung einer Linie auf ein Flachenstück. Mathematische Annalen 38(3), 459–460 (1891)
Peano, G.: Sur une courbe, qui remplit une aire plane. Mathematische Annalen 36(1), 157–160 (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, 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, Springer, Heidelberg (2006)
Hoffmann, R., Halbach, M.: Are several creatures more efficient than a single one? In: El Yacoubi, S., Chopard, B., Bandini, S. (eds.) ACRI 2006. LNCS, vol. 4173, pp. 707–711. Springer, Heidelberg (2006)
Fey, D., Schmidt, D.: Marching Pixels: A new organic computing principle for smart CMOS camera chips. In: Workshop on Self-Organization and Emergence - Organic Computing and its Neighboring Disciplines, Innsbruck, Austria, pp. 123–130 (2005)
Fey, D., Schmidt, D.: Marching-Pixels: A New Organic Computing Paradigm for Smart Sensor Processor Arrays. In: International Conference on Computing Frontiers 2005, pp. 1–7. ACM, Ischia, Italy (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Halbach, M., Hoffmann, R. (2007). Solving the Exploration’s Problem with Several Creatures More Efficiently. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2007. EUROCAST 2007. Lecture Notes in Computer Science, vol 4739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75867-9_75
Download citation
DOI: https://doi.org/10.1007/978-3-540-75867-9_75
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75866-2
Online ISBN: 978-3-540-75867-9
eBook Packages: Computer ScienceComputer Science (R0)