Record 6 from Compendex for: ((meybodi) WN All fields)
Check record to add to Selected Records
A maze routing algorithm based on two dimensional cellular automata
(Computer Engineering Department, Hormozgan University)
Meybodi, Mohammad Reza
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
, v 4173 LNCS,
Cellular Automata - 7th International Conference on Cellular Automata for Research and Industry, ACRI 2006, Proceedings
, 2006, p 564-570
7th International Conference on Cellular Automata for Research and Industry, ACRI 2006, Sep 20-23 2006, Perpignan, France
Univ. de Perpignan;Univ. de Geneve, Dept. d'Informatique;Laboratoire de Mathem. et Phys. pour les Systm.;Pole Univ. Europeen de Montpellier;Region Languedoc Roussillon;et al.
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(m
) time step. © Springer-Verlag Berlin Heidelberg 2006.
Ei controlled terms:
Computer Software, Data Handling and Applications
Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory
Electronic Equipment, Radar, Radio and Television
Full-text and Local Holdings Links
About Engineering Village
© 2006 Elsevier Inc. All rights reserved.