By Topic

Cellular automata based minimum cost path estimation on binary maps

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
P. Tzionas ; Democritus Univ. of Thrace, Xanthi, Greece ; P. Tsalides ; A. Thanailakis

A new algorithm for the calculation of the minimum cost path between a pair of points on a binary map and its VLSI implementation using a new, multistate, 2D cellular automata architecture, are presented. The main advantages of the proposed architecture are that storage requirements are reduced to a minimum and the speed of operation is very high.

Published in:

Electronics Letters  (Volume:28 ,  Issue: 17 )