By Topic

A neural network shortest path algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
T. Haines ; Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA ; J. V. Medanic

This paper develops a neural network implementation of a shortest path algorithm using a Hopfield network architecture. The main advantage of this neural network is that the number of neurons in the network grows linearly with the number of links in the graph instead of growing with the square of the number of nodes in the graph, as is the case with existing algorithms. The properties of this neural network are then investigated and its performance is evaluated through an extensive simulation study

Published in:

Intelligent Control, 1994., Proceedings of the 1994 IEEE International Symposium on

Date of Conference:

16-18 Aug 1994