Abstract
The goal is to optimize the behavior of moving creatures by using “time-shuffling” techniques. The “creatures’ exploration problem” is used as an example for a multi-agent problem modeled by cellular automata. The task of the creatures is to visit all empty cells in an environment with a minimum number of steps. The behavior of a creature is modeled by an automaton taking care of the collisions. Time-shuffling means that two behaviors (algorithms X and Y) are sequentially alternated with a certain time period. Ten different “uniform” (non-time-shuffled) algorithms with good performance from former investigations were used. We defined three time-shuffling modes differing in the way how the algorithms are interchanged. New metrics are used for such multi-agent systems, especially the success rate (number of successful explored environments) and the mean normalized work (cost). Time-shuffled systems with a time period of around 100 have resulted in much better success rates and lower cost compared to the uniform systems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Halbach, M., Hoffmann, R.: Solving the exploration’s problem with several creatures more efficiently. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds.) EUROCAST 2007. LNCS, vol. 4739, pp. 596–603. Springer, Heidelberg (2007)
Ediger, P., Hoffmann, R., Halbach, M.: How efficient are creatures with time-shuffled behaviors? In: Nagel, W.E., Hoffmann, R., Koch, A. (eds.) PASA. Lecture Notes in Informatics, vol. 124, pp. 93–103. GI (2008)
Mesot, B., Sanchez, E., Peña, C.A., Perez-Uribe, A.: SOS++: Finding smart behaviors using learning and evolution. In: Standish, R., Bedau, M., Abbass, H. (eds.) Artificial Life VIII: The 8th International Conference on Artificial Life, pp. 264–273. MIT Press, Cambridge (2002)
Di Stefano, B.N., Lawniczak, A.T.: Autonomous roving object’s coverage of its universe. In: CCECE, pp. 1591–1594. IEEE, Los Alamitos (2006)
Sipper, M.: Evolution of Parallel Cellular Machines. LNCS, vol. 1194. Springer, Heidelberg (1997)
Sipper, M., Tomassini, M.: Computation in artificially evolved, non-uniform cellular automata. Theor. Comput. Sci. 217(1), 81–98 (1999)
Komann, M., Mainka, A., Fey, D.: Comparison of evolving uniform, non-uniform cellular automaton, and genetic programming for centroid detection with hardware agents. In: Malyshkin, V.E. (ed.) PaCT 2007. LNCS, vol. 4671, pp. 432–441. Springer, Heidelberg (2007)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ediger, P., Hoffmann, R. (2008). Improving the Behavior of Creatures by Time-Shuffling. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds) Cellular Automata. ACRI 2008. Lecture Notes in Computer Science, vol 5191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79992-4_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-79992-4_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79991-7
Online ISBN: 978-3-540-79992-4
eBook Packages: Computer ScienceComputer Science (R0)