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

  • Authors:
  • H. J. Caulfield;J. M. Kinser

  • Affiliations:
  • Fisk Univ., Nashville, TN;-

  • Venue:
  • IEEE Transactions on Neural Networks
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

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