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

Authors
Caulfield, HJ Kinser, JM
Citation
Hj. Caulfield et Jm. Kinser, Finding the shortest path in the shortest time using PCNN's, IEEE NEURAL, 10(3), 1999, pp. 604-606
Citations number
7
Categorie Soggetti
AI Robotics and Automatic Control
Journal title
IEEE TRANSACTIONS ON NEURAL NETWORKS
ISSN journal
10459227 → ACNP
Volume
10
Issue
3
Year of publication
1999
Pages
604 - 606
Database
ISI
SICI code
1045-9227(199905)10:3<604:FTSPIT>2.0.ZU;2-5
Abstract
A pulse coupled neural network (PCNN) can run mazes nondeterministically (t aking all possible paths) with constant time per step, Thus, when a signal emerges, it has taken the shortest path in the shortest time.