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

H J Caulfield; J M Kinser

doi:10.1109/72.761718

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

IEEE Trans Neural Netw. 1999;10(3):604-6. doi: 10.1109/72.761718.

Authors

H J Caulfield¹, J M Kinser

Affiliation

¹ Fisk University, Nashville, TN 37208-3051, USA.

PMID: 18252559
DOI: 10.1109/72.761718

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.