A New Algorithm for Finding the Shortest Path Tree Using Competitive Pulse Coupled Neural Network

Authors:
Dongming Zhou;Rencan Nie;Dongfeng Zhao
Affiliations:
Information College, Yunnan University, Kunming, China 650091;Information College, Yunnan University, Kunming, China 650091;Information College, Yunnan University, Kunming, China 650091
Venue:
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
Year:
2008

Citing 3
Cited 0

Feature linking via synchronization among distributed assemblies: Simulations of results from cat visual cortex

Neural Computation
PCNN models and applications

IEEE Transactions on Neural Networks
Finding the shortest path in the shortest time using PCNN's

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The competitive pulse coupled neural network (CPCNN) model is proposed based on the pulse coupled neural network (PCNN), the properties of pulse wave propagation of the CPCNN are analyzed for the solution of network shortest routing. The setting terms of the neuron parameters for the pulse wave propagation along the routing of the shortest path tree (SPT) of network routing graph are educed. The simulation results show that the proposed method is better than Dijkstra algorithm when the network routing graph holds many nodes. With the nodes number of the network increasing, the number of iterations of our algorithm will basically hold the line. The method shows better computational performance and dominance.