Abstract
Cellular automata can form the basis of a practical model for a broad range of tasks that require the coordination of many simple computing devices. We propose using “semi-synchronous” cellular automata as a platform for efficiently realizing ant-inspired algorithms that coordinate robots within a fixed, geographically constrained environment. We present an appropriate formalization of the resulting Cellular ANTomaton model, illustrated via “proof-of-concept” problems that have ant-robots move and aggregate in various ways.
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
Böhringer, K.F.: Modeling and controlling parallel tasks in droplet-based microfluidic systems. IEEE Trans. Computer-Aided Design of Integrated Ccts. and Systs. 25, 329–339 (2006)
Burks, A.W. (ed.): Essays on Cellular Automata. Univ. Illinois Press, Urbana-Champaign, IL (1970)
Chen, L., Xu, X., Chen, Y., He, P.: A novel ant clustering algorithm based on cellular automata. In: IEEE/WIC/ACM Intl. Conf. Intelligent Agent Technology (2004)
Chowdhury, D., Guttal, V., Nishinari, K., Schadschneider, A.: A cellular-automata model of flow in ant trails: non-monotonic variation of speed with density. J. Phys. A: Math. Gen. 35, L573–L577 (2002)
Cole, S.N.: Real-time computation by n-dimensional iterative arrays of finite-state machines. In: 7th IEEE Symp. on Foundations of Computer Science, pp. 53–77 (1966)
Geer, D.: Small robots team up to tackle large tasks. IEEE Distr. Systs. Online 6(12) (2005)
Goles, E., Martinez, S. (eds.): Cellular Automata and Complex Systems. Kluwer, Amsterdam (1999)
Gruska, J., La Torre, S., Parente, M.: Optimal time and communication solutions of firing squad synchronization problems on square arrays, toruses and rings. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 200–211. Springer, Heidelberg (2004)
Moore, E.F. (ed.): The firing squad synchronization problem. Sequential Machines, Selected Papers, pp. 213–214. Addison-Wesley, Reading, MA (1962)
Spezzano, G., Talia, D.: The CARPET programming environment for solving scientific problems on parallel computers. Parallel and Distributed Computing Practices 1, 49–61 (1998)
von Neumann, J.: The Theory of Self-reproducing Automata. In: Burks, A.W. (ed.) Univ. of Illinois Press, Urbana-Champaign, IL (1966)
Wolfram, S. (ed.): Theory and Application of Cellular Automata. Addison-Wesley, Reading, MA (1986)
Wolfram, S.: Cellular Automata and Complexity: Collected Papers. Addison-Wesley, Reading, MA (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rosenberg, A.L. (2007). Cellular ANTomata . In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds) Parallel and Distributed Processing and Applications. ISPA 2007. Lecture Notes in Computer Science, vol 4742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74742-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-74742-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74741-3
Online ISBN: 978-3-540-74742-0
eBook Packages: Computer ScienceComputer Science (R0)