A Forward-wave Neural Network for Solving the Priority Shortest Path Problem

Haoyu Zhu, Sheng Lin, Honghao Zhang, Wei Huang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this study, we proposed a forward-wave neural network (FNN) framework that can find the optimal solution to the priority shortest path problem, which is difficult to achieve with traditional algorithms (such as Dijkstra). The basic idea of FNN comes from the following mechanism: the priority shortest path depends on the rules for divide priority and the automatic waves that can reach the destination node. In the design of FNN, each node in the network is regarded as a wave-based neuron. A neuron is composed of six parts, an input, a wave receiver, a wave filter, a wave generator, a wave sender, and an output. Unlike traditional neural networks, FNN does not require any training. The performance evaluation of FNN and Dijkstra algorithm based on the New York Road example proves that FNN is better than Dijkstra algorithm.

Original languageEnglish
Title of host publicationProceedings of the 2021 5th International Conference on Electronic Information Technology and Computer Engineering, EITCE 2021
PublisherAssociation for Computing Machinery
Pages877-881
Number of pages5
ISBN (Electronic)9781450384322
DOIs
Publication statusPublished - 22 Oct 2021
Externally publishedYes
Event5th International Conference on Electronic Information Technology and Computer Engineering, EITCE 2021 - Xiamen, China
Duration: 22 Oct 202124 Oct 2021

Publication series

NameACM International Conference Proceeding Series

Conference

Conference5th International Conference on Electronic Information Technology and Computer Engineering, EITCE 2021
Country/TerritoryChina
CityXiamen
Period22/10/2124/10/21

Keywords

  • Forward-wave neural network
  • automatic wave
  • divide priority
  • the priority shortest path

Fingerprint

Dive into the research topics of 'A Forward-wave Neural Network for Solving the Priority Shortest Path Problem'. Together they form a unique fingerprint.

Cite this