Shortest path computation using pulse-coupled neural networks with restricted autowave

被引:11
|
作者
Sang, Yongsheng [1 ]
Lv, Jiancheng [1 ]
Qu, Hong [2 ]
Yi, Zhang [1 ]
机构
[1] Sichuan Univ, Coll Comp Sci, Chengdu 610065, Peoples R China
[2] Univ Elect Sci & Technol China, Sch Engn & Comp Sci, Chengdu 611731, Peoples R China
基金
中国国家自然科学基金;
关键词
Shortest path; Pulse-coupled neural networks; Restricted autowave; On-forward/off-backward;
D O I
10.1016/j.knosys.2016.08.027
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Finding shortest paths is an important problem in transportation and communication networks. This paper develops a Pulse-Coupled Neural Network (PCNN) model to efficiently compute a single-pair shortest path. Unlike most of the existing PCNN models, the proposed model is endowed with a special mechanism, called on-forward/off-backward; if a neuron fires, its neighboring neurons in a certain forward region will be excited, whereas the neurons in a backward region will be inhibited. As a result, the model can produce a restricted autowave that propagates at different speeds corresponding to different directions, which is different from the completely nondeterministic PCNN models. Compared with some traditional methods, the proposed PCNN model significantly reduces the computational cost of searching for the shortest path. Experimental results further confirmed the efficiency and effectiveness of the proposed model. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:1 / 11
页数:11
相关论文
共 50 条
  • [1] Self-adaptive autowave pulse-coupled neural network for shortest-path problem
    Li, Xiaojun
    Ma, Yide
    Feng, Xiaowen
    NEUROCOMPUTING, 2013, 115 : 63 - 71
  • [2] On autowave travelling of Discrete Pulse-Coupled Neural Networks
    Shi, MH
    Fan, XJ
    Zhang, JY
    8TH INTERNATIONAL CONFERENCE ON NEURAL INFORMATION PROCESSING, VOLS 1-3, PROCEEDING, 2001, : 903 - 909
  • [3] Efficient Shortest-Path-Tree Computation in Network Routing Based on Pulse-Coupled Neural Networks
    Qu, Hong
    Yi, Zhang
    Yang, Simon X.
    IEEE TRANSACTIONS ON CYBERNETICS, 2013, 43 (03) : 995 - 1010
  • [4] Shortest-path algorithm using adjustable weight pulse-coupled neural network
    Du, Hua
    Zhou, Dongming
    Zhao, Dongfeng
    Bai, Yunhong
    Lin, Lin
    Yi Qi Yi Biao Xue Bao/Chinese Journal of Scientific Instrument, 2007, 28 (SUPPL. 5): : 269 - 273
  • [5] Finding the shortest path in labyrinth based on competitive pulse-coupled neural network
    She, Ying
    Nie, Rencan
    Zhou, Dongming
    Zhao, Dongfeng
    Yi Qi Yi Biao Xue Bao/Chinese Journal of Scientific Instrument, 2007, 28 (SUPPL. 5): : 366 - 369
  • [6] Review of pulse-coupled neural networks
    Wang, Zhaobin
    Ma, Yide
    Cheng, Feiyan
    Yang, Lizhen
    IMAGE AND VISION COMPUTING, 2010, 28 (01) : 5 - 13
  • [7] Computing k shortest paths using modified pulse-coupled neural network
    Liu, Guisong
    Qiu, Zhao
    Qu, Hong
    Ji, Luping
    NEUROCOMPUTING, 2015, 149 : 1162 - 1176
  • [8] Gaussian Noise Filtering Using Pulse-Coupled Neural Networks
    Liu, Ke
    Long, Keming
    Ma, Baozhen
    Yang, Jing
    2018 IEEE 3RD INTERNATIONAL CONFERENCE ON IMAGE, VISION AND COMPUTING (ICIVC), 2018, : 807 - 811
  • [9] Hierarchial simulation of pulse-coupled neural networks
    Henker, S
    2004 47TH MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL II, CONFERENCE PROCEEDINGS, 2004, : 385 - 388
  • [10] Collective chaos in pulse-coupled neural networks
    Olmi, S.
    Politi, A.
    Torcini, A.
    EPL, 2010, 92 (06)