A maze routing algorithm based on two dimensional cellular automata

Authors:
Shahram Golzari;Mohammad Reza Meybodi
Affiliations:
Computer Engineering Department, Hormozgan University, Bandarabbas, Iran;Computer Engineering Department, Amir Kabir University, Tehran, Iran
Venue:
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Year:
2006

Citing 6
Cited 0

Cellular automata machines: a new environment for modeling

Cellular automata machines: a new environment for modeling
A path selection global touter

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Computation theoretic aspects of cellular automata

Physica D
A brief history of cellular automata

ACM Computing Surveys (CSUR)
Algorithms for VLSI Physical Design Automation

Algorithms for VLSI Physical Design Automation
Fast maze router

DAC '78 Proceedings of the 15th Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

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.