Abstract:

Using pulse coupled neural network (PCNN) to find a shortest path is a non-deterministic algorithm . The computation complexity is only related to the shortest path’s length, and is not related to the complexity of the path graph. The existing PCNN finding shortest path algorithm only takes into account the path length, without considering other parameters. This paper proposes an algorithm based on the bandwidth remaining rate, which considers the influence of the bandwidth remaining amount on the network, as well as the path length; besides, parameter of the bandwidth remaining rate is used to control neurons’ threshold to find the shortest path. The simulation results show that this method can find the global optimal solution.