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 条
  • [41] A wave time-varying neural network for solving the time-varying shortest path problem
    Xu, Zhilei
    Huang, Wei
    Wang, Jinsong
    APPLIED INTELLIGENCE, 2022, 52 (07) : 8018 - 8037
  • [42] A label correcting approach for solving bicriterion shortest-path problems
    Skriver, AJV
    Andersen, KA
    COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (06) : 507 - 524
  • [43] Dynamic threshold P systems with delay on synapses for shortest path problems
    Yang, Silu
    Li, Dong
    Peng, Hong
    Zhou, Wenjie
    Luo, Xiaohui
    Yang, Qian
    Wang, Jun
    Song, Xiaoxiao
    THEORETICAL COMPUTER SCIENCE, 2022, 926 : 62 - 70
  • [44] Lagrangian Relaxation and Enumeration for Solving Constrained Shortest-Path Problems
    Carlyle, W. Matthew
    Royset, Johannes O.
    Wood, R. Kevin
    NETWORKS, 2008, 52 (04) : 256 - 270
  • [45] A SHORTEST AUGMENTING PATH METHOD FOR SOLVING MINIMAL PERFECT MATCHING PROBLEMS
    DERIGS, U
    NETWORKS, 1981, 11 (04) : 379 - 390
  • [46] Direct multiple shooting method for solving approximate shortest path problems
    An, P. T.
    Hai, N. N.
    Hoai, T. V.
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2013, 244 : 67 - 76
  • [47] The Application of Improved Harmony Search Algorithm for Solving Shortest Path Problems
    Jiang, Zhi-wang
    Zhang, Hong-xia
    PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING, 2015, 17 : 38 - 43
  • [48] Simplified Neural Network Architecture for Shortest Path Planning in Optical Network
    Dwivedi, A.
    Srivastava, R.
    Kalra, P. K.
    Singh, Y. N.
    2008 IEEE REGION 10 CONFERENCE: TENCON 2008, VOLS 1-4, 2008, : 1263 - 1266
  • [49] TRI-STATE CASCADING PULSE COUPLED NEURAL NETWORK AND ITS APPLICATION IN FINDING SHORTEST PATH
    Zhao Rongchang
    Ma Yide
    Zhan Kun
    NEURAL NETWORK WORLD, 2009, 19 (06) : 711 - 723
  • [50] Self-adaptive autowave pulse-coupled neural network for shortest-path problem
    Li, Xiaojun
    Ma, Yide
    Feng, Xiaowen
    NEUROCOMPUTING, 2013, 115 : 63 - 71