Finding the Shortest Path Based on Delay PCNN

This paper presents DPCNN(Delay Pulse Coupled Neural Network) based on PCNN and uses DPCNN to find the shortest path successfully.Meanwhile,the algorithm of finding the shortest path based on DPCNN is described.Caulfield and Kinser introduced the PCNN method to solve the maze problem and although their method also can be used to find the shortest path,a large quantity of neurons are needed.However,the approach proposed in this paper needed very fewer neurons than proposed by Caulfield and Kinser.In the meantime,due to the pulse parallel transmission characteristic of DPCNN,the approach proposed can find the shortest path quickly.The computational complexity of our approach is only related to the length of the shortest path, and independent to the path graph complexity and the number of existing paths in the graph.The results of computer simulations show that by using the approach proposed in this paper,we can use a small quantity of neurons to find the shortest path quickly.