Finding the shortest path in the shortest time using PCNN's

A pulse coupled neural network (PCNN) can run mazes nondeterministically (taking all possible paths) with constant time per step. Thus, when a signal emerges, it has taken the shortest path in the shortest time.

Saved in:
Bibliographic Details
Published inIEEE transactions on neural networks Vol. 10; no. 3; pp. 604 - 606
Main Authors Caulfield, H.J., Kinser, J.M.
Format Journal Article
LanguageEnglish
Published United States IEEE 1999
Subjects
Bioinformatics
Biotechnology
Inspection
Intelligent networks
Missiles
Neural networks
Neurons
Pixel
Shortest-path problems
Steady-state
Online AccessGet full text

Cover

More Information
Summary:A pulse coupled neural network (PCNN) can run mazes nondeterministically (taking all possible paths) with constant time per step. Thus, when a signal emerges, it has taken the shortest path in the shortest time.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:1045-9227
DOI:10.1109/72.761718