作者: Xiaodong Gu , Liming Zhang , Daoheng Yu
DOI: 10.1007/978-3-540-28647-9_69
关键词:
摘要: This paper introduces the DPCNN (Delay Pulse Coupled Neural Network) based on PCNN and uses to find shortest path. Cauflield Kinser introduced method solve maze[1] although their also can be used path, a large quantity of neurons are needed. However, approach proposed in this needed very fewer than by Kinser. Meanwhile, due parallel pulse transmission characteristic DPCNN, our path quickly. The computational complexity is only related length independent weighted graph number existed paths graph.