Title of article
A new algorithm for finding the shortest paths using PCNNs
Author/Authors
Hong Qu، نويسنده , , Zhang Yi، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2007
Pages
10
From page
1220
To page
1229
Abstract
Pulse coupled neural networks (PCNNs), based on the phenomena of synchronous pulse bursts in the animal visual cortex, are different from traditional artificial neural networks. Caulfield and Kinser have presented the idea of utilizing the autowave in PCNNs to find the solution of the maze problem. This paper which studies the performance of the autowave in PCNNs aims at applying it to optimization problems, such as the shortest path problem. A multi-output model of pulse coupled neural networks (MPCNNs) is studied. A new algorithm for finding the shortest path problem using MPCNNs is presented. Simulations are carried out to illustrate the performance of the proposed method.
Journal title
Chaos, Solitons and Fractals
Serial Year
2007
Journal title
Chaos, Solitons and Fractals
Record number
902709
Link To Document