Abstract
This paper propose a maze routing algorithm based on cellular automata. The aim of this algorithm is find the shortest path between the source cell and the target cell , so that the path does not pass from the obstacles. Algorithm has two phases, exploration and retrace. In exploration phase a wave is expanded from source cell and it puts token on cells which it passes via them while expanding. In the retracing phase , we start from target cell, follow the wave and arrive to source cell; the path created in this phase is desirable. Propose algorithm is simple and it’s transactions are local and follow the cellular automata properties. This algorithm find the desirable path in m×m two dimensional CA in O(m2) time step.
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
Bruks, W.: Essay on Cellular Automata. University of Illinois Press, Urbana, IL (1970)
Conway, J.H., Berlekamp, E., Guy, R.: Wining Ways for Your Mathematics Plays, vol. 2. Academic Press, London (1982)
Culik, K., Hurd, L., Yu, S.: Computation Theoritic Aspects of Cellular Automata. Physica D 45, 357–378 (1990)
Farmer, D., Toffoli, T., Wolfram, S. (eds.): Cellular Automata Proceedings of An Interdisciplinary Workshop. North-Holland, Amsterdam (1984)
Gordillo, L., Lunna, V.: Parallel Sort on Linear Array of Cellular Automata. IEEE Transaction on Computers, 1904–1910 (1994)
Gutowitz, A.H.: Cellular Automata. MIT Press, Cambridge, MA (1990)
Hadlock, F.O.: A Shortest Path Algorithm for Grid Graph. Networks (1997)
Lee, C.Y.: An Algorithm for Path Connection and it’s Application. IRE Transaction on Electronic Computers (1961)
Mitchel, M.: Computation in Cellular Automata: A Selected Review. Technical Report. Santa Fe Institute. Santa Fe, New Mexico (1996)
Packard, N.: Two Dimensional Cellular Automata. Journal of Statistical Physics 30, 901–942 (1985)
Pan, Y., Hsu, Y.C., Kubitz, W.J.: A Path Selection Global Router. In: Proceedings of Design Automation Conference (1987)
Sarkar, P.: Brief History of Cellular Automata. ACM Computing Surveys 32(1) (2000)
Sherwani, N.A.: Algorithm for VLSI Physical Design Automation, Western Michigan University. Kluwer Academic Publishers, Dordrecht (1993)
Soukup, J.: Fast Maze Router. In: Proceedings of 15th Design Automation Conference, pp. 100–102 (1987)
Toffoli, T., Margolus, N.: Cellular Automata Machines: A New Environment for Modeling. MIT Press, Cambridge, MA (1987)
Wolfram, S.: Statistical Mechanics of Cellular Automata. Review of Modern Physics 55, 601–644 (1983)
Wolfram, S.: Computation Theory of Cellular Automata. Communication in Mathematical Physics 96, 15–57 (1984)
Wolfram, S.: Theory and Application of Cellular Automata. World scientific, Singapore (1986)
Sagar, V.K., Masara, R.E.: General Purpose Parallel Hardware Approach to the Routing Problems of VLSI Layout. IEEE Proceedings G 140(4), 294–304 (1993)
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
Golzari, S., Meybodi, M.R. (2006). A Maze Routing Algorithm Based on Two Dimensional Cellular Automata. 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_65
Download citation
DOI: https://doi.org/10.1007/11861201_65
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)