Computation of shortest path in cellular automata

Authors:
A. I. Adamatzky
Affiliations:
Biophysics Department, St. Petersburg State University Universitetskaya emb. 7/9, 199034 St. Petersburg, Russia
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1996

Citing 11
Cited 4

Parallel graph algorithms

ACM Computing Surveys (CSUR)
An all pairs shortest path algorithm with expected time O(n2logn)

SIAM Journal on Computing
An incremental mechanical development of systolic solutions to the algebraic path problem

Acta Informatica
A distributed shortest path algorithm for a planar network

Information and Computation
Reversible cellular automata and chemical turbulence

Physica D
A cellular automaton model of excitable media. II: curvature, dispersion, rotating waves and meandering waves

Physica D
A cellular automaton model of excitable media. III: fitting the Belousov-Zhabotinskiiˇ reaction

Physica D
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks

Journal of the ACM (JACM)
Algorithm 97: Shortest path

Communications of the ACM
Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms

SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984

Computing with solitons: a review and prospectus

Collision-based computing
Experimental Reaction–Diffusion Chemical Processors for Robot Path Planning

Journal of Intelligent and Robotic Systems
Hybridizing cellular automata principles and NSGAII for multi-objective design of urban water networks

EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Grand challenge 7: journeys in non-classical computation

VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference

Quantified Score

Hi-index	0.98

Visualization

Abstract

In this paper, we show how to find the shortest path between given nodes of a mesh with weighted edges. We use a cellular automaton which exhibits autowave patterns, where a wave of auto-excitation originates in source node, spreads around the mesh, and modifies states of the cells to make a stationary pattern isomorphed to the shortest path from source node to destination one. For different formulations of the shortest path problem, and various cellular automata (which solve it), we proved the bounds of complexity. For the sake of clarity, we present several examples of cellular automata computation of the shortest path. They are illustrated in detail.