Output-threshold coupled neural network for solving the shortest path problems

被引:9
|
作者
Zhang, JY [1 ]
Wang, DF
Shi, MH
Wang, JY
机构
[1] Xidian Univ, Key Lab Radar Signal Proc, Xian 710071, Peoples R China
[2] Xian Engn Sci & Technol Inst, Dept Comp, Xian 710048, Peoples R China
[3] Xidian Univ, Inst Comp Sci, Xian 710071, Peoples R China
[4] Virginia Polytech Inst & State Univ, Dept Elect & Comp Engn, Alexandria, VA 22314 USA
来源
基金
中国国家自然科学基金;
关键词
shortest path problem; pulse-coupled neural networks (PCNNs); autowave; output-threshold coupled neural networks (OTCNNs);
D O I
10.1360/02yf0313
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a coupled neural network, called output-threshold coupled neural network (OTCNN), which can mimic the autowaves in the present pulsed coupled neural networks (PCNNs), by the construction of mutual coupling between neuron outputs and the threshold of a neuron. Based on its autowaves, this paper presents a method for finding the shortest path in shortest time with OTCNNs. The method presented here features much fewer neurons needed, simplicity of the structure of the neurons and the networks, and large scale of parallel computation. It is shown that OTCNN is very effective in finding the shortest paths from a single start node to multiple destination nodes for asymmetric weighted graph, with a number of iterations proportional only to the length of the shortest paths, but independent of the complexity of the graph and the total number of existing paths in the graph. Finally, examples for finding the shortest path are presented.
引用
收藏
页码:20 / 33
页数:14
相关论文
共 50 条
  • [21] 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
  • [22] A time-delay neural network for solving time-dependent shortest path problem
    Huang, Wei
    Yan, Chunwang
    Wang, Jinsong
    Wang, Wei
    NEURAL NETWORKS, 2017, 90 : 21 - 28
  • [23] Parallel algorithms for solving aggregated shortest-path problems
    Romeijn, HE
    Smith, RL
    COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (10-11) : 941 - 953
  • [24] Solving shortest path problems with a weight constraint and replenishment arcs
    Smith, Olivia J.
    Boland, Natashia
    Waterer, Hamish
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (05) : 964 - 984
  • [25] Exact methods for solving the elementary shortest and longest path problems
    Quoc Trung Bui
    Deville, Yves
    Quang Dung Pham
    ANNALS OF OPERATIONS RESEARCH, 2016, 244 (02) : 313 - 348
  • [26] Neural Network for Shortest Path Problems Accelerated with Parallel Multi-Core Architecture
    Mejia-Lavalle, Manuel
    Paredes Cano, Jose J.
    Mujica Vargas, Dante
    Sossa, Humberto
    2018 INTERNATIONAL CONFERENCE ON MECHATRONICS, ELECTRONICS AND AUTOMOTIVE ENGINEERING (ICMEAE 2018), 2018, : 75 - 80
  • [27] Solving Shortest Path Problems with Curvature Constraints Using Beamlets
    Arslan, Oktay
    Tsiotras, Panagiotis
    Huo, Xiaoming
    2011 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, 2011, : 3533 - 3538
  • [28] SOLVING CONSTRAINED SHORTEST-PATH PROBLEMS IN A UNIFIED WAY
    CHEN, YL
    CHIN, YH
    COMPUTING AND INFORMATION, 1989, : 57 - 63
  • [29] Exact methods for solving the elementary shortest and longest path problems
    Quoc Trung Bui
    Yves Deville
    Quang Dung Pham
    Annals of Operations Research, 2016, 244 : 313 - 348
  • [30] A PARAMETRIC APPROACH TO SOLVING BICRITERION SHORTEST-PATH PROBLEMS
    MOTE, J
    MURTHY, I
    OLSON, DL
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 53 (01) : 81 - 92