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

• Published in: IEEE transactions on neural networks Vol. 10; no. 3; pp. 604 - 606
• Main Authors: Caulfield, H.J., Kinser, J.M.
• Format: Journal Article
• Language: English
• Published: United States IEEE 1999
• Subjects: Bioinformatics; Biotechnology; Inspection; Intelligent networks; Missiles; Neural networks; Neurons; Pixel; Shortest-path problems; Steady-state

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.